{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7QGR7BY3QYGYRUCV6EY636WIOA","short_pith_number":"pith:7QGR7BY3","canonical_record":{"source":{"id":"2412.02704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-11-23T00:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"2bf17019629905b3abf4b49a54a27507504d681ffa2d81074fc735e6fce82caf","abstract_canon_sha256":"1e427b553160e27eee912012dfff5f287e2240b7bd28c1b9596ed2076b75fcf7"},"schema_version":"1.0"},"canonical_sha256":"fc0d1f871b860d88d055f131edfac87033a8de9e87e030679d949c320a11db35","source":{"kind":"arxiv","id":"2412.02704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02704","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02704v1","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02704","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"7QGR7BY3QYGY","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"7QGR7BY3QYGYRUCV","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"7QGR7BY3","created_at":"2026-07-05T09:44:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7QGR7BY3QYGYRUCV6EY636WIOA","target":"record","payload":{"canonical_record":{"source":{"id":"2412.02704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-11-23T00:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"2bf17019629905b3abf4b49a54a27507504d681ffa2d81074fc735e6fce82caf","abstract_canon_sha256":"1e427b553160e27eee912012dfff5f287e2240b7bd28c1b9596ed2076b75fcf7"},"schema_version":"1.0"},"canonical_sha256":"fc0d1f871b860d88d055f131edfac87033a8de9e87e030679d949c320a11db35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:18.193983Z","signature_b64":"54j1aeE5rl9heq+tTwAXHufrl/anYFwHtbyeV8UbvYUYbFFyPs3ZUMtdYlwZ+ka60ZzshgXVS92yPuQy2TDFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0d1f871b860d88d055f131edfac87033a8de9e87e030679d949c320a11db35","last_reissued_at":"2026-07-05T09:44:18.193524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:18.193524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.02704","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-07-05T09:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4hkQa3IL33JPzz0ZC0z/6wwcSiqNXuDZkS9sq4ohjR51Ei7zhCK+s/ELB5sibbzYcObTvkfSdtzO/HXfvb9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:02:37.586932Z"},"content_sha256":"74000f44e8ce15ecce264d040b6711730bfcf232a6528e466e0ee05cbbdb5ce0","schema_version":"1.0","event_id":"sha256:74000f44e8ce15ecce264d040b6711730bfcf232a6528e466e0ee05cbbdb5ce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7QGR7BY3QYGYRUCV6EY636WIOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi","submitted_at":"2024-11-23T00:28:03Z","abstract_excerpt":"Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different groups are not close to each other. The problem has been previously modeled and studied as a graph editing problem, namely Cluster Editing, which assumes that closely related data elements must be adjacent. As such, the main objective (of the Cluster Editing problem) is to turn clusters into cliques as a way to identify them. This is to be obtained via two main edge editing operations: additions and deletions. There are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02704","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.02704/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-05T09:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0lvwLBdwY9o3Fz5zttRwWUGZuYqxQcOTkpMBQLGlFqgvEIp3DU8Sa4qzg5OUdbWSBkhOnYmf9jkIQ623onUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:02:37.588496Z"},"content_sha256":"e13f14be0402b94f92453856907d26c85998e08b06d182a1c968aa3be446432d","schema_version":"1.0","event_id":"sha256:e13f14be0402b94f92453856907d26c85998e08b06d182a1c968aa3be446432d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QGR7BY3QYGYRUCV6EY636WIOA/bundle.json","state_url":"https://pith.science/pith/7QGR7BY3QYGYRUCV6EY636WIOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QGR7BY3QYGYRUCV6EY636WIOA/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-08-13T11:02:37Z","links":{"resolver":"https://pith.science/pith/7QGR7BY3QYGYRUCV6EY636WIOA","bundle":"https://pith.science/pith/7QGR7BY3QYGYRUCV6EY636WIOA/bundle.json","state":"https://pith.science/pith/7QGR7BY3QYGYRUCV6EY636WIOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QGR7BY3QYGYRUCV6EY636WIOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7QGR7BY3QYGYRUCV6EY636WIOA","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":"1e427b553160e27eee912012dfff5f287e2240b7bd28c1b9596ed2076b75fcf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-11-23T00:28:03Z","title_canon_sha256":"2bf17019629905b3abf4b49a54a27507504d681ffa2d81074fc735e6fce82caf"},"schema_version":"1.0","source":{"id":"2412.02704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02704","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02704v1","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02704","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"7QGR7BY3QYGY","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_16","alias_value":"7QGR7BY3QYGYRUCV","created_at":"2026-07-05T09:44:18Z"},{"alias_kind":"pith_short_8","alias_value":"7QGR7BY3","created_at":"2026-07-05T09:44:18Z"}],"graph_snapshots":[{"event_id":"sha256:e13f14be0402b94f92453856907d26c85998e08b06d182a1c968aa3be446432d","target":"graph","created_at":"2026-07-05T09:44:18Z","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/2412.02704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different groups are not close to each other. The problem has been previously modeled and studied as a graph editing problem, namely Cluster Editing, which assumes that closely related data elements must be adjacent. As such, the main objective (of the Cluster Editing problem) is to turn clusters into cliques as a way to identify them. This is to be obtained via two main edge editing operations: additions and deletions. There are","authors_text":"Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02704","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:74000f44e8ce15ecce264d040b6711730bfcf232a6528e466e0ee05cbbdb5ce0","target":"record","created_at":"2026-07-05T09:44:18Z","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":"1e427b553160e27eee912012dfff5f287e2240b7bd28c1b9596ed2076b75fcf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-11-23T00:28:03Z","title_canon_sha256":"2bf17019629905b3abf4b49a54a27507504d681ffa2d81074fc735e6fce82caf"},"schema_version":"1.0","source":{"id":"2412.02704","kind":"arxiv","version":1}},"canonical_sha256":"fc0d1f871b860d88d055f131edfac87033a8de9e87e030679d949c320a11db35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc0d1f871b860d88d055f131edfac87033a8de9e87e030679d949c320a11db35","first_computed_at":"2026-07-05T09:44:18.193524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:18.193524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54j1aeE5rl9heq+tTwAXHufrl/anYFwHtbyeV8UbvYUYbFFyPs3ZUMtdYlwZ+ka60ZzshgXVS92yPuQy2TDFDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:18.193983Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74000f44e8ce15ecce264d040b6711730bfcf232a6528e466e0ee05cbbdb5ce0","sha256:e13f14be0402b94f92453856907d26c85998e08b06d182a1c968aa3be446432d"],"state_sha256":"f67c87bc587a5f8fba5cb18e6956f2cdfafe197db613c766e3e4e8c31f21c8c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HUv0BBTPuIaAnBV351MIENHf9WB2BXUKp15tEaf2X6qNRzt8wbRR/xSSJwvmHKL5hdbFA7u0djwIm9EHAt9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:02:37.598891Z","bundle_sha256":"16b70143459d97a51cd4cf280b3d274f67da394012598c09ce47f4f142d3358c"}}