{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JL6AOINC223CHUPWMXXLJCXQTD","short_pith_number":"pith:JL6AOINC","schema_version":"1.0","canonical_sha256":"4afc0721a2d6b623d1f665eeb48af098d17a09714417c9d013e8e5e970f03c2a","source":{"kind":"arxiv","id":"1606.03268","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03268","created_at":"2026-05-18T01:12:37.243232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03268v1","created_at":"2026-05-18T01:12:37.243232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03268","created_at":"2026-05-18T01:12:37.243232+00:00"},{"alias_kind":"pith_short_12","alias_value":"JL6AOINC223C","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JL6AOINC223CHUPW","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JL6AOINC","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD","json":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD.json","graph_json":"https://pith.science/api/pith-number/JL6AOINC223CHUPWMXXLJCXQTD/graph.json","events_json":"https://pith.science/api/pith-number/JL6AOINC223CHUPWMXXLJCXQTD/events.json","paper":"https://pith.science/paper/JL6AOINC"},"agent_actions":{"view_html":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD","download_json":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD.json","view_paper":"https://pith.science/paper/JL6AOINC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03268&json=true","fetch_graph":"https://pith.science/api/pith-number/JL6AOINC223CHUPWMXXLJCXQTD/graph.json","fetch_events":"https://pith.science/api/pith-number/JL6AOINC223CHUPWMXXLJCXQTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/action/storage_attestation","attest_author":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/action/author_attestation","sign_citation":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/action/citation_signature","submit_replication":"https://pith.science/pith/JL6AOINC223CHUPWMXXLJCXQTD/action/replication_record"}},"created_at":"2026-05-18T01:12:37.243232+00:00","updated_at":"2026-05-18T01:12:37.243232+00:00"}