{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NAUF734IDFZFVYMZ363YS5RLMQ","short_pith_number":"pith:NAUF734I","canonical_record":{"source":{"id":"1203.3494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3d617b9b246a79356fab3929f842584a2585a044272a2af6a59648821cdcf385","abstract_canon_sha256":"cd00213dc685057c8f0152f9d07b5fc2b9af89f2c56c35477176c195333dc133"},"schema_version":"1.0"},"canonical_sha256":"68285fef8819725ae199dfb789762b640c575917f37881f7ea62950f34714557","source":{"kind":"arxiv","id":"1203.3494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3494","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3494v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3494","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"NAUF734IDFZF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NAUF734IDFZFVYMZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NAUF734I","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NAUF734IDFZFVYMZ363YS5RLMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3d617b9b246a79356fab3929f842584a2585a044272a2af6a59648821cdcf385","abstract_canon_sha256":"cd00213dc685057c8f0152f9d07b5fc2b9af89f2c56c35477176c195333dc133"},"schema_version":"1.0"},"canonical_sha256":"68285fef8819725ae199dfb789762b640c575917f37881f7ea62950f34714557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.256111Z","signature_b64":"O7DmHCfarUAt0TULZEqlJbXx2BaP34vbUjJeAIQPz0s9mZxeS5IzZNGvFsMOzE3CGQtqGEqB5Gy8ygqQStHHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68285fef8819725ae199dfb789762b640c575917f37881f7ea62950f34714557","last_reissued_at":"2026-05-18T04:00:00.255298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.255298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3494","source_version":1,"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJJxpROkEiJdXuNcSvRkCo3ia1ladfvC5r+hwMa2ll0CGZICZ1AfWuWe/Ji/6WK28Un/VYLncAc4aS9PKtumAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:46:18.126406Z"},"content_sha256":"2656a624c65424032b3293510652e8495447a770f29a33a03ddab6884f9e6f58","schema_version":"1.0","event_id":"sha256:2656a624c65424032b3293510652e8495447a770f29a33a03ddab6884f9e6f58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NAUF734IDFZFVYMZ363YS5RLMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Negative Tree Reweighted Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander T. Ihler, Qiang Liu","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound counterpart to the tree-reweighted belief propagation algorithm, which uses a convex combination of spanning trees with positive weights to provide corresponding upper bounds. We develop algorithms to optimize and tighten the lower bounds over the non-convex set of valid parameter val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3494","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"},"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Bw83zQ7IGOUwTRbbcyFlkzloasfWhc6ALiCTgb/x2wiEnmf8dxXriOU9qX5GtahnmVCQG5YUx0CHKTQe7uADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:46:18.127056Z"},"content_sha256":"2c27cd708cb7ad96ce127d472d1f865304980e965ad1a98fa93af9f072bb18b5","schema_version":"1.0","event_id":"sha256:2c27cd708cb7ad96ce127d472d1f865304980e965ad1a98fa93af9f072bb18b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAUF734IDFZFVYMZ363YS5RLMQ/bundle.json","state_url":"https://pith.science/pith/NAUF734IDFZFVYMZ363YS5RLMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAUF734IDFZFVYMZ363YS5RLMQ/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-01T00:46:18Z","links":{"resolver":"https://pith.science/pith/NAUF734IDFZFVYMZ363YS5RLMQ","bundle":"https://pith.science/pith/NAUF734IDFZFVYMZ363YS5RLMQ/bundle.json","state":"https://pith.science/pith/NAUF734IDFZFVYMZ363YS5RLMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAUF734IDFZFVYMZ363YS5RLMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NAUF734IDFZFVYMZ363YS5RLMQ","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":"cd00213dc685057c8f0152f9d07b5fc2b9af89f2c56c35477176c195333dc133","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"3d617b9b246a79356fab3929f842584a2585a044272a2af6a59648821cdcf385"},"schema_version":"1.0","source":{"id":"1203.3494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3494","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3494v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3494","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"NAUF734IDFZF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NAUF734IDFZFVYMZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NAUF734I","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:2c27cd708cb7ad96ce127d472d1f865304980e965ad1a98fa93af9f072bb18b5","target":"graph","created_at":"2026-05-18T04:00:00Z","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":"We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound counterpart to the tree-reweighted belief propagation algorithm, which uses a convex combination of spanning trees with positive weights to provide corresponding upper bounds. We develop algorithms to optimize and tighten the lower bounds over the non-convex set of valid parameter val","authors_text":"Alexander T. Ihler, Qiang Liu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title":"Negative Tree Reweighted Belief Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3494","kind":"arxiv","version":1},"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:2656a624c65424032b3293510652e8495447a770f29a33a03ddab6884f9e6f58","target":"record","created_at":"2026-05-18T04:00:00Z","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":"cd00213dc685057c8f0152f9d07b5fc2b9af89f2c56c35477176c195333dc133","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"3d617b9b246a79356fab3929f842584a2585a044272a2af6a59648821cdcf385"},"schema_version":"1.0","source":{"id":"1203.3494","kind":"arxiv","version":1}},"canonical_sha256":"68285fef8819725ae199dfb789762b640c575917f37881f7ea62950f34714557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68285fef8819725ae199dfb789762b640c575917f37881f7ea62950f34714557","first_computed_at":"2026-05-18T04:00:00.255298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.255298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7DmHCfarUAt0TULZEqlJbXx2BaP34vbUjJeAIQPz0s9mZxeS5IzZNGvFsMOzE3CGQtqGEqB5Gy8ygqQStHHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.256111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2656a624c65424032b3293510652e8495447a770f29a33a03ddab6884f9e6f58","sha256:2c27cd708cb7ad96ce127d472d1f865304980e965ad1a98fa93af9f072bb18b5"],"state_sha256":"48c819e7f4323630f1150619238d8a0cd27d8e07215446dc9ff131339e77a53d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/ONAl6avrfJi74butMTDFxiR8Srd1e5TVqFklN5b03VwGoQ10GXVzDBnkrkn3s+8yEAkKXqO0F1xywizoCaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:46:18.132045Z","bundle_sha256":"bb129cce26fca3c207024f6befb5d0602efab21e26538bd909ea5982418b9c1e"}}