{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E4FYBVZ2PU7QHQQG7PU4IMX3W6","short_pith_number":"pith:E4FYBVZ2","schema_version":"1.0","canonical_sha256":"270b80d73a7d3f03c206fbe9c432fbb782b1de5318e61bf6e0079c1547feceec","source":{"kind":"arxiv","id":"1601.02088","version":1},"attestation_state":"computed","paper":{"title":"Multicuts and Perturb & MAP for Probabilistic Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bogdan Savchynskyy, Christoph Schn\\\"orr, J\\\"org Hendrik Kappes, Paul Swoboda, Tamir Hazan","submitted_at":"2016-01-09T09:29:31Z","abstract_excerpt":"We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to rectify local data term cues so as to close contours and to obtain valid partitions.\n  We exploit recent progress on globally optimal MAP inference by integer programming and on perturbation-based approximations of the log-partition function, in order to sample clusterings and to estimate marginal distributions of node-pairs both more accurately and more effi"},"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":"1601.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-09T09:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"6c59ea6ad08ec95d41b9d9b05bf341e117c4cea3e6b12f69bd406b76983143c8","abstract_canon_sha256":"9825c42b33a457410b4b9649259a42af8b88920f99205ace9897cdb16d1ecf20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:07.315082Z","signature_b64":"bQ51D9QKsdEsVb5g0DMTODtq7tYH94OyL823TPbWsMfSyWpjEc8dtceyB1xVWQKCUCyFpJo9+hwoVtmY0KwHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"270b80d73a7d3f03c206fbe9c432fbb782b1de5318e61bf6e0079c1547feceec","last_reissued_at":"2026-05-18T01:23:07.314472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:07.314472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicuts and Perturb & MAP for Probabilistic Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bogdan Savchynskyy, Christoph Schn\\\"orr, J\\\"org Hendrik Kappes, Paul Swoboda, Tamir Hazan","submitted_at":"2016-01-09T09:29:31Z","abstract_excerpt":"We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to rectify local data term cues so as to close contours and to obtain valid partitions.\n  We exploit recent progress on globally optimal MAP inference by integer programming and on perturbation-based approximations of the log-partition function, in order to sample clusterings and to estimate marginal distributions of node-pairs both more accurately and more effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02088","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":"1601.02088","created_at":"2026-05-18T01:23:07.314558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02088v1","created_at":"2026-05-18T01:23:07.314558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02088","created_at":"2026-05-18T01:23:07.314558+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4FYBVZ2PU7Q","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4FYBVZ2PU7QHQQG","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4FYBVZ2","created_at":"2026-05-18T12:30:12.583610+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/E4FYBVZ2PU7QHQQG7PU4IMX3W6","json":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6.json","graph_json":"https://pith.science/api/pith-number/E4FYBVZ2PU7QHQQG7PU4IMX3W6/graph.json","events_json":"https://pith.science/api/pith-number/E4FYBVZ2PU7QHQQG7PU4IMX3W6/events.json","paper":"https://pith.science/paper/E4FYBVZ2"},"agent_actions":{"view_html":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6","download_json":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6.json","view_paper":"https://pith.science/paper/E4FYBVZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02088&json=true","fetch_graph":"https://pith.science/api/pith-number/E4FYBVZ2PU7QHQQG7PU4IMX3W6/graph.json","fetch_events":"https://pith.science/api/pith-number/E4FYBVZ2PU7QHQQG7PU4IMX3W6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6/action/storage_attestation","attest_author":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6/action/author_attestation","sign_citation":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6/action/citation_signature","submit_replication":"https://pith.science/pith/E4FYBVZ2PU7QHQQG7PU4IMX3W6/action/replication_record"}},"created_at":"2026-05-18T01:23:07.314558+00:00","updated_at":"2026-05-18T01:23:07.314558+00:00"}