{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3MWBZKFBH4PRSHY7YGQL5SMNG4","short_pith_number":"pith:3MWBZKFB","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"},"canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","source":{"kind":"arxiv","id":"1711.09457","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09457","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09457v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09457","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"3MWBZKFBH4PR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3MWBZKFBH4PRSHY7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3MWBZKFB","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3MWBZKFBH4PRSHY7YGQL5SMNG4","target":"record","payload":{"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"},"canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","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"},"source_kind":"arxiv","source_id":"1711.09457","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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0MGGcEy9Tvnu0STGiLQGqxaYlBX2Q4Bp8qF5x3garWYja8UpkExR5aCbIDgDM0YDTrETkDgXNB7m4uMQdWYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:23.110193Z"},"content_sha256":"6267d8d61a2feda72a7bbc7fdadfd0b3225d491c2cf1a6948d3d038950984e9b","schema_version":"1.0","event_id":"sha256:6267d8d61a2feda72a7bbc7fdadfd0b3225d491c2cf1a6948d3d038950984e9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3MWBZKFBH4PRSHY7YGQL5SMNG4","target":"graph","payload":{"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"},"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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sk9E6+JRQ3L86BwgTyk60vKyQv0wI2w04a1hUUKfab+vwEN2CWBuy1BNPgyQi8IS5J8EWVsJukjzOTkcjog1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:23.110873Z"},"content_sha256":"bf25a0648a02cecf021c211d806d4143dae237091d95881895f2d7e07a7ffaa8","schema_version":"1.0","event_id":"sha256:bf25a0648a02cecf021c211d806d4143dae237091d95881895f2d7e07a7ffaa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/bundle.json","state_url":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/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-27T11:52:23Z","links":{"resolver":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4","bundle":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/bundle.json","state":"https://pith.science/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MWBZKFBH4PRSHY7YGQL5SMNG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3MWBZKFBH4PRSHY7YGQL5SMNG4","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":"ba868e48efa2280a6cb12798a9a36b924e3a608d652bf9510cd357dca1d1f4f5","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-26T20:55:35Z","title_canon_sha256":"e082d8a6e042e7076782d3a88777ee2259b6988caa97775e4ff116abee5fbc52"},"schema_version":"1.0","source":{"id":"1711.09457","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09457","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09457v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09457","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"3MWBZKFBH4PR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3MWBZKFBH4PRSHY7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3MWBZKFB","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:bf25a0648a02cecf021c211d806d4143dae237091d95881895f2d7e07a7ffaa8","target":"graph","created_at":"2026-05-18T00:03:41Z","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":"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","authors_text":"Lior Eldar, Saeed Mehraban","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-26T20:55:35Z","title":"Approximating the Permanent of a Random Matrix with Vanishing Mean"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09457","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:6267d8d61a2feda72a7bbc7fdadfd0b3225d491c2cf1a6948d3d038950984e9b","target":"record","created_at":"2026-05-18T00:03:41Z","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":"ba868e48efa2280a6cb12798a9a36b924e3a608d652bf9510cd357dca1d1f4f5","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-26T20:55:35Z","title_canon_sha256":"e082d8a6e042e7076782d3a88777ee2259b6988caa97775e4ff116abee5fbc52"},"schema_version":"1.0","source":{"id":"1711.09457","kind":"arxiv","version":2}},"canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db2c1ca8a13f1f191f1fc1a0bec98d372118d9e4b3c9b9e3786a85285b87ccd0","first_computed_at":"2026-05-18T00:03:41.620589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:41.620589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f9Ke14iSXOPLj5jqfG86wtkD+vldqJYfOKOa8srhG3gut/Kp0mo7HJRaQmAOwQp33jSD/IU9vGdu2YRsb0aXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:41.621003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09457","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6267d8d61a2feda72a7bbc7fdadfd0b3225d491c2cf1a6948d3d038950984e9b","sha256:bf25a0648a02cecf021c211d806d4143dae237091d95881895f2d7e07a7ffaa8"],"state_sha256":"4105180dc76ed35291a3e55e6528684cf3369e9c9d5340fc7279ea8572dea35f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8niuMiCipchVmPbxTSVWS1QmJPI+FJHBjhgpLmtOYXJgBqUwx05bLtnmIAcXQeBv1EV3hNVyP3k2QlXbBHqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:52:23.113587Z","bundle_sha256":"787fc1053c18c764875dcd808eec5e8124cafafcdbc72aec0494c56a899dc5e1"}}