{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3MWBZKFBH4PRSHY7YGQL5SMNG4","short_pith_number":"pith:3MWBZKFB","schema_version":"1.0","canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","source":{"kind":"arxiv","id":"1711.09457","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Permanent of a Random Matrix with Vanishing Mean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Lior Eldar, Saeed Mehraban","submitted_at":"2017-11-26T20:55:35Z","abstract_excerpt":"We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can compute the permanent of a random matrix with mean 1/poly(ln(n)) in time 2^{O(n^{\\eps})} for any small constant \\eps>0. Our algorithm counters the intuition that the permanent is hard because of the \"sign problem\" - namely the interference between entries of a matrix with different signs. A major open question then remains whether one can provide an efficient al"},"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":"1711.09457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-26T20:55:35Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e082d8a6e042e7076782d3a88777ee2259b6988caa97775e4ff116abee5fbc52","abstract_canon_sha256":"ba868e48efa2280a6cb12798a9a36b924e3a608d652bf9510cd357dca1d1f4f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.621003Z","signature_b64":"f9Ke14iSXOPLj5jqfG86wtkD+vldqJYfOKOa8srhG3gut/Kp0mo7HJRaQmAOwQp33jSD/IU9vGdu2YRsb0aXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","last_reissued_at":"2026-05-18T00:03:41.620589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.620589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Permanent of a Random Matrix with Vanishing Mean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Lior Eldar, Saeed Mehraban","submitted_at":"2017-11-26T20:55:35Z","abstract_excerpt":"We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can compute the permanent of a random matrix with mean 1/poly(ln(n)) in time 2^{O(n^{\\eps})} for any small constant \\eps>0. Our algorithm counters the intuition that the permanent is hard because of the \"sign problem\" - namely the interference between entries of a matrix with different signs. A major open question then remains whether one can provide an efficient al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09457","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":"1711.09457","created_at":"2026-05-18T00:03:41.620656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09457v2","created_at":"2026-05-18T00:03:41.620656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09457","created_at":"2026-05-18T00:03:41.620656+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MWBZKFBH4PR","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MWBZKFBH4PRSHY7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MWBZKFB","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4","json":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4.json","graph_json":"https://pith.science/api/pith-number/3MWBZKFBH4PRSHY7YGQL5SMNG4/graph.json","events_json":"https://pith.science/api/pith-number/3MWBZKFBH4PRSHY7YGQL5SMNG4/events.json","paper":"https://pith.science/paper/3MWBZKFB"},"agent_actions":{"view_html":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4","download_json":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4.json","view_paper":"https://pith.science/paper/3MWBZKFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09457&json=true","fetch_graph":"https://pith.science/api/pith-number/3MWBZKFBH4PRSHY7YGQL5SMNG4/graph.json","fetch_events":"https://pith.science/api/pith-number/3MWBZKFBH4PRSHY7YGQL5SMNG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/action/storage_attestation","attest_author":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/action/author_attestation","sign_citation":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/action/citation_signature","submit_replication":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/action/replication_record"}},"created_at":"2026-05-18T00:03:41.620656+00:00","updated_at":"2026-05-18T00:03:41.620656+00:00"}