{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BCWCISHLFQ3YXDFS44HCH444QZ","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":"1ddf9c1e02fc725121fcef3f9a0eb1b759026d03f16cd41ad0b409a524de8655","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-22T09:23:51Z","title_canon_sha256":"380adb7291b611ef44586d9db554d55f9b76c23cdd3de250645603a40d94b0f6"},"schema_version":"1.0","source":{"id":"1404.5432","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5432","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5432v3","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5432","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"BCWCISHLFQ3Y","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BCWCISHLFQ3YXDFS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BCWCISHL","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:a763c6bd03b29a05923906bceed3e7754402dbdf1754a2fbd0d1e526f478d468","target":"graph","created_at":"2026-05-18T01:17:20Z","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":"We study provably effective and efficient data reduction for a class of NP-hard graph modification problems based on vertex degree properties. We show fixed-parameter tractability for NP-hard graph completion (that is, edge addition) cases while we show that there is no hope to achieve analogous results for the corresponding vertex or edge deletion versions. Our algorithms are based on transforming graph completion problems into efficiently solvable number problems and exploiting f-factor computations for translating the results back into the graph setting. Our core observation is that we enco","authors_text":"Andr\\'e Nichterlein, Rolf Niedermeier, Vincent Froese","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-22T09:23:51Z","title":"Win-Win Kernelization for Degree Sequence Completion Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5432","kind":"arxiv","version":3},"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:1dbf727358e327b34e3c7e7f5f35419fa19b91ac039e4fa0d9774865c205e019","target":"record","created_at":"2026-05-18T01:17:20Z","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":"1ddf9c1e02fc725121fcef3f9a0eb1b759026d03f16cd41ad0b409a524de8655","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-22T09:23:51Z","title_canon_sha256":"380adb7291b611ef44586d9db554d55f9b76c23cdd3de250645603a40d94b0f6"},"schema_version":"1.0","source":{"id":"1404.5432","kind":"arxiv","version":3}},"canonical_sha256":"08ac2448eb2c378b8cb2e70e23f39c865fab181cf0d41cf42b4d75c38e82b1dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08ac2448eb2c378b8cb2e70e23f39c865fab181cf0d41cf42b4d75c38e82b1dd","first_computed_at":"2026-05-18T01:17:20.905717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:20.905717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZ+RGGzaCvX3z6U0Bs2E8q2V6tyAlnOde2CJhUZ3cIHSdUbB4R5njBbg0ULPtPGCq3ilR6O7JljtzTU2HdVKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:20.906196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5432","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dbf727358e327b34e3c7e7f5f35419fa19b91ac039e4fa0d9774865c205e019","sha256:a763c6bd03b29a05923906bceed3e7754402dbdf1754a2fbd0d1e526f478d468"],"state_sha256":"39a669bb0c640093281f9bf16eda64a6a7c6f5ca68803df8c3b1d100eb07f1bc"}