{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4IVC7KIFGNMSHU6AGRPYFWIRHU","short_pith_number":"pith:4IVC7KIF","canonical_record":{"source":{"id":"1403.5702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-22T21:01:37Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7e35d312aaa6401df403e2adea226ff18bc3b4a6b42c97df3ba32e9a1294ab3e","abstract_canon_sha256":"873fff34c53bb67a9812a212dcd7fd5a7d785fd24dd8e51628fe46fa9271237e"},"schema_version":"1.0"},"canonical_sha256":"e22a2fa905335923d3c0345f82d9113d13719390a63143779f88d585bea3ede1","source":{"kind":"arxiv","id":"1403.5702","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5702","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5702v3","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5702","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"4IVC7KIFGNMS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4IVC7KIFGNMSHU6A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4IVC7KIF","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4IVC7KIFGNMSHU6AGRPYFWIRHU","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-22T21:01:37Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7e35d312aaa6401df403e2adea226ff18bc3b4a6b42c97df3ba32e9a1294ab3e","abstract_canon_sha256":"873fff34c53bb67a9812a212dcd7fd5a7d785fd24dd8e51628fe46fa9271237e"},"schema_version":"1.0"},"canonical_sha256":"e22a2fa905335923d3c0345f82d9113d13719390a63143779f88d585bea3ede1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.721829Z","signature_b64":"7BwFpJwczJr4xqRLHtzuIKM+jiH2OUGgYjmB8M7mFmjuz4M4FMuJDlnRNZda9weDTsiFJBlHmrlunfsKQNvtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22a2fa905335923d3c0345f82d9113d13719390a63143779f88d585bea3ede1","last_reissued_at":"2026-05-18T02:51:14.721391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.721391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5702","source_version":3,"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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdjKPBPZ0PVyG3LTe2eNHdS35EFeVFirpOz2cmzDQfTazfqLfr9TqlKcAdVlC7k2Z92424yowmesw/JljpeSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:59.297707Z"},"content_sha256":"025c14debfe41f96f00ee62c17eb883147a93d9b5d8814908d0a12fd470a6e61","schema_version":"1.0","event_id":"sha256:025c14debfe41f96f00ee62c17eb883147a93d9b5d8814908d0a12fd470a6e61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4IVC7KIFGNMSHU6AGRPYFWIRHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-time Algorithm for Outerplanar Diameter Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Daniel Gon\\c{c}alves, Dimitrios M. Thilikos, Eun Jung Kim, Ignasi Sau, Mathias Weller, Nathann Cohen","submitted_at":"2014-03-22T21:01:37Z","abstract_excerpt":"The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$. We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues to the celebrated and challenging Planar Diameter Improvement problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is open."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5702","kind":"arxiv","version":3},"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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUgiHiT7WGlTF3zsyQXIJrQydZmleioRWSZdYoeYH2RJ1j45NzIowGYsP0jpVjBOSjk01XiELxFm+2BVZ83KBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:59.298247Z"},"content_sha256":"888346e33f98bfe9bbbffffd0e38e4d28e86860286f7a061344e78b68781d675","schema_version":"1.0","event_id":"sha256:888346e33f98bfe9bbbffffd0e38e4d28e86860286f7a061344e78b68781d675"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/bundle.json","state_url":"https://pith.science/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/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-25T19:36:59Z","links":{"resolver":"https://pith.science/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU","bundle":"https://pith.science/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/bundle.json","state":"https://pith.science/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IVC7KIFGNMSHU6AGRPYFWIRHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4IVC7KIFGNMSHU6AGRPYFWIRHU","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":"873fff34c53bb67a9812a212dcd7fd5a7d785fd24dd8e51628fe46fa9271237e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-22T21:01:37Z","title_canon_sha256":"7e35d312aaa6401df403e2adea226ff18bc3b4a6b42c97df3ba32e9a1294ab3e"},"schema_version":"1.0","source":{"id":"1403.5702","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5702","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5702v3","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5702","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"4IVC7KIFGNMS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4IVC7KIFGNMSHU6A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4IVC7KIF","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:888346e33f98bfe9bbbffffd0e38e4d28e86860286f7a061344e78b68781d675","target":"graph","created_at":"2026-05-18T02:51:14Z","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 Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$. We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues to the celebrated and challenging Planar Diameter Improvement problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is open.","authors_text":"Christophe Paul, Daniel Gon\\c{c}alves, Dimitrios M. Thilikos, Eun Jung Kim, Ignasi Sau, Mathias Weller, Nathann Cohen","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-22T21:01:37Z","title":"A Polynomial-time Algorithm for Outerplanar Diameter Improvement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5702","kind":"arxiv","version":3},"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:025c14debfe41f96f00ee62c17eb883147a93d9b5d8814908d0a12fd470a6e61","target":"record","created_at":"2026-05-18T02:51:14Z","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":"873fff34c53bb67a9812a212dcd7fd5a7d785fd24dd8e51628fe46fa9271237e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-22T21:01:37Z","title_canon_sha256":"7e35d312aaa6401df403e2adea226ff18bc3b4a6b42c97df3ba32e9a1294ab3e"},"schema_version":"1.0","source":{"id":"1403.5702","kind":"arxiv","version":3}},"canonical_sha256":"e22a2fa905335923d3c0345f82d9113d13719390a63143779f88d585bea3ede1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e22a2fa905335923d3c0345f82d9113d13719390a63143779f88d585bea3ede1","first_computed_at":"2026-05-18T02:51:14.721391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:14.721391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7BwFpJwczJr4xqRLHtzuIKM+jiH2OUGgYjmB8M7mFmjuz4M4FMuJDlnRNZda9weDTsiFJBlHmrlunfsKQNvtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:14.721829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5702","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:025c14debfe41f96f00ee62c17eb883147a93d9b5d8814908d0a12fd470a6e61","sha256:888346e33f98bfe9bbbffffd0e38e4d28e86860286f7a061344e78b68781d675"],"state_sha256":"96e505ab17f99990d5d5113d6bceda3f4450a9803263c26c7bc73eb7019b281e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uxw5agcAkEJ2tGIp6/7g4l9LBufgQ7e/PfjIN1iyRK4+je8di65NXF3USVgnG3CVq3+83mILnOgSZpv+nx4SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:36:59.300738Z","bundle_sha256":"2b8994e08fb85acdae46a8beaf55bcf57b2e619f712b8a7372187709a1e0e3a4"}}