{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:37NN3XK6S7DEDSHYNPBNNFOUR2","short_pith_number":"pith:37NN3XK6","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"},"canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","source":{"kind":"arxiv","id":"1508.02773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02773","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02773v1","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02773","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"pith_short_12","alias_value":"37NN3XK6S7DE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"37NN3XK6S7DEDSHY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"37NN3XK6","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:37NN3XK6S7DEDSHYNPBNNFOUR2","target":"record","payload":{"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"},"canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","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"},"source_kind":"arxiv","source_id":"1508.02773","source_version":1,"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-18T01:35:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grEIo/3kmi4s67XoQYL8ilrjRRiqAKWnkHt7k0gbGXzqx5vimTnq5qU4I6jho46269a73Vkf1355tksjH1VcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:59.880082Z"},"content_sha256":"f86c76d48fe24c3d942ab6c1158b5cb775a58fe959f9ee98219f2dd346f4a573","schema_version":"1.0","event_id":"sha256:f86c76d48fe24c3d942ab6c1158b5cb775a58fe959f9ee98219f2dd346f4a573"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:37NN3XK6S7DEDSHYNPBNNFOUR2","target":"graph","payload":{"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"},"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-18T01:35:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGg9jwlnJ3uFCP8qfRk08vKp0mLRoaQPxXI1PmSA+kefrH9DjsmyOhXRQBI8LHdZjJiGdar/hyKiPR72nHRsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:59.880809Z"},"content_sha256":"7ea0913582a48c830bd6b8d9c03af3eea65e9c23f33c4d56b440aa77a6f7ed47","schema_version":"1.0","event_id":"sha256:7ea0913582a48c830bd6b8d9c03af3eea65e9c23f33c4d56b440aa77a6f7ed47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/bundle.json","state_url":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/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-25T17:40:59Z","links":{"resolver":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2","bundle":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/bundle.json","state":"https://pith.science/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37NN3XK6S7DEDSHYNPBNNFOUR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:37NN3XK6S7DEDSHYNPBNNFOUR2","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":"0791be6bfcb4c5edf967273f37eeb4988d4c81e7c004aae669d8cc9ebc53713f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T23:30:20Z","title_canon_sha256":"ed362a164175628e53b4c91d8b723c82ef9164cacb30143226f2b2d71cfba31a"},"schema_version":"1.0","source":{"id":"1508.02773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02773","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02773v1","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02773","created_at":"2026-05-18T01:35:26Z"},{"alias_kind":"pith_short_12","alias_value":"37NN3XK6S7DE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"37NN3XK6S7DEDSHY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"37NN3XK6","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:7ea0913582a48c830bd6b8d9c03af3eea65e9c23f33c4d56b440aa77a6f7ed47","target":"graph","created_at":"2026-05-18T01:35:26Z","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 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","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T23:30:20Z","title":"Editing to a Planar Graph of Given Degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02773","kind":"arxiv","version":1},"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:f86c76d48fe24c3d942ab6c1158b5cb775a58fe959f9ee98219f2dd346f4a573","target":"record","created_at":"2026-05-18T01:35:26Z","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":"0791be6bfcb4c5edf967273f37eeb4988d4c81e7c004aae669d8cc9ebc53713f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T23:30:20Z","title_canon_sha256":"ed362a164175628e53b4c91d8b723c82ef9164cacb30143226f2b2d71cfba31a"},"schema_version":"1.0","source":{"id":"1508.02773","kind":"arxiv","version":1}},"canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfdadddd5e97c641c8f86bc2d695d48e9dfdb7cded366001688372cb9bcfd4c8","first_computed_at":"2026-05-18T01:35:26.211712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:26.211712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tj4tcrOPbMRcKDYESllNbT5RbwWxoaxdxHBxbZwZByQP84OaCWPT8EYxN7x8B6wRC8jtJu9BylZWFlB4MrowDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:26.212338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86c76d48fe24c3d942ab6c1158b5cb775a58fe959f9ee98219f2dd346f4a573","sha256:7ea0913582a48c830bd6b8d9c03af3eea65e9c23f33c4d56b440aa77a6f7ed47"],"state_sha256":"b69a0c18587c9e48c48af62225dbb30fafa2c94853ad9bf6c8f90bc1f92f6c2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4JMu2hTc/cmPibLZBSa4qaHdmmn3b1nKYGhMriL10PPa8UvLmMLQIMSgy79QRx9nlYV5fMWzfYRR/dlUCHEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:40:59.884484Z","bundle_sha256":"79cbf79fb8bee759b1f75627c4546dc589cf7588094c44844e14e321737cec76"}}