{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ONFNETVHLPQWAUS6UAHLWYH256","short_pith_number":"pith:ONFNETVH","schema_version":"1.0","canonical_sha256":"734ad24ea75be160525ea00ebb60faefbe91704511d82c4aa80574bb4d7f46d2","source":{"kind":"arxiv","id":"0911.1419","version":2},"attestation_state":"computed","paper":{"title":"Belief Propagation and Loop Calculus for the Permanent of a Non-Negative Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM","cs.LG","cs.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Michael Chertkov, Yusuke Watanabe","submitted_at":"2009-11-08T04:15:01Z","abstract_excerpt":"We consider computation of permanent of a positive $(N\\times N)$ non-negative matrix, $P=(P_i^j|i,j=1,\\cdots,N)$, or equivalently the problem of weighted counting of the perfect matchings over the complete bipartite graph $K_{N,N}$. The problem is known to be of likely exponential complexity. Stated as the partition function $Z$ of a graphical model, the problem allows exact Loop Calculus representation [Chertkov, Chernyak '06] in terms of an interior minimum of the Bethe Free Energy functional over non-integer doubly stochastic matrix of marginal beliefs, $\\beta=(\\beta_i^j|i,j=1,\\cdots,N)$, a"},"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":"0911.1419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-08T04:15:01Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","cs.LG","cs.NA","math.OC"],"title_canon_sha256":"ac917d69e646eba224977e4e0106f1a1d8902ce24dc92fea57b8adc2df0c956d","abstract_canon_sha256":"2b7784c1e719f24e853f280ba6158673462584c780d53951b042fff03b9c864f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:58.376181Z","signature_b64":"uVi2/2l83PZUaNE6V8O7jKpfCR0MKxrS8odG/rZnWkXf9mOYyMQv9xg8CymqQvqBIKHbMZzZ6PaG84NzKcrODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"734ad24ea75be160525ea00ebb60faefbe91704511d82c4aa80574bb4d7f46d2","last_reissued_at":"2026-05-18T02:10:58.375358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:58.375358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Belief Propagation and Loop Calculus for the Permanent of a Non-Negative Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM","cs.LG","cs.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Michael Chertkov, Yusuke Watanabe","submitted_at":"2009-11-08T04:15:01Z","abstract_excerpt":"We consider computation of permanent of a positive $(N\\times N)$ non-negative matrix, $P=(P_i^j|i,j=1,\\cdots,N)$, or equivalently the problem of weighted counting of the perfect matchings over the complete bipartite graph $K_{N,N}$. The problem is known to be of likely exponential complexity. Stated as the partition function $Z$ of a graphical model, the problem allows exact Loop Calculus representation [Chertkov, Chernyak '06] in terms of an interior minimum of the Bethe Free Energy functional over non-integer doubly stochastic matrix of marginal beliefs, $\\beta=(\\beta_i^j|i,j=1,\\cdots,N)$, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1419","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":"0911.1419","created_at":"2026-05-18T02:10:58.375511+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.1419v2","created_at":"2026-05-18T02:10:58.375511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1419","created_at":"2026-05-18T02:10:58.375511+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONFNETVHLPQW","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONFNETVHLPQWAUS6","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONFNETVH","created_at":"2026-05-18T12:26:01.383474+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/ONFNETVHLPQWAUS6UAHLWYH256","json":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256.json","graph_json":"https://pith.science/api/pith-number/ONFNETVHLPQWAUS6UAHLWYH256/graph.json","events_json":"https://pith.science/api/pith-number/ONFNETVHLPQWAUS6UAHLWYH256/events.json","paper":"https://pith.science/paper/ONFNETVH"},"agent_actions":{"view_html":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256","download_json":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256.json","view_paper":"https://pith.science/paper/ONFNETVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.1419&json=true","fetch_graph":"https://pith.science/api/pith-number/ONFNETVHLPQWAUS6UAHLWYH256/graph.json","fetch_events":"https://pith.science/api/pith-number/ONFNETVHLPQWAUS6UAHLWYH256/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256/action/storage_attestation","attest_author":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256/action/author_attestation","sign_citation":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256/action/citation_signature","submit_replication":"https://pith.science/pith/ONFNETVHLPQWAUS6UAHLWYH256/action/replication_record"}},"created_at":"2026-05-18T02:10:58.375511+00:00","updated_at":"2026-05-18T02:10:58.375511+00:00"}