{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:KUVZY52CP3B7OVZ67T4LORVHLK","short_pith_number":"pith:KUVZY52C","schema_version":"1.0","canonical_sha256":"552b9c77427ec3f7573efcf8b746a75aa9997cfea421818e501ee6718bf34671","source":{"kind":"arxiv","id":"0807.5091","version":1},"attestation_state":"computed","paper":{"title":"Message-passing for Maximum Weight Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AI","authors_text":"Alan Willsky, Devavrat Shah, Sujay Sanghavi","submitted_at":"2008-07-31T15:26:27Z","abstract_excerpt":"We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed point estimate of max-product can be mapped in a natural way to an extreme point of the LP polytope associated with the MWIS problem. However, this extreme point may not be the one that maximizes the value of node weights; the particular extreme point at final convergence depends on the initialization of max-product. We then show that if max-product is star"},"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":"0807.5091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2008-07-31T15:26:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0ed9c04e3d9bc08e6d45948c02f79515108b9a46eb76d389b3d0cc8018fce5e9","abstract_canon_sha256":"8b2705a0babef096ff243380269b94703aedd501691016d43a532681af27b526"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.683817Z","signature_b64":"th5tnZl0w9N6ZMzd11LJSh/HtE2ajxZ0ZQGYYF2X+ou5GmFfU7FPj7cK5jSEd2gAcTGmfUU6Tc7LYlmZo3UlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552b9c77427ec3f7573efcf8b746a75aa9997cfea421818e501ee6718bf34671","last_reissued_at":"2026-05-18T00:59:11.683132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.683132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-passing for Maximum Weight Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AI","authors_text":"Alan Willsky, Devavrat Shah, Sujay Sanghavi","submitted_at":"2008-07-31T15:26:27Z","abstract_excerpt":"We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed point estimate of max-product can be mapped in a natural way to an extreme point of the LP polytope associated with the MWIS problem. However, this extreme point may not be the one that maximizes the value of node weights; the particular extreme point at final convergence depends on the initialization of max-product. We then show that if max-product is star"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.5091","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0807.5091","created_at":"2026-05-18T00:59:11.683244+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.5091v1","created_at":"2026-05-18T00:59:11.683244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.5091","created_at":"2026-05-18T00:59:11.683244+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUVZY52CP3B7","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUVZY52CP3B7OVZ6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUVZY52C","created_at":"2026-05-18T12:25:57.157939+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/KUVZY52CP3B7OVZ67T4LORVHLK","json":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK.json","graph_json":"https://pith.science/api/pith-number/KUVZY52CP3B7OVZ67T4LORVHLK/graph.json","events_json":"https://pith.science/api/pith-number/KUVZY52CP3B7OVZ67T4LORVHLK/events.json","paper":"https://pith.science/paper/KUVZY52C"},"agent_actions":{"view_html":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK","download_json":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK.json","view_paper":"https://pith.science/paper/KUVZY52C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.5091&json=true","fetch_graph":"https://pith.science/api/pith-number/KUVZY52CP3B7OVZ67T4LORVHLK/graph.json","fetch_events":"https://pith.science/api/pith-number/KUVZY52CP3B7OVZ67T4LORVHLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK/action/storage_attestation","attest_author":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK/action/author_attestation","sign_citation":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK/action/citation_signature","submit_replication":"https://pith.science/pith/KUVZY52CP3B7OVZ67T4LORVHLK/action/replication_record"}},"created_at":"2026-05-18T00:59:11.683244+00:00","updated_at":"2026-05-18T00:59:11.683244+00:00"}