{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:37NN3XK6S7DEDSHYNPBNNFOUR2","short_pith_number":"pith:37NN3XK6","schema_version":"1.0","canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","source":{"kind":"arxiv","id":"1508.02773","version":1},"attestation_state":"computed","paper":{"title":"Editing to a Planar Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof","submitted_at":"2015-08-11T23:30:20Z","abstract_excerpt":"We consider the following graph modification problem. Let the input consist of a graph $G=(V,E)$, a weight function $w\\colon V\\cup E\\rightarrow \\mathbb{N}$, a cost function $c\\colon V\\cup E\\rightarrow \\mathbb{N}$ and a degree function $\\delta\\colon V\\rightarrow \\mathbb{N}_0$, together with three integers $k_v, k_e$ and $C$. The question is whether we can delete a set of vertices of total weight at most $k_v$ and a set of edges of total weight at most $k_e$ so that the total cost of the deleted elements is at most $C$ and every non-deleted vertex $v$ has degree $\\delta(v)$ in the resulting grap"},"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":"1508.02773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T23:30:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ed362a164175628e53b4c91d8b723c82ef9164cacb30143226f2b2d71cfba31a","abstract_canon_sha256":"0791be6bfcb4c5edf967273f37eeb4988d4c81e7c004aae669d8cc9ebc53713f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:26.212338Z","signature_b64":"tj4tcrOPbMRcKDYESllNbT5RbwWxoaxdxHBxbZwZByQP84OaCWPT8EYxN7x8B6wRC8jtJu9BylZWFlB4MrowDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","last_reissued_at":"2026-05-18T01:35:26.211712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:26.211712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Editing to a Planar Graph of Given Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof","submitted_at":"2015-08-11T23:30:20Z","abstract_excerpt":"We consider the following graph modification problem. Let the input consist of a graph $G=(V,E)$, a weight function $w\\colon V\\cup E\\rightarrow \\mathbb{N}$, a cost function $c\\colon V\\cup E\\rightarrow \\mathbb{N}$ and a degree function $\\delta\\colon V\\rightarrow \\mathbb{N}_0$, together with three integers $k_v, k_e$ and $C$. The question is whether we can delete a set of vertices of total weight at most $k_v$ and a set of edges of total weight at most $k_e$ so that the total cost of the deleted elements is at most $C$ and every non-deleted vertex $v$ has degree $\\delta(v)$ in the resulting grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02773","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":"1508.02773","created_at":"2026-05-18T01:35:26.211789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02773v1","created_at":"2026-05-18T01:35:26.211789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02773","created_at":"2026-05-18T01:35:26.211789+00:00"},{"alias_kind":"pith_short_12","alias_value":"37NN3XK6S7DE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"37NN3XK6S7DEDSHY","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"37NN3XK6","created_at":"2026-05-18T12:29:02.477457+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/37NN3XK6S7DEDSHYNPBNNFOUR2","json":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2.json","graph_json":"https://pith.science/api/pith-number/37NN3XK6S7DEDSHYNPBNNFOUR2/graph.json","events_json":"https://pith.science/api/pith-number/37NN3XK6S7DEDSHYNPBNNFOUR2/events.json","paper":"https://pith.science/paper/37NN3XK6"},"agent_actions":{"view_html":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2","download_json":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2.json","view_paper":"https://pith.science/paper/37NN3XK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02773&json=true","fetch_graph":"https://pith.science/api/pith-number/37NN3XK6S7DEDSHYNPBNNFOUR2/graph.json","fetch_events":"https://pith.science/api/pith-number/37NN3XK6S7DEDSHYNPBNNFOUR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/action/storage_attestation","attest_author":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/action/author_attestation","sign_citation":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/action/citation_signature","submit_replication":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/action/replication_record"}},"created_at":"2026-05-18T01:35:26.211789+00:00","updated_at":"2026-05-18T01:35:26.211789+00:00"}