{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:H7NKEYDJPYA664AYL5LQTRPQFW","short_pith_number":"pith:H7NKEYDJ","schema_version":"1.0","canonical_sha256":"3fdaa260697e01ef70185f5709c5f02d9b8e153006570a26094efc00a5c1bffc","source":{"kind":"arxiv","id":"2112.01666","version":2},"attestation_state":"computed","paper":{"title":"Computing the quantum guesswork: a quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Francesco Buscemi, Michele Dall'Arno, Takeshi Koshiba","submitted_at":"2021-12-03T01:24:57Z","abstract_excerpt":"The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques and therefore lead to approximated results. In contrast, we show that computing the quantum guesswork of qubit ensembles with uniform probability distribution corresponds to solving a quadratic assignment problem and we provide an algorithm that, upon the input of any qubit ensemble over a discrete ring, after finitely"},"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":"2112.01666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T01:24:57Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c477c0e6824a82f989700cc5885ee8c0a4444d1dcccd8b26d7e0e7b109f97211","abstract_canon_sha256":"8e948c1c0eaeb8cb27cb66ded96ecc7d7f59d413fc01683d8f1953ff8acf5c90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:26.023801Z","signature_b64":"B4JxaK1xHVYf9K/F8GIBb4trKLeOKrXYofEn6fdfhxJ6SlGrrU+l4e9NOc/MjxBdrwphw5WTy0mbNqsFhanRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fdaa260697e01ef70185f5709c5f02d9b8e153006570a26094efc00a5c1bffc","last_reissued_at":"2026-07-05T06:44:26.023186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:26.023186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the quantum guesswork: a quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Francesco Buscemi, Michele Dall'Arno, Takeshi Koshiba","submitted_at":"2021-12-03T01:24:57Z","abstract_excerpt":"The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques and therefore lead to approximated results. In contrast, we show that computing the quantum guesswork of qubit ensembles with uniform probability distribution corresponds to solving a quadratic assignment problem and we provide an algorithm that, upon the input of any qubit ensemble over a discrete ring, after finitely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01666","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/2112.01666/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":"2112.01666","created_at":"2026-07-05T06:44:26.023253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.01666v2","created_at":"2026-07-05T06:44:26.023253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01666","created_at":"2026-07-05T06:44:26.023253+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7NKEYDJPYA6","created_at":"2026-07-05T06:44:26.023253+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7NKEYDJPYA664AY","created_at":"2026-07-05T06:44:26.023253+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7NKEYDJ","created_at":"2026-07-05T06:44:26.023253+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/H7NKEYDJPYA664AYL5LQTRPQFW","json":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW.json","graph_json":"https://pith.science/api/pith-number/H7NKEYDJPYA664AYL5LQTRPQFW/graph.json","events_json":"https://pith.science/api/pith-number/H7NKEYDJPYA664AYL5LQTRPQFW/events.json","paper":"https://pith.science/paper/H7NKEYDJ"},"agent_actions":{"view_html":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW","download_json":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW.json","view_paper":"https://pith.science/paper/H7NKEYDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.01666&json=true","fetch_graph":"https://pith.science/api/pith-number/H7NKEYDJPYA664AYL5LQTRPQFW/graph.json","fetch_events":"https://pith.science/api/pith-number/H7NKEYDJPYA664AYL5LQTRPQFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW/action/storage_attestation","attest_author":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW/action/author_attestation","sign_citation":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW/action/citation_signature","submit_replication":"https://pith.science/pith/H7NKEYDJPYA664AYL5LQTRPQFW/action/replication_record"}},"created_at":"2026-07-05T06:44:26.023253+00:00","updated_at":"2026-07-05T06:44:26.023253+00:00"}