{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U7SOCJ45PNRS5EG3QMOFJ5DDQY","short_pith_number":"pith:U7SOCJ45","canonical_record":{"source":{"id":"1509.00757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T15:52:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6a75e4cc2d5672e4496c999f8ec6642155b9e27815dfb0db86262c0a3bc7704e","abstract_canon_sha256":"c096ff66923613cac8082e648e6831ee1e65f1f8c0b11932a55d33a6aa287476"},"schema_version":"1.0"},"canonical_sha256":"a7e4e1279d7b632e90db831c54f4638605da7efd386859c1610d9fd2d6280969","source":{"kind":"arxiv","id":"1509.00757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00757","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00757v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00757","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"U7SOCJ45PNRS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7SOCJ45PNRS5EG3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7SOCJ45","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U7SOCJ45PNRS5EG3QMOFJ5DDQY","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T15:52:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6a75e4cc2d5672e4496c999f8ec6642155b9e27815dfb0db86262c0a3bc7704e","abstract_canon_sha256":"c096ff66923613cac8082e648e6831ee1e65f1f8c0b11932a55d33a6aa287476"},"schema_version":"1.0"},"canonical_sha256":"a7e4e1279d7b632e90db831c54f4638605da7efd386859c1610d9fd2d6280969","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.133152Z","signature_b64":"4hbODQmSus/bQ6HWhh1a2WUmVFBUDoMonwViJdH2twZ/hJ6HFAtfJncwGLgl9bb0OriyM1ppmKVRpjOUAtybAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e4e1279d7b632e90db831c54f4638605da7efd386859c1610d9fd2d6280969","last_reissued_at":"2026-05-18T01:34:06.132537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.132537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00757","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:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IffZDuTN1BtSYC5m+mdOOpuSDuREQMrzoB+/mylNYI2FMgr5Mk+knTEnKQiN+M5dVoyVkp2kD+aOyDV/RcVtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:48:14.816771Z"},"content_sha256":"44611fe827f2c85b86b14e94784e51b6ed67a7ad555c41ecb8a51e181f0d4e02","schema_version":"1.0","event_id":"sha256:44611fe827f2c85b86b14e94784e51b6ed67a7ad555c41ecb8a51e181f0d4e02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U7SOCJ45PNRS5EG3QMOFJ5DDQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variants of Plane Diameter Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement Requil\\'e, Dimitrios M. Thilikos, Petr A. Golovach","submitted_at":"2015-09-02T15:52:35Z","abstract_excerpt":"The {\\sc Plane Diameter Completion} problem asks, given a plane graph $G$ and a positive integer $d$, if it is a spanning subgraph of a plane graph $H$ that has diameter at most $d$. We examine two variants of this problem where the input comes with another parameter $k$. In the first variant, called BPDC, $k$ upper bounds the total number of edges to be added and in the second, called BFPDC, $k$ upper bounds the number of additional edges per face. We prove that both problems are {\\sf NP}-complete, the first even for 3-connected graphs of face-degree at most 4 and the second even when $k=1$ o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00757","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:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgKZAhjKqTLaqMhh/CJ7XYTItHbWpRrmKldkFlC2sAQJgPoaN7fziNlvYrZBMiV+ToZCZlLycDi5EWB5OG34Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:48:14.817448Z"},"content_sha256":"316b5b97c0000017b7a2e2f18049ee3419b99673ab8fe48622d9be05f2bec956","schema_version":"1.0","event_id":"sha256:316b5b97c0000017b7a2e2f18049ee3419b99673ab8fe48622d9be05f2bec956"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/bundle.json","state_url":"https://pith.science/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/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-06-07T15:48:14Z","links":{"resolver":"https://pith.science/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY","bundle":"https://pith.science/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/bundle.json","state":"https://pith.science/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7SOCJ45PNRS5EG3QMOFJ5DDQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U7SOCJ45PNRS5EG3QMOFJ5DDQY","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":"c096ff66923613cac8082e648e6831ee1e65f1f8c0b11932a55d33a6aa287476","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T15:52:35Z","title_canon_sha256":"6a75e4cc2d5672e4496c999f8ec6642155b9e27815dfb0db86262c0a3bc7704e"},"schema_version":"1.0","source":{"id":"1509.00757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00757","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00757v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00757","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"U7SOCJ45PNRS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7SOCJ45PNRS5EG3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7SOCJ45","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:316b5b97c0000017b7a2e2f18049ee3419b99673ab8fe48622d9be05f2bec956","target":"graph","created_at":"2026-05-18T01:34:06Z","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 {\\sc Plane Diameter Completion} problem asks, given a plane graph $G$ and a positive integer $d$, if it is a spanning subgraph of a plane graph $H$ that has diameter at most $d$. We examine two variants of this problem where the input comes with another parameter $k$. In the first variant, called BPDC, $k$ upper bounds the total number of edges to be added and in the second, called BFPDC, $k$ upper bounds the number of additional edges per face. We prove that both problems are {\\sf NP}-complete, the first even for 3-connected graphs of face-degree at most 4 and the second even when $k=1$ o","authors_text":"Cl\\'ement Requil\\'e, Dimitrios M. Thilikos, Petr A. Golovach","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T15:52:35Z","title":"Variants of Plane Diameter Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00757","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:44611fe827f2c85b86b14e94784e51b6ed67a7ad555c41ecb8a51e181f0d4e02","target":"record","created_at":"2026-05-18T01:34:06Z","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":"c096ff66923613cac8082e648e6831ee1e65f1f8c0b11932a55d33a6aa287476","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T15:52:35Z","title_canon_sha256":"6a75e4cc2d5672e4496c999f8ec6642155b9e27815dfb0db86262c0a3bc7704e"},"schema_version":"1.0","source":{"id":"1509.00757","kind":"arxiv","version":1}},"canonical_sha256":"a7e4e1279d7b632e90db831c54f4638605da7efd386859c1610d9fd2d6280969","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e4e1279d7b632e90db831c54f4638605da7efd386859c1610d9fd2d6280969","first_computed_at":"2026-05-18T01:34:06.132537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:06.132537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hbODQmSus/bQ6HWhh1a2WUmVFBUDoMonwViJdH2twZ/hJ6HFAtfJncwGLgl9bb0OriyM1ppmKVRpjOUAtybAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:06.133152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44611fe827f2c85b86b14e94784e51b6ed67a7ad555c41ecb8a51e181f0d4e02","sha256:316b5b97c0000017b7a2e2f18049ee3419b99673ab8fe48622d9be05f2bec956"],"state_sha256":"422fd98dcb2a191579e9806df52e6faddefba22df56540619dc539758033ae94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6/dlTHzXtqWUgwWt8bTc7OY/ibmKM4g6zbcNemC6KxNW3GYWhJw2TFu6E1EB1uy/Jr30ExX77XgxpyCNUkeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:48:14.820918Z","bundle_sha256":"93ad9ea70c967276bacaea71adf586e8a0fbc7b93c749db6d1d87b1e253a990c"}}