{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TPCFUKMEAFGB7SGNRJDMV47W44","short_pith_number":"pith:TPCFUKME","schema_version":"1.0","canonical_sha256":"9bc45a2984014c1fc8cd8a46caf3f6e73ea6a1b6dc007d883c0640e78c6f1862","source":{"kind":"arxiv","id":"2109.01838","version":3},"attestation_state":"computed","paper":{"title":"RAMA: A Rapid Multicut Algorithm on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Ahmed Abbas, Paul Swoboda","submitted_at":"2021-09-04T10:33:59Z","abstract_excerpt":"We propose a highly parallel primal-dual algorithm for the multicut (a.k.a. correlation clustering) problem, a classical graph clustering problem widely used in machine learning and computer vision. Our algorithm consists of three steps executed recursively: (1) Finding conflicted cycles that correspond to violated inequalities of the underlying multicut relaxation, (2) Performing message passing between the edges and cycles to optimize the Lagrange relaxation coming from the found violated cycles producing reduced costs and (3) Contracting edges with high reduced costs through matrix-matrix m"},"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":"2109.01838","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-04T10:33:59Z","cross_cats_sorted":["cs.CV","cs.DS","cs.LG"],"title_canon_sha256":"40b2ce38de93552f3ecd8c585a5dbc67e50377dd656469212290c42f801230b3","abstract_canon_sha256":"e7ed8ce86356bd3fc7ee6df605d6e5d3b270be6cc13c7343fb8426bd255de2d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:50.912325Z","signature_b64":"N+2RrTjDdrbFQgf0knxywxY5K0z6S+K+wZakL96sLr/Qd+9EpVGMdQFZXtfODEKJz9+O4ICpyOXpP03DPnMkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bc45a2984014c1fc8cd8a46caf3f6e73ea6a1b6dc007d883c0640e78c6f1862","last_reissued_at":"2026-07-05T04:03:50.911894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:50.911894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RAMA: A Rapid Multicut Algorithm on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Ahmed Abbas, Paul Swoboda","submitted_at":"2021-09-04T10:33:59Z","abstract_excerpt":"We propose a highly parallel primal-dual algorithm for the multicut (a.k.a. correlation clustering) problem, a classical graph clustering problem widely used in machine learning and computer vision. Our algorithm consists of three steps executed recursively: (1) Finding conflicted cycles that correspond to violated inequalities of the underlying multicut relaxation, (2) Performing message passing between the edges and cycles to optimize the Lagrange relaxation coming from the found violated cycles producing reduced costs and (3) Contracting edges with high reduced costs through matrix-matrix m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01838","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.01838/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.01838","created_at":"2026-07-05T04:03:50.911949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.01838v3","created_at":"2026-07-05T04:03:50.911949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01838","created_at":"2026-07-05T04:03:50.911949+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPCFUKMEAFGB","created_at":"2026-07-05T04:03:50.911949+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPCFUKMEAFGB7SGN","created_at":"2026-07-05T04:03:50.911949+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPCFUKME","created_at":"2026-07-05T04:03:50.911949+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/TPCFUKMEAFGB7SGNRJDMV47W44","json":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44.json","graph_json":"https://pith.science/api/pith-number/TPCFUKMEAFGB7SGNRJDMV47W44/graph.json","events_json":"https://pith.science/api/pith-number/TPCFUKMEAFGB7SGNRJDMV47W44/events.json","paper":"https://pith.science/paper/TPCFUKME"},"agent_actions":{"view_html":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44","download_json":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44.json","view_paper":"https://pith.science/paper/TPCFUKME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.01838&json=true","fetch_graph":"https://pith.science/api/pith-number/TPCFUKMEAFGB7SGNRJDMV47W44/graph.json","fetch_events":"https://pith.science/api/pith-number/TPCFUKMEAFGB7SGNRJDMV47W44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44/action/storage_attestation","attest_author":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44/action/author_attestation","sign_citation":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44/action/citation_signature","submit_replication":"https://pith.science/pith/TPCFUKMEAFGB7SGNRJDMV47W44/action/replication_record"}},"created_at":"2026-07-05T04:03:50.911949+00:00","updated_at":"2026-07-05T04:03:50.911949+00:00"}