{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7L7KNTVRLWYUVHZW4OCMIVNGZS","short_pith_number":"pith:7L7KNTVR","schema_version":"1.0","canonical_sha256":"fafea6ceb15db14a9f36e384c455a6cc9b6260c21c627988ac503964d288868a","source":{"kind":"arxiv","id":"2608.01438","version":1},"attestation_state":"computed","paper":{"title":"Automated Construction and Verification of Unextendible Product Bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fei Shi, Wanchen Zhang, Xiande Zhang, Zicheng Han","submitted_at":"2026-08-02T18:47:51Z","abstract_excerpt":"Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indistinguishability. Since many properties and applications of UPBs are closely related to their cardinalities, one of the central problems in the study of UPBs is to determine whether UPBs of prescribed sizes exist in a given multipartite system. In this paper, we introduce a SAT-assisted framework based on decompositions of the \\(N\\)-dimensional hypercube. We define \\(O_N\\)-tile decompositions and prove a tile-to-UPB the"},"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.01438","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-02T18:47:51Z","cross_cats_sorted":[],"title_canon_sha256":"7b293fb9c138989df7e7f9622761cccf8398643ac4202c84e4c324ee5d6ee472","abstract_canon_sha256":"ef84274c76da1c4ccb66b5cc6a45667f86c59b8e4c822d415690c9d83b831517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:05:13.432259Z","signature_b64":"cG1rJSAFcxzNWcNI32rXB0t6p+Jbb0o6MOBT/1yL9Ah8vOOuxHeWSTcGjZ/7xgHyXnDgSHXw8XCyYa+7pF5VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fafea6ceb15db14a9f36e384c455a6cc9b6260c21c627988ac503964d288868a","last_reissued_at":"2026-08-04T02:05:13.430587Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:05:13.430587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Construction and Verification of Unextendible Product Bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fei Shi, Wanchen Zhang, Xiande Zhang, Zicheng Han","submitted_at":"2026-08-02T18:47:51Z","abstract_excerpt":"Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indistinguishability. Since many properties and applications of UPBs are closely related to their cardinalities, one of the central problems in the study of UPBs is to determine whether UPBs of prescribed sizes exist in a given multipartite system. In this paper, we introduce a SAT-assisted framework based on decompositions of the \\(N\\)-dimensional hypercube. We define \\(O_N\\)-tile decompositions and prove a tile-to-UPB the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01438","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.01438/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.01438","created_at":"2026-08-04T02:05:13.432174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01438v1","created_at":"2026-08-04T02:05:13.432174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01438","created_at":"2026-08-04T02:05:13.432174+00:00"},{"alias_kind":"pith_short_12","alias_value":"7L7KNTVRLWYU","created_at":"2026-08-04T02:05:13.432174+00:00"},{"alias_kind":"pith_short_16","alias_value":"7L7KNTVRLWYUVHZW","created_at":"2026-08-04T02:05:13.432174+00:00"},{"alias_kind":"pith_short_8","alias_value":"7L7KNTVR","created_at":"2026-08-04T02:05:13.432174+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/7L7KNTVRLWYUVHZW4OCMIVNGZS","json":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS.json","graph_json":"https://pith.science/api/pith-number/7L7KNTVRLWYUVHZW4OCMIVNGZS/graph.json","events_json":"https://pith.science/api/pith-number/7L7KNTVRLWYUVHZW4OCMIVNGZS/events.json","paper":"https://pith.science/paper/7L7KNTVR"},"agent_actions":{"view_html":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS","download_json":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS.json","view_paper":"https://pith.science/paper/7L7KNTVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01438&json=true","fetch_graph":"https://pith.science/api/pith-number/7L7KNTVRLWYUVHZW4OCMIVNGZS/graph.json","fetch_events":"https://pith.science/api/pith-number/7L7KNTVRLWYUVHZW4OCMIVNGZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS/action/storage_attestation","attest_author":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS/action/author_attestation","sign_citation":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS/action/citation_signature","submit_replication":"https://pith.science/pith/7L7KNTVRLWYUVHZW4OCMIVNGZS/action/replication_record"}},"created_at":"2026-08-04T02:05:13.432174+00:00","updated_at":"2026-08-04T02:05:13.432174+00:00"}