{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:X3GMUSZGWNGG3EJUPSSBJESDBA","short_pith_number":"pith:X3GMUSZG","canonical_record":{"source":{"id":"2112.03183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T17:22:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2381c3cedb50921ff41cab6bedc4fa24404318732e97097179dd387efa14b602","abstract_canon_sha256":"2b047491405aaec10f3462fdbcc7b9ee6e8bc47688e8b186877bd1cdb20afe08"},"schema_version":"1.0"},"canonical_sha256":"beccca4b26b34c6d91347ca4149243082548521d66820fa352795b7e0b6555e6","source":{"kind":"arxiv","id":"2112.03183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03183","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03183v2","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03183","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"X3GMUSZGWNGG","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"X3GMUSZGWNGG3EJU","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"X3GMUSZG","created_at":"2026-07-05T07:37:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:X3GMUSZGWNGG3EJUPSSBJESDBA","target":"record","payload":{"canonical_record":{"source":{"id":"2112.03183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T17:22:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2381c3cedb50921ff41cab6bedc4fa24404318732e97097179dd387efa14b602","abstract_canon_sha256":"2b047491405aaec10f3462fdbcc7b9ee6e8bc47688e8b186877bd1cdb20afe08"},"schema_version":"1.0"},"canonical_sha256":"beccca4b26b34c6d91347ca4149243082548521d66820fa352795b7e0b6555e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:36.211706Z","signature_b64":"/XVvqUn/emBJhumwbTW8SOua6UJ4QauEv6j6zegLxP0/ZQGw69Ar9/3Yt856+VxVh0PP3OxIBVdBe4OwOgCmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beccca4b26b34c6d91347ca4149243082548521d66820fa352795b7e0b6555e6","last_reissued_at":"2026-07-05T07:37:36.211351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:36.211351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.03183","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-05T07:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lM7HLa+Mudn39pf566koBoYYrYO8tghZ9LXJtCS3m6hzBn35O3mqIYkQUBdylj7o3AQUnAZPYzhDTuoox9rjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:37:33.757379Z"},"content_sha256":"31c34d920c6ff9094fc2dfb48effdf78910aed924984b30d6ce9c83ecb8c7928","schema_version":"1.0","event_id":"sha256:31c34d920c6ff9094fc2dfb48effdf78910aed924984b30d6ce9c83ecb8c7928"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:X3GMUSZGWNGG3EJUPSSBJESDBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modification-Fair Cluster Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Leon Kellerhals, Rolf Niedermeier, Vincent Froese","submitted_at":"2021-12-06T17:22:30Z","abstract_excerpt":"The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to vertex-colored graphs (the colors representing subgroups), standard algorithms for the NP-hard Cluster Editing problem may yield solutions that are biased towards subgroups of data (e.g., demographic groups), measured in the number of modifications incident to the members of the subgroups. We propose a modification fairness constraint which ensures that the number of edits incident to each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03183","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/2112.03183/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-05T07:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn3TJSk8lrZZJEc69DYyFVvvBEWoxv2NTiuF6qGDQC/Y8D5Y4UrH8LDwi8KZWJ/39yPUj7ouADfVwYlE8jX9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:37:33.757756Z"},"content_sha256":"2b7a80956ae609b6d813813448524853a65e29bca576a38348f14b44a54131cf","schema_version":"1.0","event_id":"sha256:2b7a80956ae609b6d813813448524853a65e29bca576a38348f14b44a54131cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/bundle.json","state_url":"https://pith.science/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/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-07T06:37:33Z","links":{"resolver":"https://pith.science/pith/X3GMUSZGWNGG3EJUPSSBJESDBA","bundle":"https://pith.science/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/bundle.json","state":"https://pith.science/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3GMUSZGWNGG3EJUPSSBJESDBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:X3GMUSZGWNGG3EJUPSSBJESDBA","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":"2b047491405aaec10f3462fdbcc7b9ee6e8bc47688e8b186877bd1cdb20afe08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T17:22:30Z","title_canon_sha256":"2381c3cedb50921ff41cab6bedc4fa24404318732e97097179dd387efa14b602"},"schema_version":"1.0","source":{"id":"2112.03183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03183","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03183v2","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03183","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"X3GMUSZGWNGG","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"X3GMUSZGWNGG3EJU","created_at":"2026-07-05T07:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"X3GMUSZG","created_at":"2026-07-05T07:37:36Z"}],"graph_snapshots":[{"event_id":"sha256:2b7a80956ae609b6d813813448524853a65e29bca576a38348f14b44a54131cf","target":"graph","created_at":"2026-07-05T07:37:36Z","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/2112.03183/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to vertex-colored graphs (the colors representing subgroups), standard algorithms for the NP-hard Cluster Editing problem may yield solutions that are biased towards subgroups of data (e.g., demographic groups), measured in the number of modifications incident to the members of the subgroups. We propose a modification fairness constraint which ensures that the number of edits incident to each","authors_text":"Leon Kellerhals, Rolf Niedermeier, Vincent Froese","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T17:22:30Z","title":"Modification-Fair Cluster Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03183","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:31c34d920c6ff9094fc2dfb48effdf78910aed924984b30d6ce9c83ecb8c7928","target":"record","created_at":"2026-07-05T07:37:36Z","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":"2b047491405aaec10f3462fdbcc7b9ee6e8bc47688e8b186877bd1cdb20afe08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T17:22:30Z","title_canon_sha256":"2381c3cedb50921ff41cab6bedc4fa24404318732e97097179dd387efa14b602"},"schema_version":"1.0","source":{"id":"2112.03183","kind":"arxiv","version":2}},"canonical_sha256":"beccca4b26b34c6d91347ca4149243082548521d66820fa352795b7e0b6555e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beccca4b26b34c6d91347ca4149243082548521d66820fa352795b7e0b6555e6","first_computed_at":"2026-07-05T07:37:36.211351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:37:36.211351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/XVvqUn/emBJhumwbTW8SOua6UJ4QauEv6j6zegLxP0/ZQGw69Ar9/3Yt856+VxVh0PP3OxIBVdBe4OwOgCmAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:37:36.211706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.03183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31c34d920c6ff9094fc2dfb48effdf78910aed924984b30d6ce9c83ecb8c7928","sha256:2b7a80956ae609b6d813813448524853a65e29bca576a38348f14b44a54131cf"],"state_sha256":"ad8c2df8fc17a15bcd8cb5b9cb10339eb1de9c2e6f97ccac20dc401a89378000"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0zhj7UMv0VWWLV+/x1Bd3iBPHXzu1bYIurbWRR+XKDdNkztdAPmqEpEEwPtA1Fr9zCt4BEX2gHHunvJw8IWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:37:33.759892Z","bundle_sha256":"edb1cfe5afbefedc5a358a50f8e669fc3a830af159ac77adeb7366d97dd9dece"}}