{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SPOGSSHDTEJTL5BFLJPTAKTETQ","short_pith_number":"pith:SPOGSSHD","canonical_record":{"source":{"id":"1306.1267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-06-05T23:39:06Z","cross_cats_sorted":["cs.AI","math.PR"],"title_canon_sha256":"184e129940fad49768aba414c63014eb4f73ccf0bca2138646793dce56c74fb0","abstract_canon_sha256":"272b412e1e2bb5b167e9d7384e1069e6ed267bd3c0bda6dea3da652cc7719f04"},"schema_version":"1.0"},"canonical_sha256":"93dc6948e3991335f4255a5f302a649c3031028e100a31ed163f41ec4724bd3e","source":{"kind":"arxiv","id":"1306.1267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1267","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1267v1","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1267","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"SPOGSSHDTEJT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPOGSSHDTEJTL5BF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPOGSSHD","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SPOGSSHDTEJTL5BFLJPTAKTETQ","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-06-05T23:39:06Z","cross_cats_sorted":["cs.AI","math.PR"],"title_canon_sha256":"184e129940fad49768aba414c63014eb4f73ccf0bca2138646793dce56c74fb0","abstract_canon_sha256":"272b412e1e2bb5b167e9d7384e1069e6ed267bd3c0bda6dea3da652cc7719f04"},"schema_version":"1.0"},"canonical_sha256":"93dc6948e3991335f4255a5f302a649c3031028e100a31ed163f41ec4724bd3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:32.172643Z","signature_b64":"ypGInVpiebi+rz5nZ7ZfYecg+P0dHVW8SwEj4vSYrtk/Dfyq6lafP5DDBJTh6SPC0+fAxiP3+PQpjACJ2KPwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93dc6948e3991335f4255a5f302a649c3031028e100a31ed163f41ec4724bd3e","last_reissued_at":"2026-05-18T01:49:32.171649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:32.171649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1267","source_version":1,"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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDhTenGPiVJLRVzZxhz0x0r/cq5l1HSlbq3j4Ydv2RHscAu/t1Fdt5m0lG10u0q3BIgfa3QRgP0561/oPQQZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:16:34.463719Z"},"content_sha256":"08b5d107c073e00bfb010903ff979ef60c79004417db8b9d9c4d835a7f0936cf","schema_version":"1.0","event_id":"sha256:08b5d107c073e00bfb010903ff979ef60c79004417db8b9d9c4d835a7f0936cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SPOGSSHDTEJTL5BFLJPTAKTETQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.PR"],"primary_cat":"cond-mat.stat-mech","authors_text":"Andrew Gelfand, Jinwoo Shin, Michael Chertkov","submitted_at":"2013-06-05T23:39:06Z","abstract_excerpt":"This manuscript discusses computation of the Partition Function (PF) and the Minimum Weight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem formulations - one for computing the PF of a Perfect Matching (PM) and one for finding MWPMs - that build upon the inter-related Bethe Free Energy, Belief Propagation (BP), Loop Calculus (LC), Integer Linear Programming (ILP) and Linear Programming (LP) frameworks. First, we describe an extension of the LC framework to the PM problem. The resulting formulas, coined (fractional) Bootstrap-BP, express the PF of the or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1267","kind":"arxiv","version":1},"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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0D4Fe+uGwWTEePGIPDSgkS+W2/b6JpJxzdOTodPUcXwXXi9w/aa1C3yak31iI80rkopW2h6h+igsJr4M60oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:16:34.464072Z"},"content_sha256":"5b054cd0d2906231e58fb8d425caac386724dd3dde5842e9bb6745186901d6d2","schema_version":"1.0","event_id":"sha256:5b054cd0d2906231e58fb8d425caac386724dd3dde5842e9bb6745186901d6d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/bundle.json","state_url":"https://pith.science/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/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-03T18:16:34Z","links":{"resolver":"https://pith.science/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ","bundle":"https://pith.science/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/bundle.json","state":"https://pith.science/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPOGSSHDTEJTL5BFLJPTAKTETQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SPOGSSHDTEJTL5BFLJPTAKTETQ","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":"272b412e1e2bb5b167e9d7384e1069e6ed267bd3c0bda6dea3da652cc7719f04","cross_cats_sorted":["cs.AI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-06-05T23:39:06Z","title_canon_sha256":"184e129940fad49768aba414c63014eb4f73ccf0bca2138646793dce56c74fb0"},"schema_version":"1.0","source":{"id":"1306.1267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1267","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1267v1","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1267","created_at":"2026-05-18T01:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"SPOGSSHDTEJT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPOGSSHDTEJTL5BF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPOGSSHD","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:5b054cd0d2906231e58fb8d425caac386724dd3dde5842e9bb6745186901d6d2","target":"graph","created_at":"2026-05-18T01:49:32Z","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":"This manuscript discusses computation of the Partition Function (PF) and the Minimum Weight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem formulations - one for computing the PF of a Perfect Matching (PM) and one for finding MWPMs - that build upon the inter-related Bethe Free Energy, Belief Propagation (BP), Loop Calculus (LC), Integer Linear Programming (ILP) and Linear Programming (LP) frameworks. First, we describe an extension of the LC framework to the PM problem. The resulting formulas, coined (fractional) Bootstrap-BP, express the PF of the or","authors_text":"Andrew Gelfand, Jinwoo Shin, Michael Chertkov","cross_cats":["cs.AI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-06-05T23:39:06Z","title":"Loop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1267","kind":"arxiv","version":1},"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:08b5d107c073e00bfb010903ff979ef60c79004417db8b9d9c4d835a7f0936cf","target":"record","created_at":"2026-05-18T01:49:32Z","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":"272b412e1e2bb5b167e9d7384e1069e6ed267bd3c0bda6dea3da652cc7719f04","cross_cats_sorted":["cs.AI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-06-05T23:39:06Z","title_canon_sha256":"184e129940fad49768aba414c63014eb4f73ccf0bca2138646793dce56c74fb0"},"schema_version":"1.0","source":{"id":"1306.1267","kind":"arxiv","version":1}},"canonical_sha256":"93dc6948e3991335f4255a5f302a649c3031028e100a31ed163f41ec4724bd3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93dc6948e3991335f4255a5f302a649c3031028e100a31ed163f41ec4724bd3e","first_computed_at":"2026-05-18T01:49:32.171649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:32.171649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ypGInVpiebi+rz5nZ7ZfYecg+P0dHVW8SwEj4vSYrtk/Dfyq6lafP5DDBJTh6SPC0+fAxiP3+PQpjACJ2KPwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:32.172643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08b5d107c073e00bfb010903ff979ef60c79004417db8b9d9c4d835a7f0936cf","sha256:5b054cd0d2906231e58fb8d425caac386724dd3dde5842e9bb6745186901d6d2"],"state_sha256":"0edca77f4dfc90c61b4ca0a7eac613850e530f40013514e2698b41c95d34c1ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EO6AEt0iWlVTYtLcZKs6uCKWzOLlqk0OwHtma4wYPJJWBQ6+QQsAfGg3vzff5qhGxjgFuEZNS7pYgtdIpOJ5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:16:34.466070Z","bundle_sha256":"26d528b2c369721946ac416d8445a4ea89c98060f208f3a020ad039a9b69873f"}}