{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UJ7B2I3XFDR5BWS3I6MMX73LJY","short_pith_number":"pith:UJ7B2I3X","schema_version":"1.0","canonical_sha256":"a27e1d237728e3d0da5b4798cbff6b4e3fa4925d5f7de383822f2721e7c57b71","source":{"kind":"arxiv","id":"1706.01260","version":2},"attestation_state":"computed","paper":{"title":"The Classical Complexity of Boson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph","stat.CO"],"primary_cat":"cs.DS","authors_text":"Peter Clifford, Rapha\\\"el Clifford","submitted_at":"2017-06-05T10:31:00Z","abstract_excerpt":"We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distribution. The computational framework was proposed by Aaronson and Arkhipov in 2011 as an attainable demonstration of `quantum supremacy', that is a practical quantum computing experiment able to produce output at a speed beyond the reach of classical (that is non-quantum) computer hardware. Since its introduction Boson Sampling has been the subject of intense international research in the world of quantum computing. On"},"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":"1706.01260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T10:31:00Z","cross_cats_sorted":["quant-ph","stat.CO"],"title_canon_sha256":"0f34468129aaf95a448f43b3b62ba7abe88715495bc0e44fd5f4a13915534d89","abstract_canon_sha256":"7fb7ade895578f31b891383489cb5ffc24955897a28493c72752b4f0b7b5f28e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:36.127563Z","signature_b64":"vG9293gStSomTQSQyXzBWBm5yfmnKQFK1V0EvwzIW8Z3NhkbfxheMJqo0MRRWgaKtPApgfca0b7+VCQOBhd3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27e1d237728e3d0da5b4798cbff6b4e3fa4925d5f7de383822f2721e7c57b71","last_reissued_at":"2026-05-18T00:32:36.126879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:36.126879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Classical Complexity of Boson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph","stat.CO"],"primary_cat":"cs.DS","authors_text":"Peter Clifford, Rapha\\\"el Clifford","submitted_at":"2017-06-05T10:31:00Z","abstract_excerpt":"We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distribution. The computational framework was proposed by Aaronson and Arkhipov in 2011 as an attainable demonstration of `quantum supremacy', that is a practical quantum computing experiment able to produce output at a speed beyond the reach of classical (that is non-quantum) computer hardware. Since its introduction Boson Sampling has been the subject of intense international research in the world of quantum computing. On"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01260","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":""},"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":"1706.01260","created_at":"2026-05-18T00:32:36.126988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01260v2","created_at":"2026-05-18T00:32:36.126988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01260","created_at":"2026-05-18T00:32:36.126988+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ7B2I3XFDR5","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ7B2I3XFDR5BWS3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ7B2I3X","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01788","citing_title":"Cryptographic One-way Function Based on Boson Sampling","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY","json":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY.json","graph_json":"https://pith.science/api/pith-number/UJ7B2I3XFDR5BWS3I6MMX73LJY/graph.json","events_json":"https://pith.science/api/pith-number/UJ7B2I3XFDR5BWS3I6MMX73LJY/events.json","paper":"https://pith.science/paper/UJ7B2I3X"},"agent_actions":{"view_html":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY","download_json":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY.json","view_paper":"https://pith.science/paper/UJ7B2I3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01260&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ7B2I3XFDR5BWS3I6MMX73LJY/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ7B2I3XFDR5BWS3I6MMX73LJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY/action/storage_attestation","attest_author":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY/action/author_attestation","sign_citation":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY/action/citation_signature","submit_replication":"https://pith.science/pith/UJ7B2I3XFDR5BWS3I6MMX73LJY/action/replication_record"}},"created_at":"2026-05-18T00:32:36.126988+00:00","updated_at":"2026-05-18T00:32:36.126988+00:00"}