{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LAUZBQXHUKZLEO7PJZT2KT2A4M","short_pith_number":"pith:LAUZBQXH","schema_version":"1.0","canonical_sha256":"582990c2e7a2b2b23bef4e67a54f40e3231b4122ee25bb9609c1fd1ffa73b1e3","source":{"kind":"arxiv","id":"2311.17047","version":2},"attestation_state":"computed","paper":{"title":"Tight bounds for antidistinguishability and circulant sets of pure quantum states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jamie Sikora, Nathaniel Johnston, Vincent Russo","submitted_at":"2023-11-28T18:55:34Z","abstract_excerpt":"A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We show that antidistinguishability of a set of $n$ pure states is equivalent to a property of its Gram matrix called $(n-1)$-incoherence, thus establishing a connection with quantum resource theories that lets us apply a wide variety of new tools to antidistinguishability. As a particular application of our result, we present an explicit formula (not involving any semidefinite programming) that determines whether or n"},"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":"2311.17047","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-28T18:55:34Z","cross_cats_sorted":[],"title_canon_sha256":"8ca116deb46721ace8524836e480707fb968d64ae7912c685643e878a384b40a","abstract_canon_sha256":"276bd14353f7bffa0f5e0e78d3bc0a44d5dbcbbb117d2a2b6f748bf917508c23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:01.334259Z","signature_b64":"WVEZWL7KTIMQwHcbbFcod6FhBdD6ruwfxIKZc0dYxUWSwRdWD4xup4DsE3iQ07yBvwmoM+qJJcxsBvu33kwcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"582990c2e7a2b2b23bef4e67a54f40e3231b4122ee25bb9609c1fd1ffa73b1e3","last_reissued_at":"2026-07-05T10:09:01.333673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:01.333673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bounds for antidistinguishability and circulant sets of pure quantum states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jamie Sikora, Nathaniel Johnston, Vincent Russo","submitted_at":"2023-11-28T18:55:34Z","abstract_excerpt":"A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We show that antidistinguishability of a set of $n$ pure states is equivalent to a property of its Gram matrix called $(n-1)$-incoherence, thus establishing a connection with quantum resource theories that lets us apply a wide variety of new tools to antidistinguishability. As a particular application of our result, we present an explicit formula (not involving any semidefinite programming) that determines whether or n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.17047","kind":"arxiv","version":2},"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/2311.17047/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":"2311.17047","created_at":"2026-07-05T10:09:01.333745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.17047v2","created_at":"2026-07-05T10:09:01.333745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.17047","created_at":"2026-07-05T10:09:01.333745+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAUZBQXHUKZL","created_at":"2026-07-05T10:09:01.333745+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAUZBQXHUKZLEO7P","created_at":"2026-07-05T10:09:01.333745+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAUZBQXH","created_at":"2026-07-05T10:09:01.333745+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.04023","citing_title":"A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26605","citing_title":"All pure entangled states can lead to fully nonlocal correlations","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M","json":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M.json","graph_json":"https://pith.science/api/pith-number/LAUZBQXHUKZLEO7PJZT2KT2A4M/graph.json","events_json":"https://pith.science/api/pith-number/LAUZBQXHUKZLEO7PJZT2KT2A4M/events.json","paper":"https://pith.science/paper/LAUZBQXH"},"agent_actions":{"view_html":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M","download_json":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M.json","view_paper":"https://pith.science/paper/LAUZBQXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.17047&json=true","fetch_graph":"https://pith.science/api/pith-number/LAUZBQXHUKZLEO7PJZT2KT2A4M/graph.json","fetch_events":"https://pith.science/api/pith-number/LAUZBQXHUKZLEO7PJZT2KT2A4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M/action/storage_attestation","attest_author":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M/action/author_attestation","sign_citation":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M/action/citation_signature","submit_replication":"https://pith.science/pith/LAUZBQXHUKZLEO7PJZT2KT2A4M/action/replication_record"}},"created_at":"2026-07-05T10:09:01.333745+00:00","updated_at":"2026-07-05T10:09:01.333745+00:00"}