{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7FNKOBAJO56WOBCBUF3R33OA6U","short_pith_number":"pith:7FNKOBAJ","canonical_record":{"source":{"id":"1309.6872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:53:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c76cb510b00b343b5c45f3a0726bece558c57d1d6e10264d9703764b5604f3b","abstract_canon_sha256":"7b00f8d36657acb70b768736fcff2d0d4532dcd6d20cd3894bc6cc9eec01ebb0"},"schema_version":"1.0"},"canonical_sha256":"f95aa70409777d670441a1771dedc0f50fa1e73fccf2d6a793a0e20cabcb84f5","source":{"kind":"arxiv","id":"1309.6872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6872","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6872v1","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6872","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"7FNKOBAJO56W","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7FNKOBAJO56WOBCB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7FNKOBAJ","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7FNKOBAJO56WOBCBUF3R33OA6U","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:53:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c76cb510b00b343b5c45f3a0726bece558c57d1d6e10264d9703764b5604f3b","abstract_canon_sha256":"7b00f8d36657acb70b768736fcff2d0d4532dcd6d20cd3894bc6cc9eec01ebb0"},"schema_version":"1.0"},"canonical_sha256":"f95aa70409777d670441a1771dedc0f50fa1e73fccf2d6a793a0e20cabcb84f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:09.914276Z","signature_b64":"RBZyw8ekNGaF/16f4ABHYfH/m/DNgqc5Ugm53KAGmDWrnbpQUDWty9IAF2b1ukIvjHQJezQX5nNqTcy7N3ViDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95aa70409777d670441a1771dedc0f50fa1e73fccf2d6a793a0e20cabcb84f5","last_reissued_at":"2026-05-18T03:12:09.913592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:09.913592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6872","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-18T03:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2Daq7NKfIx+A24CoRIHUHYMUtunBYnRgFycivTdRAltmtE2wB7outyccPxiSMh22lvTjwcIPETZl6flJpqIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:44.863943Z"},"content_sha256":"d1d1868404146dc5b36129fcae8955a45f0637049f8f634affad55f97b254713","schema_version":"1.0","event_id":"sha256:d1d1868404146dc5b36129fcae8955a45f0637049f8f634affad55f97b254713"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7FNKOBAJO56WOBCBUF3R33OA6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On MAP Inference by MWSS on Perfect Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Adrian Weller, Tony S. Jebara","submitted_at":"2013-09-26T12:53:41Z","abstract_excerpt":"Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight stable set (MWSS) on a derived weighted graph, which if perfect, allows inference in polynomial time. We derive new results for this approach, including a general decomposition theorem for MRFs of any order and number of labels, extensions of results for binary pairwise models with submodular cost functions to higher order, and an exact characterization of which binary pairwise MRFs can be efficiently solved with th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6872","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-18T03:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3CO5tD7+tARcZ5gBkcurezodfD+G3LMHCScR0ib/taMik+xWjOjvvYD5bvgsMi18ab8sX3/OCXAS1Fsl8KMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:44.864666Z"},"content_sha256":"a1fe554f1c640b1be63aa4fc636d1611cff4f4bfa69628d7ccf05b1f72e9a63a","schema_version":"1.0","event_id":"sha256:a1fe554f1c640b1be63aa4fc636d1611cff4f4bfa69628d7ccf05b1f72e9a63a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FNKOBAJO56WOBCBUF3R33OA6U/bundle.json","state_url":"https://pith.science/pith/7FNKOBAJO56WOBCBUF3R33OA6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FNKOBAJO56WOBCBUF3R33OA6U/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-05-29T14:43:44Z","links":{"resolver":"https://pith.science/pith/7FNKOBAJO56WOBCBUF3R33OA6U","bundle":"https://pith.science/pith/7FNKOBAJO56WOBCBUF3R33OA6U/bundle.json","state":"https://pith.science/pith/7FNKOBAJO56WOBCBUF3R33OA6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FNKOBAJO56WOBCBUF3R33OA6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7FNKOBAJO56WOBCBUF3R33OA6U","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":"7b00f8d36657acb70b768736fcff2d0d4532dcd6d20cd3894bc6cc9eec01ebb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:53:41Z","title_canon_sha256":"6c76cb510b00b343b5c45f3a0726bece558c57d1d6e10264d9703764b5604f3b"},"schema_version":"1.0","source":{"id":"1309.6872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6872","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6872v1","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6872","created_at":"2026-05-18T03:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"7FNKOBAJO56W","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7FNKOBAJO56WOBCB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7FNKOBAJ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:a1fe554f1c640b1be63aa4fc636d1611cff4f4bfa69628d7ccf05b1f72e9a63a","target":"graph","created_at":"2026-05-18T03:12: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":"Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight stable set (MWSS) on a derived weighted graph, which if perfect, allows inference in polynomial time. We derive new results for this approach, including a general decomposition theorem for MRFs of any order and number of labels, extensions of results for binary pairwise models with submodular cost functions to higher order, and an exact characterization of which binary pairwise MRFs can be efficiently solved with th","authors_text":"Adrian Weller, Tony S. Jebara","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:53:41Z","title":"On MAP Inference by MWSS on Perfect Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6872","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:d1d1868404146dc5b36129fcae8955a45f0637049f8f634affad55f97b254713","target":"record","created_at":"2026-05-18T03:12: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":"7b00f8d36657acb70b768736fcff2d0d4532dcd6d20cd3894bc6cc9eec01ebb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:53:41Z","title_canon_sha256":"6c76cb510b00b343b5c45f3a0726bece558c57d1d6e10264d9703764b5604f3b"},"schema_version":"1.0","source":{"id":"1309.6872","kind":"arxiv","version":1}},"canonical_sha256":"f95aa70409777d670441a1771dedc0f50fa1e73fccf2d6a793a0e20cabcb84f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95aa70409777d670441a1771dedc0f50fa1e73fccf2d6a793a0e20cabcb84f5","first_computed_at":"2026-05-18T03:12:09.913592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:09.913592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBZyw8ekNGaF/16f4ABHYfH/m/DNgqc5Ugm53KAGmDWrnbpQUDWty9IAF2b1ukIvjHQJezQX5nNqTcy7N3ViDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:09.914276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1d1868404146dc5b36129fcae8955a45f0637049f8f634affad55f97b254713","sha256:a1fe554f1c640b1be63aa4fc636d1611cff4f4bfa69628d7ccf05b1f72e9a63a"],"state_sha256":"72fa1e9539ce3f2a929932b4073fc89c6a608b1824a21504614cf597b5966413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ud4l/QvCZo6NBCWpe0djgjZbo1Nm3Q9frRTVdUMFbraUBWUulyZy8aIOf1iNHBJqeqN+S6a8x1yMz04runTLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:43:44.868535Z","bundle_sha256":"f2dcfba56b96ed19b1542570aef55687baad7e3065b0e6dbf08397fcbc851780"}}