{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2D6NRWH5OTVVTG2OME5RKH6JTJ","short_pith_number":"pith:2D6NRWH5","schema_version":"1.0","canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","source":{"kind":"arxiv","id":"1205.6352","version":4},"attestation_state":"computed","paper":{"title":"Generalized sequential tree-reweighted message passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Thomas Schoenemann, Vladimir Kolmogorov","submitted_at":"2012-05-29T13:06:58Z","abstract_excerpt":"This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an ef"},"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":"1205.6352","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-05-29T13:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"bda637642cb3c6448c10b3fcbd1a591272d05a0bb806808501b902ac91532a60","abstract_canon_sha256":"eec329469cd59816f2a114b8e6927e17039b72ca1d6b9c216607a5a63adbf8a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:09.275037Z","signature_b64":"wbMZF/tO8CYWMLmcB9EB/q7gewNXmkk57LAp5FcvllMi2zChdoMlFKilDuh4btBu9svKyIjwtMN/sDlRuzw6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","last_reissued_at":"2026-05-18T02:21:09.274418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:09.274418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized sequential tree-reweighted message passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Thomas Schoenemann, Vladimir Kolmogorov","submitted_at":"2012-05-29T13:06:58Z","abstract_excerpt":"This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6352","kind":"arxiv","version":4},"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":"1205.6352","created_at":"2026-05-18T02:21:09.274507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6352v4","created_at":"2026-05-18T02:21:09.274507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6352","created_at":"2026-05-18T02:21:09.274507+00:00"},{"alias_kind":"pith_short_12","alias_value":"2D6NRWH5OTVV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2D6NRWH5OTVVTG2O","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2D6NRWH5","created_at":"2026-05-18T12:26:50.516681+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/2D6NRWH5OTVVTG2OME5RKH6JTJ","json":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ.json","graph_json":"https://pith.science/api/pith-number/2D6NRWH5OTVVTG2OME5RKH6JTJ/graph.json","events_json":"https://pith.science/api/pith-number/2D6NRWH5OTVVTG2OME5RKH6JTJ/events.json","paper":"https://pith.science/paper/2D6NRWH5"},"agent_actions":{"view_html":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ","download_json":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ.json","view_paper":"https://pith.science/paper/2D6NRWH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6352&json=true","fetch_graph":"https://pith.science/api/pith-number/2D6NRWH5OTVVTG2OME5RKH6JTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2D6NRWH5OTVVTG2OME5RKH6JTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/action/storage_attestation","attest_author":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/action/author_attestation","sign_citation":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/action/citation_signature","submit_replication":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/action/replication_record"}},"created_at":"2026-05-18T02:21:09.274507+00:00","updated_at":"2026-05-18T02:21:09.274507+00:00"}