{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JL6AOINC223CHUPWMXXLJCXQTD","short_pith_number":"pith:JL6AOINC","canonical_record":{"source":{"id":"1606.03268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-10T10:50:28Z","cross_cats_sorted":[],"title_canon_sha256":"3cfc4e73d142706a24e1b3597c9038baf08435364cc35aeccad13ac77c5da1f8","abstract_canon_sha256":"811a2a1cae13e8445ef78b4f5f30d98a1031a48d93d39c4fc3bb798ba7452372"},"schema_version":"1.0"},"canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","source":{"kind":"arxiv","id":"1606.03268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03268","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03268v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03268","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"JL6AOINC223C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JL6AOINC223CHUPW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JL6AOINC","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JL6AOINC223CHUPWMXXLJCXQTD","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-10T10:50:28Z","cross_cats_sorted":[],"title_canon_sha256":"3cfc4e73d142706a24e1b3597c9038baf08435364cc35aeccad13ac77c5da1f8","abstract_canon_sha256":"811a2a1cae13e8445ef78b4f5f30d98a1031a48d93d39c4fc3bb798ba7452372"},"schema_version":"1.0"},"canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.243653Z","signature_b64":"69z6lU+Q0RDQpS3Xb1TU5aUpcqQAAgiF9oi23EIZQ8iKHcDGs3aetyUSzCyid/s6P6L3U+SH9W0MqalFZdVKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","last_reissued_at":"2026-05-18T01:12:37.243160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.243160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03268","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-05-18T01:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfUpwpkhHEnJxUy5ldx+vvt/QNv5NaTOZy/Yy5HoFYsH6/jJP0DDahuIyWBeEJSDAqrFpVTlgucN6rzBKDtNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:13.693342Z"},"content_sha256":"bf785ddd400752cda8087a3d994470830ae8df134013410430f11341d1d501f6","schema_version":"1.0","event_id":"sha256:bf785ddd400752cda8087a3d994470830ae8df134013410430f11341d1d501f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JL6AOINC223CHUPWMXXLJCXQTD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Rolf Niedermeier","submitted_at":"2016-06-10T10:50:28Z","abstract_excerpt":"In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03268","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":""},"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-05-18T01:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wfXNjYWWeVxe8d4TZbtHcETaDQta8ifbsqTHpvDnIaWL6E0xOQiMwpKZ2/puQuTPYvcAHlxpj+jkETGuZ+FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:13.693698Z"},"content_sha256":"6384bc21353793801d4766f976038da4b5261cdb6c5f190f08edabf6fa4ccfb3","schema_version":"1.0","event_id":"sha256:6384bc21353793801d4766f976038da4b5261cdb6c5f190f08edabf6fa4ccfb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/bundle.json","state_url":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JL6AOINC223CHUPWMXXLJCXQTD/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-05-31T08:45:13Z","links":{"resolver":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD","bundle":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/bundle.json","state":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JL6AOINC223CHUPWMXXLJCXQTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JL6AOINC223CHUPWMXXLJCXQTD","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":"811a2a1cae13e8445ef78b4f5f30d98a1031a48d93d39c4fc3bb798ba7452372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-10T10:50:28Z","title_canon_sha256":"3cfc4e73d142706a24e1b3597c9038baf08435364cc35aeccad13ac77c5da1f8"},"schema_version":"1.0","source":{"id":"1606.03268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03268","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03268v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03268","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"JL6AOINC223C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JL6AOINC223CHUPW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JL6AOINC","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:6384bc21353793801d4766f976038da4b5261cdb6c5f190f08edabf6fa4ccfb3","target":"graph","created_at":"2026-05-18T01:12:37Z","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"},"paper":{"abstract_excerpt":"In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies. We ","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-10T10:50:28Z","title":"Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03268","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:bf785ddd400752cda8087a3d994470830ae8df134013410430f11341d1d501f6","target":"record","created_at":"2026-05-18T01:12:37Z","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":"811a2a1cae13e8445ef78b4f5f30d98a1031a48d93d39c4fc3bb798ba7452372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-10T10:50:28Z","title_canon_sha256":"3cfc4e73d142706a24e1b3597c9038baf08435364cc35aeccad13ac77c5da1f8"},"schema_version":"1.0","source":{"id":"1606.03268","kind":"arxiv","version":1}},"canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","first_computed_at":"2026-05-18T01:12:37.243160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:37.243160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"69z6lU+Q0RDQpS3Xb1TU5aUpcqQAAgiF9oi23EIZQ8iKHcDGs3aetyUSzCyid/s6P6L3U+SH9W0MqalFZdVKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:37.243653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf785ddd400752cda8087a3d994470830ae8df134013410430f11341d1d501f6","sha256:6384bc21353793801d4766f976038da4b5261cdb6c5f190f08edabf6fa4ccfb3"],"state_sha256":"9ca6288773ec30c0f7c6a6ac76f88a16af6b5680ea5ebaddf01ac0d2385af46b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWa2TLWhe/7nZdMKsaFoWGmmfe5nDyUy1L0M8XLnwW4LBpyROoOgY50WkupseFLym83LtWPC3clso2120EpAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:45:13.695659Z","bundle_sha256":"bfea778f47cb32074224b62130cfd447d1703c264be0d1b750a521de7752aa09"}}