{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2D6NRWH5OTVVTG2OME5RKH6JTJ","short_pith_number":"pith:2D6NRWH5","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"},"canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","source":{"kind":"arxiv","id":"1205.6352","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6352","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6352v4","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6352","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"2D6NRWH5OTVV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2D6NRWH5OTVVTG2O","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2D6NRWH5","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2D6NRWH5OTVVTG2OME5RKH6JTJ","target":"record","payload":{"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"},"canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","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"},"source_kind":"arxiv","source_id":"1205.6352","source_version":4,"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-18T02:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J4q7ofJ+DJC3760na5/dN/SQ+whs5s4xzXFE0mCsF+0sL+dWvjJKVZ8WRfocRcDRfDqKymEWVuGEzdQLlEmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:26:06.134847Z"},"content_sha256":"71617f4bf5e91b767899b26ff1f8a807376861ec2b34eb04d639b9b47363f835","schema_version":"1.0","event_id":"sha256:71617f4bf5e91b767899b26ff1f8a807376861ec2b34eb04d639b9b47363f835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2D6NRWH5OTVVTG2OME5RKH6JTJ","target":"graph","payload":{"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"},"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-18T02:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MC0VevIODPCF8AmaxISrK59Q72wcoQpM9bkqIelcjAC18WCq9tgDu1YXSEqROwt65acooNKmMbtQXhJBqegIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:26:06.135191Z"},"content_sha256":"f55c45233d773b85193596ec38797c59d489cff37cfe846ef495979189c407ed","schema_version":"1.0","event_id":"sha256:f55c45233d773b85193596ec38797c59d489cff37cfe846ef495979189c407ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/bundle.json","state_url":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/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-22T09:26:06Z","links":{"resolver":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ","bundle":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/bundle.json","state":"https://pith.science/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2D6NRWH5OTVVTG2OME5RKH6JTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2D6NRWH5OTVVTG2OME5RKH6JTJ","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":"eec329469cd59816f2a114b8e6927e17039b72ca1d6b9c216607a5a63adbf8a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-05-29T13:06:58Z","title_canon_sha256":"bda637642cb3c6448c10b3fcbd1a591272d05a0bb806808501b902ac91532a60"},"schema_version":"1.0","source":{"id":"1205.6352","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6352","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6352v4","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6352","created_at":"2026-05-18T02:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"2D6NRWH5OTVV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2D6NRWH5OTVVTG2O","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2D6NRWH5","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:f55c45233d773b85193596ec38797c59d489cff37cfe846ef495979189c407ed","target":"graph","created_at":"2026-05-18T02:21:09Z","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 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","authors_text":"Thomas Schoenemann, Vladimir Kolmogorov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-05-29T13:06:58Z","title":"Generalized sequential tree-reweighted message passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6352","kind":"arxiv","version":4},"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:71617f4bf5e91b767899b26ff1f8a807376861ec2b34eb04d639b9b47363f835","target":"record","created_at":"2026-05-18T02:21:09Z","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":"eec329469cd59816f2a114b8e6927e17039b72ca1d6b9c216607a5a63adbf8a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-05-29T13:06:58Z","title_canon_sha256":"bda637642cb3c6448c10b3fcbd1a591272d05a0bb806808501b902ac91532a60"},"schema_version":"1.0","source":{"id":"1205.6352","kind":"arxiv","version":4}},"canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0fcd8d8fd74eb599b4e613b151fc99a61c3d478241af2acb012f1347bb37509","first_computed_at":"2026-05-18T02:21:09.274418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:09.274418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbMZF/tO8CYWMLmcB9EB/q7gewNXmkk57LAp5FcvllMi2zChdoMlFKilDuh4btBu9svKyIjwtMN/sDlRuzw6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:09.275037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6352","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71617f4bf5e91b767899b26ff1f8a807376861ec2b34eb04d639b9b47363f835","sha256:f55c45233d773b85193596ec38797c59d489cff37cfe846ef495979189c407ed"],"state_sha256":"cfbbd802d7ee7f6081c2534383a1277a87df0984631486f242e88bb7af4ec940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fwM/T66g81oetTb3kElNFzS22jFJwQ6L2U+OlP35UtaMx35FmphOgkuULrvrsVBq7LyNuM/B88jziKIPXdAaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:26:06.137257Z","bundle_sha256":"27244ada2c4c9ca80a187ab6d71e7334d04ad86e1f8d6997108fc0d0ff14dc2f"}}