{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RAK25QRMEKZJIONJISMJKCEPEH","short_pith_number":"pith:RAK25QRM","schema_version":"1.0","canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","source":{"kind":"arxiv","id":"1212.0025","version":2},"attestation_state":"computed","paper":{"title":"Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Travis Hance","submitted_at":"2012-11-30T22:10:11Z","abstract_excerpt":"Around 2002, Leonid Gurvits gave a striking randomized algorithm to approximate the permanent of an n*n matrix A. The algorithm runs in O(n^2/eps^2) time, and approximates Per(A) to within eps*||A||^n additive error. A major advantage of Gurvits's algorithm is that it works for arbitrary matrices, not just for nonnegative matrices. This makes it highly relevant to quantum optics, where the permanents of bounded-norm complex matrices play a central role. Indeed, the existence of Gurvits's algorithm is why, in their recent work on the hardness of quantum optics, Aaronson and Arkhipov (AA) had to"},"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":"1212.0025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-30T22:10:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"358be3fe705d49ebfe7e3aded4a1df29b04c3d92d29db64252787148970c5b9f","abstract_canon_sha256":"79568a7e63ab7cf9a08678dabe745e63a42abf717c41471b08eeb09695993174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:14.289921Z","signature_b64":"wDxyzhW+NKqE61TfQ9BEroz5wdlo332OCL5xbV2rasfPOH1Wph9fdo3ajJOpEX56cPTtcMQIqJ3Vk4TP3050Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","last_reissued_at":"2026-05-18T03:39:14.289277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:14.289277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Travis Hance","submitted_at":"2012-11-30T22:10:11Z","abstract_excerpt":"Around 2002, Leonid Gurvits gave a striking randomized algorithm to approximate the permanent of an n*n matrix A. The algorithm runs in O(n^2/eps^2) time, and approximates Per(A) to within eps*||A||^n additive error. A major advantage of Gurvits's algorithm is that it works for arbitrary matrices, not just for nonnegative matrices. This makes it highly relevant to quantum optics, where the permanents of bounded-norm complex matrices play a central role. Indeed, the existence of Gurvits's algorithm is why, in their recent work on the hardness of quantum optics, Aaronson and Arkhipov (AA) had to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0025","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":"1212.0025","created_at":"2026-05-18T03:39:14.289374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0025v2","created_at":"2026-05-18T03:39:14.289374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0025","created_at":"2026-05-18T03:39:14.289374+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAK25QRMEKZJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAK25QRMEKZJIONJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAK25QRM","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2404.18636","citing_title":"Semi-device independent characterization of multiphoton indistinguishability","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2502.01737","citing_title":"Heisenberg picture tensor network formalism for optical circuits","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2512.10643","citing_title":"Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26813","citing_title":"Classical simulation of free-fermionic dynamics and quantum chemistry with magic input","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26813","citing_title":"Classical simulation of free-fermionic dynamics and quantum chemistry with magic input","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH","json":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH.json","graph_json":"https://pith.science/api/pith-number/RAK25QRMEKZJIONJISMJKCEPEH/graph.json","events_json":"https://pith.science/api/pith-number/RAK25QRMEKZJIONJISMJKCEPEH/events.json","paper":"https://pith.science/paper/RAK25QRM"},"agent_actions":{"view_html":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH","download_json":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH.json","view_paper":"https://pith.science/paper/RAK25QRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0025&json=true","fetch_graph":"https://pith.science/api/pith-number/RAK25QRMEKZJIONJISMJKCEPEH/graph.json","fetch_events":"https://pith.science/api/pith-number/RAK25QRMEKZJIONJISMJKCEPEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/action/storage_attestation","attest_author":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/action/author_attestation","sign_citation":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/action/citation_signature","submit_replication":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/action/replication_record"}},"created_at":"2026-05-18T03:39:14.289374+00:00","updated_at":"2026-05-18T03:39:14.289374+00:00"}