{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RXRLACM6LKSALKNWXKVQ76RHLI","short_pith_number":"pith:RXRLACM6","schema_version":"1.0","canonical_sha256":"8de2b0099e5aa405a9b6baab0ffa275a35e79ed7ed55e470f1306c291db19186","source":{"kind":"arxiv","id":"2608.09504","version":1},"attestation_state":"computed","paper":{"title":"Genuinely Unextendible Product Bases from Maximum Distance Separable Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mao-Sheng Li","submitted_at":"2026-08-10T12:07:04Z","abstract_excerpt":"The existence of genuinely unextendible product bases (GUPBs), incomplete orthogonal sets of fully product states whose orthogonal complements contain no product vector across any bipartition, has remained an open problem. Here we construct GUPBs for any number $N\\geq3$ of parties using classical maximum distance separable (MDS) codes. The MDS property imposes a rigidity on the induced product tiling across every bipartition; combined with Fourier mode deletion and a stopper state, this rigidity enforces genuine unextendibility. Consequently, the orthogonal complement of each GUPB is a genuine"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.09504","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T12:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"16c9f6770203574c7881d0aff9f246a2137678c0cb761d74fca381f1b5db0f61","abstract_canon_sha256":"92b0ffcea8757488ca199ebaf695d9addc190dc16b363c2b47888a19fcef6efc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:24:21.445727Z","signature_b64":"++jubODTek4FLFYoNOtHcstdjrvQSK/Jftgdi82txbomKzBd+1KalcLt0FXRfBhxizOwwt6bgQiIlbKmixsZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de2b0099e5aa405a9b6baab0ffa275a35e79ed7ed55e470f1306c291db19186","last_reissued_at":"2026-08-11T02:24:21.444114Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:24:21.444114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genuinely Unextendible Product Bases from Maximum Distance Separable Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mao-Sheng Li","submitted_at":"2026-08-10T12:07:04Z","abstract_excerpt":"The existence of genuinely unextendible product bases (GUPBs), incomplete orthogonal sets of fully product states whose orthogonal complements contain no product vector across any bipartition, has remained an open problem. Here we construct GUPBs for any number $N\\geq3$ of parties using classical maximum distance separable (MDS) codes. The MDS property imposes a rigidity on the induced product tiling across every bipartition; combined with Fourier mode deletion and a stopper state, this rigidity enforces genuine unextendibility. Consequently, the orthogonal complement of each GUPB is a genuine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09504","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.09504/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.09504","created_at":"2026-08-11T02:24:21.444756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09504v1","created_at":"2026-08-11T02:24:21.444756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09504","created_at":"2026-08-11T02:24:21.444756+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXRLACM6LKSA","created_at":"2026-08-11T02:24:21.444756+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXRLACM6LKSALKNW","created_at":"2026-08-11T02:24:21.444756+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXRLACM6","created_at":"2026-08-11T02:24:21.444756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI","json":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI.json","graph_json":"https://pith.science/api/pith-number/RXRLACM6LKSALKNWXKVQ76RHLI/graph.json","events_json":"https://pith.science/api/pith-number/RXRLACM6LKSALKNWXKVQ76RHLI/events.json","paper":"https://pith.science/paper/RXRLACM6"},"agent_actions":{"view_html":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI","download_json":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI.json","view_paper":"https://pith.science/paper/RXRLACM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09504&json=true","fetch_graph":"https://pith.science/api/pith-number/RXRLACM6LKSALKNWXKVQ76RHLI/graph.json","fetch_events":"https://pith.science/api/pith-number/RXRLACM6LKSALKNWXKVQ76RHLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI/action/storage_attestation","attest_author":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI/action/author_attestation","sign_citation":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI/action/citation_signature","submit_replication":"https://pith.science/pith/RXRLACM6LKSALKNWXKVQ76RHLI/action/replication_record"}},"created_at":"2026-08-11T02:24:21.444756+00:00","updated_at":"2026-08-11T02:24:21.444756+00:00"}