{"as_of":"2026-08-14T07:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d94ac3760f3c45854835d01cc0f1c5492f8937d6584922893988cd19ee6ec69","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:23:13.805085Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.01438/citation-record","integrity":"/paper/2608.01438/integrity","json":"/paper/2608.01438/citation-record.json","paper":"/paper/2608.01438"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.319508Z","title":"Quantum entanglement.Re- views of Modern Physics, 81(2):865–942, 2009","venue":null,"work_id":"adb74ffe-37c3-41dd-98b3-34e94ab080e0","year":2009},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:12.719376Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:b4a78fb30443b35c60057330a4242f61b606f76b6ee7fb266acdf2dd975b945a","observation_id":"68260098-1f21-48b0-95eb-35801d13c6bb","resolution":{"observed_at":"2026-08-06T00:23:14.323877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.306254Z","title":"Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels.Physical Review Letters, 70(13):1895, 1993","venue":null,"work_id":"7e98e6b1-418a-4c48-9125-fb74e39860c8","year":1993},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:12.786397Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:e193452633d385af9de4365e7215f430b888c206e984f08df915853d232f6c9f","observation_id":"be9e0783-adb4-495c-9c0d-dd20c5be4c8b","resolution":{"observed_at":"2026-08-06T00:23:14.310611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.292950Z","title":"Quantum cryptography based on bell’s theorem.Physical Review Letters, 67(6):661, 1991","venue":null,"work_id":"80df0945-b23a-43b0-af4c-cb26ac960f61","year":1991},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:12.904229Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:d00790413b2ac86bef6728d93c311463fe16fcefea27c8bc43ab54b519d7fa6a","observation_id":"3c1f2c09-3f2a-45a0-8821-ebb18aef7b92","resolution":{"observed_at":"2026-08-06T00:23:14.297335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.279777Z","title":"Detecting quantum entanglement.Theoretical Computer Science, 287(1):313–335, 2002","venue":null,"work_id":"6b6d4581-1620-4520-933c-ddbed19f6e29","year":2002},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.076068Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:97728240808bc6d1dabc31cacc5350c6d99b68842fc98e49350927956e73ef55","observation_id":"6c8266a7-1ebe-4428-9158-930b6570e149","resolution":{"observed_at":"2026-08-06T00:23:14.283965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.153146Z","title":"Classical complexity and quantum entanglement.Journal of Computer and System Sciences, 69(3):448–484, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.153146Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:0ee874ca560d6ceacd88abfe758a414eb2a8d61250f61e0d9f40f8005e8081a8","observation_id":"452f0cd7-92ca-4c80-ab8b-24d0b99fa7a8","resolution":{"observed_at":"2026-08-06T00:23:13.153146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.258006Z","title":"Strong np-hardness of the quantum separability problem.Quantum Information and Com- putation, 10(3):343–360, 2010","venue":null,"work_id":"0b20d639-e429-4154-9bfc-790f6ec3796b","year":2010},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.239304Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:a4e1558a23379bec7a22a45ee6fc58b3f1683a272215559475e58f99c87f61a6","observation_id":"783bb7a3-b6eb-4e9f-9ab4-19a4db5e4629","resolution":{"observed_at":"2026-08-06T00:23:14.262014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.245008Z","title":"Quantum entanglement in neural network states.Physical Review X, 7(2):021021, 2017","venue":null,"work_id":"977005d1-f43c-4f74-884c-822557e36cee","year":2017},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.350322Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:9d18bd1de33cd5ac2a3becda7e176d3e52e477db49e505253d2318fc55b6318f","observation_id":"d012f04e-b9c8-4fb9-a864-e6ed2cbc3f06","resolution":{"observed_at":"2026-08-06T00:23:14.248951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.510428Z","title":"Separability-entanglement classifier via machine learning.Physical Review A, 98(1):012315, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.510428Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:780e977eb66692c277fd13bc1cb73cad314a119864c263e0156d33b83975db5c","observation_id":"37ab2612-4450-4084-805f-19e3b657d1d7","resolution":{"observed_at":"2026-08-06T00:23:13.510428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.223539Z","title":"Entanglement classification via neural network quantum states.New Journal of Physics, 22(4):045001, 2020","venue":null,"work_id":"f96c0c8f-9a12-4591-bc2b-9ab0c18886bc","year":2020},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.642536Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:b2848332970857f017efce861505d757be6cfc48d4a9f65c8855d361002c3b33","observation_id":"382f7ab7-dd06-4f41-a235-067624bc4139","resolution":{"observed_at":"2026-08-06T00:23:14.227374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.210846Z","title":"Unsupervised recognition of informative features via tensor network machine learning and quantum entanglement variations.Chinese Physics Letters, 39(10):100701, 2022","venue":null,"work_id":"7cae0852-a852-494a-bd72-afefee814c76","year":2022},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.695096Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:525d54e1e1d22b8081f57c3b39898f4f5f159d24900dae8f77c4b854c0824fc3","observation_id":"51183ca6-a8f5-492f-b0b0-42f56e4b3c26","resolution":{"observed_at":"2026-08-06T00:23:14.215066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.197931Z","title":"Entanglement verification with deep semisupervised machine learning.Physical Review A, 108(2):022427, 2023","venue":null,"work_id":"df045b7b-dd3a-4a85-b746-5bdb59e42b3d","year":2023},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.699182Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:578ee78378e3cd1fa711338e3d1bdd4313f528dca374d4c9e4ad79f4a9314fe8","observation_id":"b1661352-e291-416a-bc9f-203d88455dd2","resolution":{"observed_at":"2026-08-06T00:23:14.202037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.185625Z","title":"Entanglement structure detection via computer vision.Physical Review A, 110(1):012448, 2024","venue":null,"work_id":"5164fa9a-4323-4fab-a866-b5317ade6d5e","year":2024},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.702776Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:e3bbb7576eeaa9ec167a53b5f3d8c293d81fa8e5e1ec4f8fb499fd9ae9820333","observation_id":"c30b11b1-51f0-4fd8-bb60-1e87f38d5067","resolution":{"observed_at":"2026-08-06T00:23:14.189505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.171867Z","title":"Direct entan- glement detection of quantum systems using machine learning.npj Quantum Information, 11(1):29, 2025","venue":null,"work_id":"3826835d-ba61-402a-9b3b-e40c59724b29","year":2025},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.706884Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:76b772a8f9a88f63afe682bef1e3300aa8b43283908a8979f5ac127a1930a7d8","observation_id":"c0be0676-502e-4f5b-a590-347c5fa25dbb","resolution":{"observed_at":"2026-08-06T00:23:14.176124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.158187Z","title":"Unextendible product bases and bound entanglement.Physical Review Letters, 82(26):5385, 1999","venue":null,"work_id":"701a114f-7f59-4c49-8fa9-9bda96ede0ca","year":1999},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.710573Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:4f6d38886581ad547be4977e8c9d5f2dc13db1b3923489dce4cad4a4446acee3","observation_id":"63bca031-667a-47ec-bd51-3362ebd55fba","resolution":{"observed_at":"2026-08-06T00:23:14.162488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.145284Z","title":"Unextendible product bases, uncompletable product bases and bound entanglement.Communications in Mathematical Physics, 238(3):379–410, 2003","venue":null,"work_id":"e8ae63d2-b061-4327-a78b-1b028b259c93","year":2003},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.714516Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:08aa280642eb08c3293426d72c8dfbc0bf648928ae63b1078b207080d1ab090e","observation_id":"62d927ea-6d3c-47b8-ad02-b8c9fcba7dd1","resolution":{"observed_at":"2026-08-06T00:23:14.149394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.132207Z","title":"On the maximal dimension of a completely entangled subspace for finite level quantum systems.Proceedings Mathematical Sciences, 114(4):365–374, 2004","venue":null,"work_id":"f2ab9ca5-4133-43ce-8840-b63faa04a073","year":2004},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.718600Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:42924f4e81848d1778d5e7228a754443301f40f9ff16740e970df4adbdc43e61","observation_id":"90e729ce-b919-4f1e-b9c5-f9ba4fac53ca","resolution":{"observed_at":"2026-08-06T00:23:14.136249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.119593Z","title":"From unextendible product bases to genuinely entangled sub- spaces.Physical Review A, 98(1):012313, 2018","venue":null,"work_id":"5fb0fd44-825c-4f42-b5bc-5c5b53d5a32a","year":2018},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.722454Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:48e8c6112a02e3701b54118d1601dabac840a9a4b4008c74d7a28accd269677f","observation_id":"f1e3df18-2fa7-4f84-b144-a255d57ac2de","resolution":{"observed_at":"2026-08-06T00:23:14.123534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.106676Z","title":"Completely entangled subspaces of entangle- ment depth k.Physical Review A, 110(1):012403, 2024","venue":null,"work_id":"99b6dc57-8a9b-436c-b8fc-64f2c23661a3","year":2024},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.726639Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:659b0e64134dea9dd4a90ec30aab30ac8d4c4573653b0c740b6a33716926bf7a","observation_id":"0566f501-783d-4b94-af50-5b5911245e83","resolution":{"observed_at":"2026-08-06T00:23:14.110814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.730353Z","title":"Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?Physical Review Letters, 80(24):5239, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.730353Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:b60bec31cbea4b99f71465fe17c6940a6e350c2d4ae271d4fd39a9c89f83073f","observation_id":"11d4382a-5442-4938-9fb7-9b19301afd51","resolution":{"observed_at":"2026-08-06T00:23:13.730353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.084771Z","title":"Quantum nonlocality without entanglement.Physical Review A, 59(2):1070, 1999","venue":null,"work_id":"d87df1e1-eda1-4c5b-a657-487b6e7615ac","year":1999},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.734028Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:bfdcb91cc1523a4344a21afd0b496cc872162ed54b8e8f891b1351129dc504a7","observation_id":"a435cb67-9343-478d-9019-c08e9c280f3f","resolution":{"observed_at":"2026-08-06T00:23:14.088737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.071682Z","title":"Bell inequalities with no quantum violation and unextendable product bases.Physical Review Letters, 107(7):070401, 2011","venue":null,"work_id":"ab7034c4-e7f9-4713-899d-87c1fbd1501a","year":2011},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.737973Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:8200ce5c93a9ebca30c339a70323ea49fc9efffd119dcf4a9eeaed187d1b16d5","observation_id":"6de0c6c0-7825-4106-abe7-fea8e4beb043","resolution":{"observed_at":"2026-08-06T00:23:14.075985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.059447Z","title":"Tight bell inequalities with no quantum violation from qubit unextendible product bases","venue":null,"work_id":"1dc46255-dc19-43d4-a1d0-c6f215923c5a","year":2012},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.741550Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:48f0aa083a0bfc95e22654bdc4ff485e5ee8aafb790b4582000ce626a957cee4","observation_id":"b5bbd591-5f70-4b95-8754-a8832e5384ac","resolution":{"observed_at":"2026-08-06T00:23:14.063367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.047119Z","title":"Unextendible product bases.Journal of Combinatorial Theory","venue":null,"work_id":"57da97f5-8ae9-4c6b-88d1-4d3ad5069b68","year":2001},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.745399Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:5e00c6a3d0f05aef91e1e5a36868fe4ae2713d21ff47c825673d27e094ad9098","observation_id":"a7d76998-b517-47ad-ba37-a626af20f59c","resolution":{"observed_at":"2026-08-06T00:23:14.051161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.034953Z","title":"Unextendible product bases and 1-factorization of complete graphs.Discrete Applied Mathematics, 154(6):942–949, 2006","venue":null,"work_id":"902ed2d1-040c-4abc-9f31-8f342efae921","year":2006},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.749284Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:a3f504a4fc615e0655ef990a124e6da60e6c4282a574a8cb996143f158efa4a1","observation_id":"74817684-8825-42eb-bba4-57148a78b16c","resolution":{"observed_at":"2026-08-06T00:23:14.038951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.022243Z","title":"The minimum size of unextendible product bases in the bipartite case (and some multipartite cases).Communications in Mathematical Physics, 333(1):351–365, 2015","venue":null,"work_id":"e9e63ffd-e7ad-49f8-9b73-50af3703e4cb","year":2015},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.752951Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:bec835f08eae32a904aaa7194294b05d8366ca0f0f7afd77053eb5b56c4e37e7","observation_id":"ea6b5655-3f7f-4b33-ba94-65286df8e19e","resolution":{"observed_at":"2026-08-06T00:23:14.026325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:14.009336Z","title":"Genuinely entangled subspace with all-encompassing distillable entanglement across every bipartition.Physical Review A, 99:032335, 2019","venue":null,"work_id":"f824b84a-95ff-483f-9445-42d11e284267","year":2019},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.756578Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:945069e858833ed265dbd925c8ec998860047636b83f4745e6b9168484da828a","observation_id":"029815f7-8183-4a21-8d71-a798f0151ec8","resolution":{"observed_at":"2026-08-06T00:23:14.013193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.997116Z","title":"Unextendible product bases from tile structures and their local entanglement-assisted distinguishability.Physical Review A, 101(6):062329, 2020","venue":null,"work_id":"c113607d-e681-421f-a68e-a0fe2d7bf03c","year":2020},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.760180Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:800be7db8f6e8bbe7f8eebeef9465f783eb856afe91f6ef97b402465c0621080","observation_id":"7d1c0de6-2896-48f3-8932-d95232778fc3","resolution":{"observed_at":"2026-08-06T00:23:14.001306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.983032Z","title":"Unextendible product bases from tile structures in bipartite systems.Journal of Physics A: Mathematical and Theoretical, 56(1):015303, 2023","venue":null,"work_id":"bb495121-d43c-46f1-9eea-7eb3ef3ce31d","year":2023},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.763823Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:3ff7849544e59f72f90c062b83173c78537e5fbb4e4dd260543d4ce902f79036","observation_id":"c08db51a-efd8-4cde-8a55-c480cabb8252","resolution":{"observed_at":"2026-08-06T00:23:13.988585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.970051Z","title":"Constructing the three-qudit unextendible product bases with strong nonlocality.Chinese Physics B, 31(6):060302, 2022","venue":null,"work_id":"9b57c34e-fdf1-4496-8659-0c0549163457","year":2022},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.767617Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:2d99729efe6c7b026fe1a5d1f58927a42eacecf4f9b70a871babc14aef317b26","observation_id":"bf2eff41-bd1a-4e86-8cd4-55513a2bb3f8","resolution":{"observed_at":"2026-08-06T00:23:13.974343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.956203Z","title":"Strong quantum nonlocality and unextendibility without entanglement inn-partite systems with oddn.Quantum, 8:1349, 2024","venue":null,"work_id":"4b3d3179-35ee-4138-800b-ca1970a2ad98","year":2024},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.771236Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:db968217caf7a4080cff16162c9b3e407c35a32246442598d7573b5bf11dde4a","observation_id":"67d4b499-d8c7-49be-b214-173e2161bd37","resolution":{"observed_at":"2026-08-06T00:23:13.961072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.943204Z","title":"Strongly nonlocal unextendible product bases do exist.Quantum, 6:619, 2022","venue":null,"work_id":"64408dcd-2031-4f30-a65e-921eddfa4001","year":2022},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.775143Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:80b47421da43da63bbd799b28e4a01ec1c7f54e3130cbd40c84fd7bd913e2a46","observation_id":"c5da6946-457b-41dc-a85f-4ed3c7bb4456","resolution":{"observed_at":"2026-08-06T00:23:13.947375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.930203Z","title":"The structure of qubit unextendible product bases.Journal of Physics A: Mathematical and Theoretical, 47(42):424034, 2014","venue":null,"work_id":"e7c54c50-ee2d-45db-b935-ad23296f2a1a","year":2014},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.778830Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:83ea122f17d3ce8753ce643b4db11ce36042ad892ba201c724114dc21d5dcb6d","observation_id":"3b78f235-c57a-49a4-93f4-9a9f66359b30","resolution":{"observed_at":"2026-08-06T00:23:13.934482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.917428Z","title":"Graph-theoretic characterization of unextendible product bases.Physical Review Research, 5(3):033144, 2023","venue":null,"work_id":"8213fadf-1d8c-4d98-a233-79e92c67acc6","year":2023},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.782590Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:74f6ab8aa91669fb2bc3237e2cd2131b31805c088af15e463e12467831bca0e2","observation_id":"a145c669-54fd-4d0d-bea1-df5b10b6c5dd","resolution":{"observed_at":"2026-08-06T00:23:13.921536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.903067Z","title":"Unextendible and strongly uncompletable product bases.Journal of Mathematical Physics, 65(11):112201, 2024","venue":null,"work_id":"c0c4e93b-abdc-499a-a315-a0d5a0924496","year":2024},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.786441Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:c8728e808b6cec98f2f75ab069ad21dde261a921cd86031079e182cab04cba95","observation_id":"fbf54bcb-2662-416f-b4ad-577d725cc714","resolution":{"observed_at":"2026-08-06T00:23:13.907736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.889356Z","title":"Strong quantum nonlocality for unextendible product bases in heterogeneous systems.Journal of Physics A: Mathematical and Theoretical, 55(1):015305, 2022","venue":null,"work_id":"87d93eda-4a16-40b3-b2ae-b7dc880fe649","year":2022},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.790105Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:994678b730038ccfcdf3f168555f768cae666f37002068b0660088ff8ddbf007","observation_id":"f31743a2-c164-4bec-bd2e-3d5754975e89","resolution":{"observed_at":"2026-08-06T00:23:13.893377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.876198Z","title":"The construction of multiqubit unextendible product bases, 2024","venue":null,"work_id":"f133aa7c-a4d5-4ceb-b906-cd613a2f342a","year":2024},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.793606Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:ca0a71cc74f901d8a3042c9a37ade20ea0fb5cdb7273d6fbda9d2d2b50c0974f","observation_id":"86647434-baa4-4c42-ac2c-a5390b7a9d2f","resolution":{"observed_at":"2026-08-06T00:23:13.880252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.863048Z","title":"QETLAB: A MATLAB toolbox for quantum entanglement, version 1.0.https://qetlab","venue":null,"work_id":"1c42a8ff-4da7-43df-bbdb-8ccc68e5a746","year":2016},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.797764Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:dd68ff59114e42d53ce4112bf29b1478c88eeca491fcac82f27bd42108480fff","observation_id":"b74c979b-89f1-451d-8548-d0515cf995ff","resolution":{"observed_at":"2026-08-06T00:23:13.866991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.849886Z","title":"The minimum size of qubit unextendible product bases","venue":null,"work_id":"b7cae9d9-bef7-4dfe-a568-b628610aa2a3","year":2013},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.801541Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:da96d9db947c47cb1df6324aecdeb1ff025712f0bd1455d755a9a826453a1fbb","observation_id":"b78c4a25-682d-42de-ac2f-f873564ff14b","resolution":{"observed_at":"2026-08-06T00:23:13.854181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:13.833927Z","title":"New results on unextendible product bases (in chinese).Scientia Sinica Mathematica, 51(10):1699–1714, 2021","venue":null,"work_id":"1df53ebd-099f-4e87-bc2c-acdd9520912e","year":2021},"citing_paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:13.805085Z"},"links":{"citing_paper":"/paper/2608.01438"},"observation_digest":"sha256:42b38b2418bb856d9988241e82ba77ddc0b9ad4a2d0b1374bd829fcf79db3033","observation_id":"82f7d408-690f-48cf-a095-407b69a8d21b","resolution":{"observed_at":"2026-08-06T00:23:13.840517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.01438","last_updated":"2026-08-02T18:47:51Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T23:26:35.185724Z","submitted_at":"2026-08-02T18:47:51Z","title":"Automated Construction and Verification of Unextendible Product Bases"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2608.01438."}