{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RAK25QRMEKZJIONJISMJKCEPEH","short_pith_number":"pith:RAK25QRM","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"},"canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","source":{"kind":"arxiv","id":"1212.0025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0025","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0025v2","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0025","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"RAK25QRMEKZJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RAK25QRMEKZJIONJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RAK25QRM","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RAK25QRMEKZJIONJISMJKCEPEH","target":"record","payload":{"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"},"canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","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"},"source_kind":"arxiv","source_id":"1212.0025","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UstEv4PLW/k2o8n9IF4YzhAXe1VdZJBGrr2ITEJ4xFZE1EXOGwCK7n3mYrYcxe/Qev2Uhjb5gK1xaj3YRgowBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:08:04.857045Z"},"content_sha256":"974f9e65c100c4df4c95c7b764c166a84af3cce3b4c086c52ca796a43def8c2b","schema_version":"1.0","event_id":"sha256:974f9e65c100c4df4c95c7b764c166a84af3cce3b4c086c52ca796a43def8c2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RAK25QRMEKZJIONJISMJKCEPEH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8IwxSY4wm8iakJ9jr0aX6uHrTxpbClVepoN3Lm6CEofCOz9vbMODBvBz+mVP5mN3Y4pdynCYhrGKlLVvpRnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:08:04.857640Z"},"content_sha256":"bc55241a8242f40e4226c39e8f59957425b3a5e8caf734c31c4289c4e84ed992","schema_version":"1.0","event_id":"sha256:bc55241a8242f40e4226c39e8f59957425b3a5e8caf734c31c4289c4e84ed992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/bundle.json","state_url":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAK25QRMEKZJIONJISMJKCEPEH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T23:08:04Z","links":{"resolver":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH","bundle":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/bundle.json","state":"https://pith.science/pith/RAK25QRMEKZJIONJISMJKCEPEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAK25QRMEKZJIONJISMJKCEPEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RAK25QRMEKZJIONJISMJKCEPEH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"79568a7e63ab7cf9a08678dabe745e63a42abf717c41471b08eeb09695993174","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-30T22:10:11Z","title_canon_sha256":"358be3fe705d49ebfe7e3aded4a1df29b04c3d92d29db64252787148970c5b9f"},"schema_version":"1.0","source":{"id":"1212.0025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0025","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0025v2","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0025","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"RAK25QRMEKZJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RAK25QRMEKZJIONJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RAK25QRM","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:bc55241a8242f40e4226c39e8f59957425b3a5e8caf734c31c4289c4e84ed992","target":"graph","created_at":"2026-05-18T03:39:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Scott Aaronson, Travis Hance","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-30T22:10:11Z","title":"Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0025","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:974f9e65c100c4df4c95c7b764c166a84af3cce3b4c086c52ca796a43def8c2b","target":"record","created_at":"2026-05-18T03:39:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"79568a7e63ab7cf9a08678dabe745e63a42abf717c41471b08eeb09695993174","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-30T22:10:11Z","title_canon_sha256":"358be3fe705d49ebfe7e3aded4a1df29b04c3d92d29db64252787148970c5b9f"},"schema_version":"1.0","source":{"id":"1212.0025","kind":"arxiv","version":2}},"canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8815aec22c22b29439a9449895088f21e113c330a10060a7926523f4df55fd43","first_computed_at":"2026-05-18T03:39:14.289277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:14.289277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wDxyzhW+NKqE61TfQ9BEroz5wdlo332OCL5xbV2rasfPOH1Wph9fdo3ajJOpEX56cPTtcMQIqJ3Vk4TP3050Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:14.289921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:974f9e65c100c4df4c95c7b764c166a84af3cce3b4c086c52ca796a43def8c2b","sha256:bc55241a8242f40e4226c39e8f59957425b3a5e8caf734c31c4289c4e84ed992"],"state_sha256":"12f8aae0cd52a3b191d3eccf872789b41d3c48416482480f0f522fb586efb80a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nB+AZp/tLFB6TRT3xAeL9yWKEdqTM3gSRJU5HlfJppoqh60W68mJszlOaZBJdKQ3qD6vQ9H2wLGj5pkCs5BPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:08:04.860862Z","bundle_sha256":"2705b9bf974a4e01fd47f5680759c5664046e44fa841ae8a39c2690bda70ef12"}}