{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:327XHJHYAIWEFZS66OGHEDMRCZ","short_pith_number":"pith:327XHJHY","schema_version":"1.0","canonical_sha256":"debf73a4f8022c42e65ef38c720d911650798ac2fda777c7c5d5db71f43c3413","source":{"kind":"arxiv","id":"1311.4768","version":2},"attestation_state":"computed","paper":{"title":"Editing to a Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Petr A. Golovach","submitted_at":"2013-11-19T15:06:44Z","abstract_excerpt":"We consider the Editing to a Graph of Given Degrees problem that asks for a graph G, non-negative integers d,k and a function \\delta:V(G)->{1,...,d}, whether it is possible to obtain a graph G' from G such that the degree of v is \\delta(v) for any vertex v by at most k vertex or edge deletions or edge additions. We construct an FPT-algorithm for Editing to a Graph of Given Degrees parameterized by d+k. We complement this result by showing that the problem has no polynomial kernel unless NP\\subseteq coNP/poly."},"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":"1311.4768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T15:06:44Z","cross_cats_sorted":[],"title_canon_sha256":"29910dd56a695b15953b4dbfa332453a674113ba5da0f845398656023700d4b2","abstract_canon_sha256":"ace91bc19af704c4a8f76bcfb7e9abc29c8f5e1fdc098b9a12f02070b23d85d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:40.478254Z","signature_b64":"ew3lMaW/x3kMmU7MkJLmCUvazuZ2NY2FKGv9KQBxXno0dtEIdiKoIEtUnde2Uu+56wDBErDJ/sCBQWmxR/ATDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debf73a4f8022c42e65ef38c720d911650798ac2fda777c7c5d5db71f43c3413","last_reissued_at":"2026-05-18T02:30:40.477832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:40.477832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Editing to a Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Petr A. Golovach","submitted_at":"2013-11-19T15:06:44Z","abstract_excerpt":"We consider the Editing to a Graph of Given Degrees problem that asks for a graph G, non-negative integers d,k and a function \\delta:V(G)->{1,...,d}, whether it is possible to obtain a graph G' from G such that the degree of v is \\delta(v) for any vertex v by at most k vertex or edge deletions or edge additions. We construct an FPT-algorithm for Editing to a Graph of Given Degrees parameterized by d+k. We complement this result by showing that the problem has no polynomial kernel unless NP\\subseteq coNP/poly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4768","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":""},"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":"1311.4768","created_at":"2026-05-18T02:30:40.477898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4768v2","created_at":"2026-05-18T02:30:40.477898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4768","created_at":"2026-05-18T02:30:40.477898+00:00"},{"alias_kind":"pith_short_12","alias_value":"327XHJHYAIWE","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"327XHJHYAIWEFZS6","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"327XHJHY","created_at":"2026-05-18T12:27:32.513160+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/327XHJHYAIWEFZS66OGHEDMRCZ","json":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ.json","graph_json":"https://pith.science/api/pith-number/327XHJHYAIWEFZS66OGHEDMRCZ/graph.json","events_json":"https://pith.science/api/pith-number/327XHJHYAIWEFZS66OGHEDMRCZ/events.json","paper":"https://pith.science/paper/327XHJHY"},"agent_actions":{"view_html":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ","download_json":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ.json","view_paper":"https://pith.science/paper/327XHJHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4768&json=true","fetch_graph":"https://pith.science/api/pith-number/327XHJHYAIWEFZS66OGHEDMRCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/327XHJHYAIWEFZS66OGHEDMRCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ/action/storage_attestation","attest_author":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ/action/author_attestation","sign_citation":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ/action/citation_signature","submit_replication":"https://pith.science/pith/327XHJHYAIWEFZS66OGHEDMRCZ/action/replication_record"}},"created_at":"2026-05-18T02:30:40.477898+00:00","updated_at":"2026-05-18T02:30:40.477898+00:00"}