{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZLHTJGSFU2SZWCEF7G775A7B6D","short_pith_number":"pith:ZLHTJGSF","schema_version":"1.0","canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","source":{"kind":"arxiv","id":"1308.1802","version":2},"attestation_state":"computed","paper":{"title":"Editing to a Connected Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Petr A. Golovach","submitted_at":"2013-08-08T09:51:02Z","abstract_excerpt":"The aim of edge editing or modification problems is to change a given graph by adding and deleting of a small number of edges in order to satisfy a certain property. We consider the Edge Editing to a Connected 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 connected graph G' from G such that the degree of v is \\delta(v) for any vertex v by at most k edge editing operations. As the problem is NP-complete even if \\delta(v)=2, we are interested in the parameterized complexity and show that"},"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":"1308.1802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T09:51:02Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6018532cf38f8e1367df102f6a7a1f5afa7bb1ea203b09e37b779db2468b0e72","abstract_canon_sha256":"8aa1d258ecc9955516538eff77198ca94390ce31033394f5ec91bd4bb4e7a400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:32.398880Z","signature_b64":"VfD1M5MOPkzW/mVigqLNO26JtBM7BKc4hzyu5aCa8VkcWg81iKwsMfwSaiuylkq24sUYsIaTpqUNUrXIP1FiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","last_reissued_at":"2026-05-18T02:50:32.398381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:32.398381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Editing to a Connected Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Petr A. Golovach","submitted_at":"2013-08-08T09:51:02Z","abstract_excerpt":"The aim of edge editing or modification problems is to change a given graph by adding and deleting of a small number of edges in order to satisfy a certain property. We consider the Edge Editing to a Connected 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 connected graph G' from G such that the degree of v is \\delta(v) for any vertex v by at most k edge editing operations. As the problem is NP-complete even if \\delta(v)=2, we are interested in the parameterized complexity and show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1802","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":"1308.1802","created_at":"2026-05-18T02:50:32.398456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1802v2","created_at":"2026-05-18T02:50:32.398456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1802","created_at":"2026-05-18T02:50:32.398456+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLHTJGSFU2SZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLHTJGSFU2SZWCEF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLHTJGSF","created_at":"2026-05-18T12:28:09.283467+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/ZLHTJGSFU2SZWCEF7G775A7B6D","json":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D.json","graph_json":"https://pith.science/api/pith-number/ZLHTJGSFU2SZWCEF7G775A7B6D/graph.json","events_json":"https://pith.science/api/pith-number/ZLHTJGSFU2SZWCEF7G775A7B6D/events.json","paper":"https://pith.science/paper/ZLHTJGSF"},"agent_actions":{"view_html":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D","download_json":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D.json","view_paper":"https://pith.science/paper/ZLHTJGSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1802&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLHTJGSFU2SZWCEF7G775A7B6D/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLHTJGSFU2SZWCEF7G775A7B6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/action/storage_attestation","attest_author":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/action/author_attestation","sign_citation":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/action/citation_signature","submit_replication":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/action/replication_record"}},"created_at":"2026-05-18T02:50:32.398456+00:00","updated_at":"2026-05-18T02:50:32.398456+00:00"}