{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5P3BMFVC5TPAQCNVEBNMUTCLGI","short_pith_number":"pith:5P3BMFVC","schema_version":"1.0","canonical_sha256":"ebf61616a2ecde0809b5205aca4c4b3204e99fe9bbd6777021446c722c3c8428","source":{"kind":"arxiv","id":"2301.11532","version":1},"attestation_state":"computed","paper":{"title":"On classical simulation algorithms for noisy Boson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Changhun Oh, Liang Jiang","submitted_at":"2023-01-27T04:42:59Z","abstract_excerpt":"We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This algorithm is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of an observation originally due to Kalai and Kindler that the output probability of Boson Sampling experiments with a Gaussian noise model can be approximated by sparse low-degree polynomials. This observation alone does not suffice for classical sampling, because its marginal probabilities might not be approximated by sparse low-degree polynomials, and furthe"},"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":"2301.11532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-27T04:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"cfe6864ed61b97bb33a02d700113dadcd8c597139b5609df992c95b46c8b1a85","abstract_canon_sha256":"7eb70b9a44dca3e98a59f4beebaa0d40f34cb19b2f1b6a2c7de7783ec32b639a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:23.242103Z","signature_b64":"1AQ1gElvQS/3Ode7QVXMNfEHMEJBBO8P233Z7bX6kDWrQ1zsaRF7j7vSOSwgfV1yHrZBJVKO8xyU/fobGKeOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf61616a2ecde0809b5205aca4c4b3204e99fe9bbd6777021446c722c3c8428","last_reissued_at":"2026-07-05T05:36:23.241606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:23.241606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On classical simulation algorithms for noisy Boson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Changhun Oh, Liang Jiang","submitted_at":"2023-01-27T04:42:59Z","abstract_excerpt":"We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This algorithm is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of an observation originally due to Kalai and Kindler that the output probability of Boson Sampling experiments with a Gaussian noise model can be approximated by sparse low-degree polynomials. This observation alone does not suffice for classical sampling, because its marginal probabilities might not be approximated by sparse low-degree polynomials, and furthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.11532","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/2301.11532/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":"2301.11532","created_at":"2026-07-05T05:36:23.241667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.11532v1","created_at":"2026-07-05T05:36:23.241667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.11532","created_at":"2026-07-05T05:36:23.241667+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P3BMFVC5TPA","created_at":"2026-07-05T05:36:23.241667+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P3BMFVC5TPAQCNV","created_at":"2026-07-05T05:36:23.241667+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P3BMFVC","created_at":"2026-07-05T05:36:23.241667+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.01737","citing_title":"Heisenberg picture tensor network formalism for optical circuits","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2512.10643","citing_title":"Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI","json":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI.json","graph_json":"https://pith.science/api/pith-number/5P3BMFVC5TPAQCNVEBNMUTCLGI/graph.json","events_json":"https://pith.science/api/pith-number/5P3BMFVC5TPAQCNVEBNMUTCLGI/events.json","paper":"https://pith.science/paper/5P3BMFVC"},"agent_actions":{"view_html":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI","download_json":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI.json","view_paper":"https://pith.science/paper/5P3BMFVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.11532&json=true","fetch_graph":"https://pith.science/api/pith-number/5P3BMFVC5TPAQCNVEBNMUTCLGI/graph.json","fetch_events":"https://pith.science/api/pith-number/5P3BMFVC5TPAQCNVEBNMUTCLGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI/action/storage_attestation","attest_author":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI/action/author_attestation","sign_citation":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI/action/citation_signature","submit_replication":"https://pith.science/pith/5P3BMFVC5TPAQCNVEBNMUTCLGI/action/replication_record"}},"created_at":"2026-07-05T05:36:23.241667+00:00","updated_at":"2026-07-05T05:36:23.241667+00:00"}