{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RBJIK4E3UXHCAEY7OHPPZJ3J53","short_pith_number":"pith:RBJIK4E3","canonical_record":{"source":{"id":"1409.3905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-13T03:13:06Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fcd442781ec7b83bfa323fa5ac95b0200cea4442a87a0862f9baa13a695172e0","abstract_canon_sha256":"2f2225b4a7f0077d9fb79deb16e65b9039e57fc897e08ccf3e9d557d12c320a2"},"schema_version":"1.0"},"canonical_sha256":"885285709ba5ce20131f71defca769eecbfe5358a12e32b7d5f2271a3fc66cb7","source":{"kind":"arxiv","id":"1409.3905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3905","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3905v2","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3905","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"RBJIK4E3UXHC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RBJIK4E3UXHCAEY7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RBJIK4E3","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RBJIK4E3UXHCAEY7OHPPZJ3J53","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-13T03:13:06Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fcd442781ec7b83bfa323fa5ac95b0200cea4442a87a0862f9baa13a695172e0","abstract_canon_sha256":"2f2225b4a7f0077d9fb79deb16e65b9039e57fc897e08ccf3e9d557d12c320a2"},"schema_version":"1.0"},"canonical_sha256":"885285709ba5ce20131f71defca769eecbfe5358a12e32b7d5f2271a3fc66cb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:24.779132Z","signature_b64":"TOSO/5AyUwAAu/LiOcFRnTWYgGt4YvcdMNPoQuZp4HqlksQUH97D8iHqcufkMWCMKh8aC06PJyHWa3BLdKLWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"885285709ba5ce20131f71defca769eecbfe5358a12e32b7d5f2271a3fc66cb7","last_reissued_at":"2026-05-18T01:06:24.778760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:24.778760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3905","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-18T01:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v82tQJ/E+GU1XXXIo0B1quFPUNW4nxzESqJ257FF5TpEvUzQAD/a+PsVrCLLhveh2cBhQNLpWy1PAHwHRWiUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:38:35.296364Z"},"content_sha256":"346486dc720f976da1a44e2af3d237cff88474aa290916e390da618d67d6621e","schema_version":"1.0","event_id":"sha256:346486dc720f976da1a44e2af3d237cff88474aa290916e390da618d67d6621e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RBJIK4E3UXHCAEY7OHPPZJ3J53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hafnians, perfect matchings and Gaussian matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Alex Samorodnitsky, Mark Rudelson, Ofer Zeitouni","submitted_at":"2014-09-13T03:13:06Z","abstract_excerpt":"We analyze the behavior of the Barvinok estimator of the hafnian of even dimension, symmetric matrices with nonnegative entries. We introduce a condition under which the Barvinok estimator achieves subexponential errors, and show that this condition is almost optimal. Using that hafnians count the number of perfect matchings in graphs, we conclude that Barvinok's estimator gives a polynomial-time algorithm for the approximate (up to subexponential errors) evaluation of the number of perfect matchings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3905","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-18T01:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytMKjMP7snwIQYbyJ6x6XFB+eSm3MAOXv85sjJEvomDSrOxu75qFWmbQeTop5NX0tKoamnebH6smaAeqnhoNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:38:35.296718Z"},"content_sha256":"9f5669683ee2ec5348d749845ad6114327eea0fca34b47035679c4833022b28a","schema_version":"1.0","event_id":"sha256:9f5669683ee2ec5348d749845ad6114327eea0fca34b47035679c4833022b28a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/bundle.json","state_url":"https://pith.science/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/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-06-02T04:38:35Z","links":{"resolver":"https://pith.science/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53","bundle":"https://pith.science/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/bundle.json","state":"https://pith.science/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBJIK4E3UXHCAEY7OHPPZJ3J53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RBJIK4E3UXHCAEY7OHPPZJ3J53","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":"2f2225b4a7f0077d9fb79deb16e65b9039e57fc897e08ccf3e9d557d12c320a2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-13T03:13:06Z","title_canon_sha256":"fcd442781ec7b83bfa323fa5ac95b0200cea4442a87a0862f9baa13a695172e0"},"schema_version":"1.0","source":{"id":"1409.3905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3905","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3905v2","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3905","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"RBJIK4E3UXHC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RBJIK4E3UXHCAEY7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RBJIK4E3","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:9f5669683ee2ec5348d749845ad6114327eea0fca34b47035679c4833022b28a","target":"graph","created_at":"2026-05-18T01:06:24Z","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 analyze the behavior of the Barvinok estimator of the hafnian of even dimension, symmetric matrices with nonnegative entries. We introduce a condition under which the Barvinok estimator achieves subexponential errors, and show that this condition is almost optimal. Using that hafnians count the number of perfect matchings in graphs, we conclude that Barvinok's estimator gives a polynomial-time algorithm for the approximate (up to subexponential errors) evaluation of the number of perfect matchings.","authors_text":"Alex Samorodnitsky, Mark Rudelson, Ofer Zeitouni","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-13T03:13:06Z","title":"Hafnians, perfect matchings and Gaussian matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3905","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:346486dc720f976da1a44e2af3d237cff88474aa290916e390da618d67d6621e","target":"record","created_at":"2026-05-18T01:06:24Z","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":"2f2225b4a7f0077d9fb79deb16e65b9039e57fc897e08ccf3e9d557d12c320a2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-13T03:13:06Z","title_canon_sha256":"fcd442781ec7b83bfa323fa5ac95b0200cea4442a87a0862f9baa13a695172e0"},"schema_version":"1.0","source":{"id":"1409.3905","kind":"arxiv","version":2}},"canonical_sha256":"885285709ba5ce20131f71defca769eecbfe5358a12e32b7d5f2271a3fc66cb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"885285709ba5ce20131f71defca769eecbfe5358a12e32b7d5f2271a3fc66cb7","first_computed_at":"2026-05-18T01:06:24.778760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:24.778760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOSO/5AyUwAAu/LiOcFRnTWYgGt4YvcdMNPoQuZp4HqlksQUH97D8iHqcufkMWCMKh8aC06PJyHWa3BLdKLWDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:24.779132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:346486dc720f976da1a44e2af3d237cff88474aa290916e390da618d67d6621e","sha256:9f5669683ee2ec5348d749845ad6114327eea0fca34b47035679c4833022b28a"],"state_sha256":"e3fa2744c543fe6c5865c6b31d3d12f42e36c51b0d617bb5640030c626bd76b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrfAwh3Odql2V+TNlC+tXj8bHnheSt/LWlF6stTXz4Ql1Lg4TiRtmVLXzJ9sn8eXq7zELIWRfdzWwlIZHpqPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:38:35.298632Z","bundle_sha256":"fdcd0c2f21e91b387cc90a366c0d4be0328f1b59d47fa11ab5a717d731b07014"}}