{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XCJG3JWHSKA4WAYZSHWO2PZZ4E","short_pith_number":"pith:XCJG3JWH","schema_version":"1.0","canonical_sha256":"b8926da6c79281cb031991eced3f39e101ba62b04b3a9dcfc7d845495a305991","source":{"kind":"arxiv","id":"1107.0321","version":1},"attestation_state":"computed","paper":{"title":"Component mixers and a hardness result for counterfeiting quantum money","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Lutomirski","submitted_at":"2011-07-01T20:00:30Z","abstract_excerpt":"In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, we introduce the concept of a component mixer, define three new classical query problems and associated complexity classes related to graph isomorphism and group membership, and conjecture an oracle separating QCMA from QMA."},"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":"1107.0321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-07-01T20:00:30Z","cross_cats_sorted":[],"title_canon_sha256":"416b9b2177ae64f1b04646a7e4abb015779535188bfae66763e3443b37d13e7f","abstract_canon_sha256":"b16f90bfa585bead8f1d3f0f4a4db2a65d033134faffdf47c945a8c2fb3e94ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:54.187945Z","signature_b64":"qAzthXQJCxxjJitD2PuAcC4Jy+dAq1YY+ah2PGFErzxFUmnm+iY5lOAVswu3ddqRtzK0NWdOYWOQGOSPR9iXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8926da6c79281cb031991eced3f39e101ba62b04b3a9dcfc7d845495a305991","last_reissued_at":"2026-05-18T04:18:54.187494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:54.187494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Component mixers and a hardness result for counterfeiting quantum money","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Lutomirski","submitted_at":"2011-07-01T20:00:30Z","abstract_excerpt":"In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, we introduce the concept of a component mixer, define three new classical query problems and associated complexity classes related to graph isomorphism and group membership, and conjecture an oracle separating QCMA from QMA."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0321","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":""},"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":"1107.0321","created_at":"2026-05-18T04:18:54.187568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0321v1","created_at":"2026-05-18T04:18:54.187568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0321","created_at":"2026-05-18T04:18:54.187568+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCJG3JWHSKA4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCJG3JWHSKA4WAYZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCJG3JWH","created_at":"2026-05-18T12:26:44.992195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26921","citing_title":"En Route to a Standard QMA1 vs. QCMA Oracle Separation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E","json":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E.json","graph_json":"https://pith.science/api/pith-number/XCJG3JWHSKA4WAYZSHWO2PZZ4E/graph.json","events_json":"https://pith.science/api/pith-number/XCJG3JWHSKA4WAYZSHWO2PZZ4E/events.json","paper":"https://pith.science/paper/XCJG3JWH"},"agent_actions":{"view_html":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E","download_json":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E.json","view_paper":"https://pith.science/paper/XCJG3JWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0321&json=true","fetch_graph":"https://pith.science/api/pith-number/XCJG3JWHSKA4WAYZSHWO2PZZ4E/graph.json","fetch_events":"https://pith.science/api/pith-number/XCJG3JWHSKA4WAYZSHWO2PZZ4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E/action/storage_attestation","attest_author":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E/action/author_attestation","sign_citation":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E/action/citation_signature","submit_replication":"https://pith.science/pith/XCJG3JWHSKA4WAYZSHWO2PZZ4E/action/replication_record"}},"created_at":"2026-05-18T04:18:54.187568+00:00","updated_at":"2026-05-18T04:18:54.187568+00:00"}