{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZLHTJGSFU2SZWCEF7G775A7B6D","short_pith_number":"pith:ZLHTJGSF","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"},"canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","source":{"kind":"arxiv","id":"1308.1802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1802","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1802v2","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1802","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZLHTJGSFU2SZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZLHTJGSFU2SZWCEF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZLHTJGSF","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZLHTJGSFU2SZWCEF7G775A7B6D","target":"record","payload":{"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"},"canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","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"},"source_kind":"arxiv","source_id":"1308.1802","source_version":2,"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-18T02:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D754TMcqzCG5oWtUMZKq3zLyQAgOlDljro9ID5v/C8+M2hlZnBC6BNaZWtdf9OxrWf6lJDRxb1wmg6r86SN+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:43:55.934403Z"},"content_sha256":"951200044a2010d8095cb44131fbee809f7d34dfc42db2ed74eac68330450d10","schema_version":"1.0","event_id":"sha256:951200044a2010d8095cb44131fbee809f7d34dfc42db2ed74eac68330450d10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZLHTJGSFU2SZWCEF7G775A7B6D","target":"graph","payload":{"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"},"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-18T02:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uizcM/pEBMb9h2uPNiDEBNEnW45PePnVuGP3Y1vuTa3YbZbduuZ50qoNoNB5eqVmbcU3z4ThabXJLd0NkMkIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:43:55.935143Z"},"content_sha256":"1e07cd25a96af0c61b4bc41f7059dbaa688e72ed5b4f396c48eb30fbafe94275","schema_version":"1.0","event_id":"sha256:1e07cd25a96af0c61b4bc41f7059dbaa688e72ed5b4f396c48eb30fbafe94275"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/bundle.json","state_url":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/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-25T14:43:55Z","links":{"resolver":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D","bundle":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/bundle.json","state":"https://pith.science/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLHTJGSFU2SZWCEF7G775A7B6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZLHTJGSFU2SZWCEF7G775A7B6D","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":"8aa1d258ecc9955516538eff77198ca94390ce31033394f5ec91bd4bb4e7a400","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T09:51:02Z","title_canon_sha256":"6018532cf38f8e1367df102f6a7a1f5afa7bb1ea203b09e37b779db2468b0e72"},"schema_version":"1.0","source":{"id":"1308.1802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1802","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1802v2","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1802","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZLHTJGSFU2SZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZLHTJGSFU2SZWCEF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZLHTJGSF","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:1e07cd25a96af0c61b4bc41f7059dbaa688e72ed5b4f396c48eb30fbafe94275","target":"graph","created_at":"2026-05-18T02:50:32Z","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":"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","authors_text":"Petr A. Golovach","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T09:51:02Z","title":"Editing to a Connected Graph of Given Degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1802","kind":"arxiv","version":2},"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:951200044a2010d8095cb44131fbee809f7d34dfc42db2ed74eac68330450d10","target":"record","created_at":"2026-05-18T02:50:32Z","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":"8aa1d258ecc9955516538eff77198ca94390ce31033394f5ec91bd4bb4e7a400","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T09:51:02Z","title_canon_sha256":"6018532cf38f8e1367df102f6a7a1f5afa7bb1ea203b09e37b779db2468b0e72"},"schema_version":"1.0","source":{"id":"1308.1802","kind":"arxiv","version":2}},"canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cacf349a45a6a59b0885f9bffe83e1f0fbec9e8c702336648ff4adfa69547f18","first_computed_at":"2026-05-18T02:50:32.398381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:32.398381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfD1M5MOPkzW/mVigqLNO26JtBM7BKc4hzyu5aCa8VkcWg81iKwsMfwSaiuylkq24sUYsIaTpqUNUrXIP1FiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:32.398880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951200044a2010d8095cb44131fbee809f7d34dfc42db2ed74eac68330450d10","sha256:1e07cd25a96af0c61b4bc41f7059dbaa688e72ed5b4f396c48eb30fbafe94275"],"state_sha256":"2f9c3a9654f91ebae28307a12d80cb5c1ce22bafdf73fa6a9038160a93094dfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLGnQQBgGQufjoCdhceT1CJ5ja6oC3m7eKxsQuTnGgBV6qGNSH+gIaRQ3Ld1wBwJM13yXZac6NSTpbIdEz8FAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:43:55.939386Z","bundle_sha256":"65b4036db1f12c5b45abc1842d5dc3301717e7cd82d67281cd5bab204a1166c1"}}