{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AVGT5OOLTWKAL3VDAC6SRLDRCS","short_pith_number":"pith:AVGT5OOL","schema_version":"1.0","canonical_sha256":"054d3eb9cb9d9405eea300bd28ac7114b51e18f668845c596392ab25aceaf4a4","source":{"kind":"arxiv","id":"1504.01311","version":1},"attestation_state":"computed","paper":{"title":"PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Meierfrankenfeld, Eli Fox-Epstein, Roie Levin","submitted_at":"2015-04-06T16:01:06Z","abstract_excerpt":"We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing. MAP on Pairwise Markov Random Fields with (possibly) negative weights cannot be approximated unless P = NP, even on planar graphs. We also show via reduction that this yields a PTAS for one scoring function of Correlation Clustering in planar graphs."},"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":"1504.01311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-06T16:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"8005b42446530ae35a7b5d0d4802253cba26ad0d0a01e871cc4c07068eca131b","abstract_canon_sha256":"ff3ed642235c1b545f4a3689d815f68ec7ca57f363081ef304b96a956b05fb54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:34.681222Z","signature_b64":"KAeBD9MBA6EnIRVqXfLLj0RL1ggsnyg/5aFpQ2Pw1bl/vbB04fGxQJ7GR+CehoajnH9qIlEhbdpXOoUsxNY7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"054d3eb9cb9d9405eea300bd28ac7114b51e18f668845c596392ab25aceaf4a4","last_reissued_at":"2026-05-18T02:19:34.680658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:34.680658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Meierfrankenfeld, Eli Fox-Epstein, Roie Levin","submitted_at":"2015-04-06T16:01:06Z","abstract_excerpt":"We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing. MAP on Pairwise Markov Random Fields with (possibly) negative weights cannot be approximated unless P = NP, even on planar graphs. We also show via reduction that this yields a PTAS for one scoring function of Correlation Clustering in planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01311","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":"1504.01311","created_at":"2026-05-18T02:19:34.680733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01311v1","created_at":"2026-05-18T02:19:34.680733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01311","created_at":"2026-05-18T02:19:34.680733+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVGT5OOLTWKA","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVGT5OOLTWKAL3VD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVGT5OOL","created_at":"2026-05-18T12:29:10.953037+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/AVGT5OOLTWKAL3VDAC6SRLDRCS","json":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS.json","graph_json":"https://pith.science/api/pith-number/AVGT5OOLTWKAL3VDAC6SRLDRCS/graph.json","events_json":"https://pith.science/api/pith-number/AVGT5OOLTWKAL3VDAC6SRLDRCS/events.json","paper":"https://pith.science/paper/AVGT5OOL"},"agent_actions":{"view_html":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS","download_json":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS.json","view_paper":"https://pith.science/paper/AVGT5OOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01311&json=true","fetch_graph":"https://pith.science/api/pith-number/AVGT5OOLTWKAL3VDAC6SRLDRCS/graph.json","fetch_events":"https://pith.science/api/pith-number/AVGT5OOLTWKAL3VDAC6SRLDRCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS/action/storage_attestation","attest_author":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS/action/author_attestation","sign_citation":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS/action/citation_signature","submit_replication":"https://pith.science/pith/AVGT5OOLTWKAL3VDAC6SRLDRCS/action/replication_record"}},"created_at":"2026-05-18T02:19:34.680733+00:00","updated_at":"2026-05-18T02:19:34.680733+00:00"}