---
http_interactions:
- request:
method: get
uri: https://doi.org/10.4230/lipics.tqc.2013.93
body:
encoding: US-ASCII
string: ''
headers:
User-Agent:
- Maremma - https://github.com/datacite/maremma
Accept:
- application/vnd.datacite.datacite+xml
response:
status:
code: 303
message: ''
headers:
Server:
- Apache-Coyote/1.1
Vary:
- Accept
Location:
- http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
Expires:
- Fri, 24 Feb 2017 00:31:22 GMT
Content-Type:
- text/html;charset=utf-8
Content-Length:
- '191'
Date:
- Thu, 23 Feb 2017 23:42:08 GMT
body:
encoding: UTF-8
string: |-
Handle Redirect
http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
http_version:
recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
- request:
method: get
uri: http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
body:
encoding: US-ASCII
string: ''
headers:
User-Agent:
- Maremma - https://github.com/datacite/maremma
Accept:
- application/vnd.datacite.datacite+xml
response:
status:
code: 301
message: ''
headers:
Server:
- openresty/1.11.2.2
Date:
- Thu, 23 Feb 2017 23:42:09 GMT
Content-Type:
- text/html
Content-Length:
- '191'
Connection:
- keep-alive
Location:
- https://data.datacite.org/10.4230%2Flipics.tqc.2013.93
body:
encoding: UTF-8
string: "\r\n301 Moved Permanently\r\n\r\n301 Moved Permanently
\r\n
openresty/1.11.2.2\r\n\r\n\r\n"
http_version:
recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
- request:
method: get
uri: https://data.datacite.org/10.4230%2Flipics.tqc.2013.93
body:
encoding: US-ASCII
string: ''
headers:
User-Agent:
- Maremma - https://github.com/datacite/maremma
Accept:
- application/vnd.datacite.datacite+xml
response:
status:
code: 200
message: ''
headers:
Server:
- openresty/1.11.2.2
Date:
- Thu, 23 Feb 2017 23:42:09 GMT
Content-Type:
- application/vnd.datacite.datacite+xml
Content-Length:
- '1919'
Connection:
- keep-alive
Cache-Control:
- no-transform, max-age=3600
Last-Modified:
- Wed, 13 Nov 2013 13:42:17 GMT
Vary:
- Accept
Access-Control-Allow-Origin:
- "*"
Access-Control-Allow-Methods:
- GET, POST, OPTIONS
body:
encoding: UTF-8
string: "\n\n10.4230/LIPIcs.TQC.2013.93\n\n\nJohnston,
Nathaniel\n\n\n\n\tThe Minimum
Size of Qubit Unextendible Product Bases\n\nSchloss
Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany\n2013\n\n\tComputer
Science\n\t000 Computer science,
knowledge, general works\n\n\n\t\n\t\tHerbstritt, Marc\n\t\n\n\n\t2013-11-05\n\neng\nConferencePaper\n\n\t13
pages\n\n\n\tapplication/pdf\n\n1.0\nCreative
Commons Attribution 3.0 Unported license (CC-BY 3.0)\n\n\t\n\tWe investigate the problem of constructing unextendible
product bases in the qubit case - that is, when each local dimension equals
2. The cardinality of the smallest unextendible product basis is known in
all qubit cases except when the number of parties is a multiple of 4 greater
than 4 itself. We construct small unextendible product bases in all of the
remaining open cases, and we use graph theory techniques to produce a computer-assisted
proof that our constructions are indeed the smallest possible.\n\t\n\n\n"
http_version:
recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
recorded_with: VCR 3.0.3