{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4ZN3VPUUTBBGSZEUIPW5LGDW3P","short_pith_number":"pith:4ZN3VPUU","schema_version":"1.0","canonical_sha256":"e65bbabe94984269649443edd59876dbedfd3378366bc3c84bb1dbf90f0c8780","source":{"kind":"arxiv","id":"1010.0012","version":1},"attestation_state":"computed","paper":{"title":"An Embarrassingly Simple Speed-Up of Belief Propagation with Robust Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Huiying Shen, James M. Coughlan","submitted_at":"2010-09-30T20:17:03Z","abstract_excerpt":"We present an exact method of greatly speeding up belief propagation (BP) for a wide variety of potential functions in pairwise MRFs and other graphical models. Specifically, our technique applies whenever the pairwise potentials have been {\\em truncated} to a constant value for most pairs of states, as is commonly done in MRF models with robust potentials (such as stereo) that impose an upper bound on the penalty assigned to discontinuities; for each of the $M$ possible states in one node, only a smaller number $m$ of compatible states in a neighboring node are assigned milder penalties. The "},"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":"1010.0012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-30T20:17:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6135822ad7a7e3946bfe217afa14ef9cec6c342b9eba73205cd152bba008d4e2","abstract_canon_sha256":"ae4942f0b4b93f029190e9b2fbd5ec55357a1c9ac2e9527d11f531ffd636673b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.383275Z","signature_b64":"aYVyzHEVG7PdBPh1EpTeWxsypybxEnyoJMXIJD1BB+PPaXQ71M1X3fIFv63AiP+qRtRoInls+a2qrdEauwnWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e65bbabe94984269649443edd59876dbedfd3378366bc3c84bb1dbf90f0c8780","last_reissued_at":"2026-05-18T04:40:00.382784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.382784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Embarrassingly Simple Speed-Up of Belief Propagation with Robust Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Huiying Shen, James M. Coughlan","submitted_at":"2010-09-30T20:17:03Z","abstract_excerpt":"We present an exact method of greatly speeding up belief propagation (BP) for a wide variety of potential functions in pairwise MRFs and other graphical models. Specifically, our technique applies whenever the pairwise potentials have been {\\em truncated} to a constant value for most pairs of states, as is commonly done in MRF models with robust potentials (such as stereo) that impose an upper bound on the penalty assigned to discontinuities; for each of the $M$ possible states in one node, only a smaller number $m$ of compatible states in a neighboring node are assigned milder penalties. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0012","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":"1010.0012","created_at":"2026-05-18T04:40:00.382861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0012v1","created_at":"2026-05-18T04:40:00.382861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0012","created_at":"2026-05-18T04:40:00.382861+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZN3VPUUTBBG","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZN3VPUUTBBGSZEU","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZN3VPUU","created_at":"2026-05-18T12:26:04.259169+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/4ZN3VPUUTBBGSZEUIPW5LGDW3P","json":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P.json","graph_json":"https://pith.science/api/pith-number/4ZN3VPUUTBBGSZEUIPW5LGDW3P/graph.json","events_json":"https://pith.science/api/pith-number/4ZN3VPUUTBBGSZEUIPW5LGDW3P/events.json","paper":"https://pith.science/paper/4ZN3VPUU"},"agent_actions":{"view_html":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P","download_json":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P.json","view_paper":"https://pith.science/paper/4ZN3VPUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0012&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZN3VPUUTBBGSZEUIPW5LGDW3P/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZN3VPUUTBBGSZEUIPW5LGDW3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P/action/storage_attestation","attest_author":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P/action/author_attestation","sign_citation":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P/action/citation_signature","submit_replication":"https://pith.science/pith/4ZN3VPUUTBBGSZEUIPW5LGDW3P/action/replication_record"}},"created_at":"2026-05-18T04:40:00.382861+00:00","updated_at":"2026-05-18T04:40:00.382861+00:00"}