{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4IAZ5CJZCGECPNLPTNMHF33IC3","short_pith_number":"pith:4IAZ5CJZ","canonical_record":{"source":{"id":"2006.14972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-26T13:16:46Z","cross_cats_sorted":[],"title_canon_sha256":"4207b55caf52d92f942f2aea9da58f9785280a6146f5cfa8bb945765231120cd","abstract_canon_sha256":"da3e51746f464fdbe764e488940b2879a84be9a76fabed39001f12281f85eea9"},"schema_version":"1.0"},"canonical_sha256":"e2019e8939118827b56f9b5872ef6816e539f2325bd1d942d24af9af35f0f212","source":{"kind":"arxiv","id":"2006.14972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14972","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14972v1","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14972","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"4IAZ5CJZCGEC","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_16","alias_value":"4IAZ5CJZCGECPNLP","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_8","alias_value":"4IAZ5CJZ","created_at":"2026-07-05T01:13:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4IAZ5CJZCGECPNLPTNMHF33IC3","target":"record","payload":{"canonical_record":{"source":{"id":"2006.14972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-26T13:16:46Z","cross_cats_sorted":[],"title_canon_sha256":"4207b55caf52d92f942f2aea9da58f9785280a6146f5cfa8bb945765231120cd","abstract_canon_sha256":"da3e51746f464fdbe764e488940b2879a84be9a76fabed39001f12281f85eea9"},"schema_version":"1.0"},"canonical_sha256":"e2019e8939118827b56f9b5872ef6816e539f2325bd1d942d24af9af35f0f212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:48.596571Z","signature_b64":"CEMmoh0mr70gPim1VbmVCa510RRTkmNkrDLYlNiZVyscmiDwEn0+/P1z8Fpo3rT/vtE1CW0z+GtRDMrapb+MDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2019e8939118827b56f9b5872ef6816e539f2325bd1d942d24af9af35f0f212","last_reissued_at":"2026-07-05T01:13:48.596061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:48.596061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.14972","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-05T01:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkqYDk2CWZZyk3FJvlmK811gpQHAgfeOxgIb0Lig5SHCGOYIJtqTeGCEy9Q8GENfIPftGceyeB3GDQO9PX/OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:11:55.274251Z"},"content_sha256":"aab171a4c440fb93ce524c633d9d7d5fe4f6f64fb384c6372b91cbc905865224","schema_version":"1.0","event_id":"sha256:aab171a4c440fb93ce524c633d9d7d5fe4f6f64fb384c6372b91cbc905865224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4IAZ5CJZCGECPNLPTNMHF33IC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Figiel, Andr\\'e Nichterlein, Anne-Sophie Himmel, Rolf Niedermeier","submitted_at":"2020-06-26T13:16:46Z","abstract_excerpt":"Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of diameter two. This naturally leads to the two NP-hard problems 2-Club Cluster Editing (the allowed editing operations are edge insertion and edge deletion) and 2-Club Cluster Vertex Deletion (the allowed editing operations are vertex deletions). Answering an open question from the literature, we show that 2-Club Cluster Editing is W[2]-hard with re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14972","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/2006.14972/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-05T01:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2xx8GvUF9lJTTPPryV6ZFvKiXh+c/ayZbD0B6WyRwRrO8mlQJrv7+rcohqKQ5qKZwSGK1sb27m1D3HPjMmZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:11:55.274642Z"},"content_sha256":"1812ac2b4dc56ce376af2b0bc75affb842f92ec54f58b2a77f206b64b4f1193a","schema_version":"1.0","event_id":"sha256:1812ac2b4dc56ce376af2b0bc75affb842f92ec54f58b2a77f206b64b4f1193a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/bundle.json","state_url":"https://pith.science/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/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-07T13:11:55Z","links":{"resolver":"https://pith.science/pith/4IAZ5CJZCGECPNLPTNMHF33IC3","bundle":"https://pith.science/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/bundle.json","state":"https://pith.science/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IAZ5CJZCGECPNLPTNMHF33IC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4IAZ5CJZCGECPNLPTNMHF33IC3","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":"da3e51746f464fdbe764e488940b2879a84be9a76fabed39001f12281f85eea9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-26T13:16:46Z","title_canon_sha256":"4207b55caf52d92f942f2aea9da58f9785280a6146f5cfa8bb945765231120cd"},"schema_version":"1.0","source":{"id":"2006.14972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14972","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14972v1","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14972","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"4IAZ5CJZCGEC","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_16","alias_value":"4IAZ5CJZCGECPNLP","created_at":"2026-07-05T01:13:48Z"},{"alias_kind":"pith_short_8","alias_value":"4IAZ5CJZ","created_at":"2026-07-05T01:13:48Z"}],"graph_snapshots":[{"event_id":"sha256:1812ac2b4dc56ce376af2b0bc75affb842f92ec54f58b2a77f206b64b4f1193a","target":"graph","created_at":"2026-07-05T01:13:48Z","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/2006.14972/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of diameter two. This naturally leads to the two NP-hard problems 2-Club Cluster Editing (the allowed editing operations are edge insertion and edge deletion) and 2-Club Cluster Vertex Deletion (the allowed editing operations are vertex deletions). Answering an open question from the literature, we show that 2-Club Cluster Editing is W[2]-hard with re","authors_text":"Aleksander Figiel, Andr\\'e Nichterlein, Anne-Sophie Himmel, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-26T13:16:46Z","title":"On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14972","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:aab171a4c440fb93ce524c633d9d7d5fe4f6f64fb384c6372b91cbc905865224","target":"record","created_at":"2026-07-05T01:13:48Z","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":"da3e51746f464fdbe764e488940b2879a84be9a76fabed39001f12281f85eea9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-26T13:16:46Z","title_canon_sha256":"4207b55caf52d92f942f2aea9da58f9785280a6146f5cfa8bb945765231120cd"},"schema_version":"1.0","source":{"id":"2006.14972","kind":"arxiv","version":1}},"canonical_sha256":"e2019e8939118827b56f9b5872ef6816e539f2325bd1d942d24af9af35f0f212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2019e8939118827b56f9b5872ef6816e539f2325bd1d942d24af9af35f0f212","first_computed_at":"2026-07-05T01:13:48.596061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:48.596061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CEMmoh0mr70gPim1VbmVCa510RRTkmNkrDLYlNiZVyscmiDwEn0+/P1z8Fpo3rT/vtE1CW0z+GtRDMrapb+MDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:48.596571Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.14972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab171a4c440fb93ce524c633d9d7d5fe4f6f64fb384c6372b91cbc905865224","sha256:1812ac2b4dc56ce376af2b0bc75affb842f92ec54f58b2a77f206b64b4f1193a"],"state_sha256":"6801cc421df890708d955e47d87f47b8f65217f0fd49007f0a86385f4c97c947"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDepZptUOBxo0SuPH0lsJ/T6Y3IwbQ7mPtOII3CvP/x2RoPOxzF+UuD+URe7GPOlv10hyQ8Xs6L+kAvm4vrVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:11:55.276527Z","bundle_sha256":"7988354addbd8e5ec0e279a84733030a13a04f18e1c6a2a8566bae31f98f804c"}}