{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EFXRLNH3I52CMAC32SUZLMDSVB","short_pith_number":"pith:EFXRLNH3","canonical_record":{"source":{"id":"2301.12159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-28T11:10:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d53237edec665e55874c196ee996018d7f049321b978c4d6cc1248e2cc1dc9ed","abstract_canon_sha256":"45da471fa9576417a6587f083851c7c63f7fa825e5d5cfe3058aec74673d5dca"},"schema_version":"1.0"},"canonical_sha256":"216f15b4fb477426005bd4a995b072a84ec9383fb91bec6d82a0f4dcfa55aee6","source":{"kind":"arxiv","id":"2301.12159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.12159","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"2301.12159v2","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12159","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"EFXRLNH3I52C","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_16","alias_value":"EFXRLNH3I52CMAC3","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_8","alias_value":"EFXRLNH3","created_at":"2026-07-05T06:17:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EFXRLNH3I52CMAC32SUZLMDSVB","target":"record","payload":{"canonical_record":{"source":{"id":"2301.12159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-28T11:10:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d53237edec665e55874c196ee996018d7f049321b978c4d6cc1248e2cc1dc9ed","abstract_canon_sha256":"45da471fa9576417a6587f083851c7c63f7fa825e5d5cfe3058aec74673d5dca"},"schema_version":"1.0"},"canonical_sha256":"216f15b4fb477426005bd4a995b072a84ec9383fb91bec6d82a0f4dcfa55aee6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:27.589998Z","signature_b64":"mugNzT3RpDFZovoi43/p3KeOOst3MhmV5w1mJs2A/bQ9mJXihioXlCwtKXnqRh+aqluhC7nDcVM/Ow31wocUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"216f15b4fb477426005bd4a995b072a84ec9383fb91bec6d82a0f4dcfa55aee6","last_reissued_at":"2026-07-05T06:17:27.589412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:27.589412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.12159","source_version":2,"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-07-05T06:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LG7VW1Y1oSVQYpj+DLBxoAIgxMflohSS5wVA5xs87pLfWRw4FWtk1HGmzOlFP40iRDBebu8GZu2IevYVBl9SAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:45:20.070422Z"},"content_sha256":"1e045b9bef1848f670b852c735dacd4956db5d687e08353dd89ee04882ea0fab","schema_version":"1.0","event_id":"sha256:1e045b9bef1848f670b852c735dacd4956db5d687e08353dd89ee04882ea0fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EFXRLNH3I52CMAC32SUZLMDSVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ClusterFuG: Clustering Fully connected Graphs by Multicut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ahmed Abbas, Paul Swoboda","submitted_at":"2023-01-28T11:10:50Z","abstract_excerpt":"We propose a graph clustering formulation based on multicut (a.k.a. weighted correlation clustering) on the complete graph. Our formulation does not need specification of the graph topology as in the original sparse formulation of multicut, making our approach simpler and potentially better performing. In contrast to unweighted correlation clustering we allow for a more expressive weighted cost structure. In dense multicut, the clustering objective is given in a factorized form as inner products of node feature vectors. This allows for an efficient formulation and inference in contrast to mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12159","kind":"arxiv","version":2},"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/2301.12159/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"},"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-07-05T06:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NaP/vyoAvobjK03oT/sycjbFrIZuaIIlk7oznlqxwf0lUvyeeBhPbkVJfzd8c0PsL3sh/jCqqG31uzo+cU8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:45:20.070834Z"},"content_sha256":"f8ae7cb2816c83190c8d9ed42c189f7079071e4dc5d1ffba6db6f442daa8b3bc","schema_version":"1.0","event_id":"sha256:f8ae7cb2816c83190c8d9ed42c189f7079071e4dc5d1ffba6db6f442daa8b3bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFXRLNH3I52CMAC32SUZLMDSVB/bundle.json","state_url":"https://pith.science/pith/EFXRLNH3I52CMAC32SUZLMDSVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFXRLNH3I52CMAC32SUZLMDSVB/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-07-06T15:45:20Z","links":{"resolver":"https://pith.science/pith/EFXRLNH3I52CMAC32SUZLMDSVB","bundle":"https://pith.science/pith/EFXRLNH3I52CMAC32SUZLMDSVB/bundle.json","state":"https://pith.science/pith/EFXRLNH3I52CMAC32SUZLMDSVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFXRLNH3I52CMAC32SUZLMDSVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EFXRLNH3I52CMAC32SUZLMDSVB","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":"45da471fa9576417a6587f083851c7c63f7fa825e5d5cfe3058aec74673d5dca","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-28T11:10:50Z","title_canon_sha256":"d53237edec665e55874c196ee996018d7f049321b978c4d6cc1248e2cc1dc9ed"},"schema_version":"1.0","source":{"id":"2301.12159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.12159","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"2301.12159v2","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12159","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"EFXRLNH3I52C","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_16","alias_value":"EFXRLNH3I52CMAC3","created_at":"2026-07-05T06:17:27Z"},{"alias_kind":"pith_short_8","alias_value":"EFXRLNH3","created_at":"2026-07-05T06:17:27Z"}],"graph_snapshots":[{"event_id":"sha256:f8ae7cb2816c83190c8d9ed42c189f7079071e4dc5d1ffba6db6f442daa8b3bc","target":"graph","created_at":"2026-07-05T06:17:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.12159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a graph clustering formulation based on multicut (a.k.a. weighted correlation clustering) on the complete graph. Our formulation does not need specification of the graph topology as in the original sparse formulation of multicut, making our approach simpler and potentially better performing. In contrast to unweighted correlation clustering we allow for a more expressive weighted cost structure. In dense multicut, the clustering objective is given in a factorized form as inner products of node feature vectors. This allows for an efficient formulation and inference in contrast to mult","authors_text":"Ahmed Abbas, Paul Swoboda","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-28T11:10:50Z","title":"ClusterFuG: Clustering Fully connected Graphs by Multicut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12159","kind":"arxiv","version":2},"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:1e045b9bef1848f670b852c735dacd4956db5d687e08353dd89ee04882ea0fab","target":"record","created_at":"2026-07-05T06:17:27Z","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":"45da471fa9576417a6587f083851c7c63f7fa825e5d5cfe3058aec74673d5dca","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-01-28T11:10:50Z","title_canon_sha256":"d53237edec665e55874c196ee996018d7f049321b978c4d6cc1248e2cc1dc9ed"},"schema_version":"1.0","source":{"id":"2301.12159","kind":"arxiv","version":2}},"canonical_sha256":"216f15b4fb477426005bd4a995b072a84ec9383fb91bec6d82a0f4dcfa55aee6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"216f15b4fb477426005bd4a995b072a84ec9383fb91bec6d82a0f4dcfa55aee6","first_computed_at":"2026-07-05T06:17:27.589412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:17:27.589412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mugNzT3RpDFZovoi43/p3KeOOst3MhmV5w1mJs2A/bQ9mJXihioXlCwtKXnqRh+aqluhC7nDcVM/Ow31wocUAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:17:27.589998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.12159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e045b9bef1848f670b852c735dacd4956db5d687e08353dd89ee04882ea0fab","sha256:f8ae7cb2816c83190c8d9ed42c189f7079071e4dc5d1ffba6db6f442daa8b3bc"],"state_sha256":"556743dc9c8a39f060b008ef99e909eb6c5b22871ab5350313d5f258643fbc4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJSvUuoFr+josbY1aw9gt1QJOuih2f4SQVIR0JrGkE74koRTlEM6MEhgf0+iGzrMmwBLXno965PutrZ7MF/qAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:45:20.072927Z","bundle_sha256":"2fd7c970dd83701ed988d9f7002791caae0a19bf7d4d2dc7c89f76eb9306dc12"}}