{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WVFCHQINN2DSILXM6AY7TPGRZW","short_pith_number":"pith:WVFCHQIN","canonical_record":{"source":{"id":"1212.6382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-27T15:09:02Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4ae4c93846cf5d7e7c244459f8da2273b77ad3945d161282b26c8fea558d9c3e","abstract_canon_sha256":"7117ce98e10dd8081be2ff8379829562d75cb78abf439572e8d9ba6cdd1bf963"},"schema_version":"1.0"},"canonical_sha256":"b54a23c10d6e87242eecf031f9bcd1cdacae0f7dd92e6ef93f00e3b87bac5ee5","source":{"kind":"arxiv","id":"1212.6382","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6382","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6382v3","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6382","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"WVFCHQINN2DS","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WVFCHQINN2DSILXM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WVFCHQIN","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WVFCHQINN2DSILXM6AY7TPGRZW","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-27T15:09:02Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4ae4c93846cf5d7e7c244459f8da2273b77ad3945d161282b26c8fea558d9c3e","abstract_canon_sha256":"7117ce98e10dd8081be2ff8379829562d75cb78abf439572e8d9ba6cdd1bf963"},"schema_version":"1.0"},"canonical_sha256":"b54a23c10d6e87242eecf031f9bcd1cdacae0f7dd92e6ef93f00e3b87bac5ee5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:32.454297Z","signature_b64":"btPq2Ux5e34kxnGLop7C28rmfMYur94MMOZMDKcaeEOGBkNapVVnc3FdVx5oOEBtyD3PoIopO6bCBXGJ+JqSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b54a23c10d6e87242eecf031f9bcd1cdacae0f7dd92e6ef93f00e3b87bac5ee5","last_reissued_at":"2026-05-18T03:03:32.453730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:32.453730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6382","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-18T03:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfQ5ewucxk1cG61nyTUGP516ioRuqrqhLdT6x728fIU5Z/vaixW35ouHYGjUFHAJl6Lt24T2cY6Bi4AiQxROBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:37.544812Z"},"content_sha256":"2d713ee5654c3d6a50b4e12b63fa730d61fc62dc7c6709bc64c1829dce9935bb","schema_version":"1.0","event_id":"sha256:2d713ee5654c3d6a50b4e12b63fa730d61fc62dc7c6709bc64c1829dce9935bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WVFCHQINN2DSILXM6AY7TPGRZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-connecting Outerplanar Graphs without Blowing Up the Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, Jasine Babu, L. Sunil Chandran, Manu Basavaraju","submitted_at":"2012-12-27T15:09:02Z","abstract_excerpt":"Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl for 2-vertex-connected outerplanar graphs will work for all outer planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6382","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-18T03:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4N/2381FQ7faWtMYEguGvx5bISd57iAlCw8MFFy1qMytp//IexzzGq22qdc3gt6QzoN6Ik+DWMk8vlBMcqGwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:37.545546Z"},"content_sha256":"aed83072ec200ea160ccda68fe447c1222ab9843ba1317704fd49d02327dca59","schema_version":"1.0","event_id":"sha256:aed83072ec200ea160ccda68fe447c1222ab9843ba1317704fd49d02327dca59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVFCHQINN2DSILXM6AY7TPGRZW/bundle.json","state_url":"https://pith.science/pith/WVFCHQINN2DSILXM6AY7TPGRZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVFCHQINN2DSILXM6AY7TPGRZW/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-31T23:25:37Z","links":{"resolver":"https://pith.science/pith/WVFCHQINN2DSILXM6AY7TPGRZW","bundle":"https://pith.science/pith/WVFCHQINN2DSILXM6AY7TPGRZW/bundle.json","state":"https://pith.science/pith/WVFCHQINN2DSILXM6AY7TPGRZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVFCHQINN2DSILXM6AY7TPGRZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WVFCHQINN2DSILXM6AY7TPGRZW","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":"7117ce98e10dd8081be2ff8379829562d75cb78abf439572e8d9ba6cdd1bf963","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-27T15:09:02Z","title_canon_sha256":"4ae4c93846cf5d7e7c244459f8da2273b77ad3945d161282b26c8fea558d9c3e"},"schema_version":"1.0","source":{"id":"1212.6382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6382","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6382v3","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6382","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"WVFCHQINN2DS","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WVFCHQINN2DSILXM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WVFCHQIN","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:aed83072ec200ea160ccda68fe447c1222ab9843ba1317704fd49d02327dca59","target":"graph","created_at":"2026-05-18T03:03: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":"Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl for 2-vertex-connected outerplanar graphs will work for all outer planar graphs.","authors_text":"Deepak Rajendraprasad, Jasine Babu, L. Sunil Chandran, Manu Basavaraju","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-27T15:09:02Z","title":"2-connecting Outerplanar Graphs without Blowing Up the Pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6382","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:2d713ee5654c3d6a50b4e12b63fa730d61fc62dc7c6709bc64c1829dce9935bb","target":"record","created_at":"2026-05-18T03:03: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":"7117ce98e10dd8081be2ff8379829562d75cb78abf439572e8d9ba6cdd1bf963","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-27T15:09:02Z","title_canon_sha256":"4ae4c93846cf5d7e7c244459f8da2273b77ad3945d161282b26c8fea558d9c3e"},"schema_version":"1.0","source":{"id":"1212.6382","kind":"arxiv","version":3}},"canonical_sha256":"b54a23c10d6e87242eecf031f9bcd1cdacae0f7dd92e6ef93f00e3b87bac5ee5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54a23c10d6e87242eecf031f9bcd1cdacae0f7dd92e6ef93f00e3b87bac5ee5","first_computed_at":"2026-05-18T03:03:32.453730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:32.453730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btPq2Ux5e34kxnGLop7C28rmfMYur94MMOZMDKcaeEOGBkNapVVnc3FdVx5oOEBtyD3PoIopO6bCBXGJ+JqSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:32.454297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d713ee5654c3d6a50b4e12b63fa730d61fc62dc7c6709bc64c1829dce9935bb","sha256:aed83072ec200ea160ccda68fe447c1222ab9843ba1317704fd49d02327dca59"],"state_sha256":"4a93accc1776f5abc4b838bbedb25cad583527c6e33011228b640d62ba8ae6aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gTC4flzWY7JP2/oR3yiWLqvrUh2O3B2euZpeYxnnDnX11IW/zBesiJvNhbIv3sbqj07mVT8or+n9PI9bXErAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:25:37.549591Z","bundle_sha256":"4a1459481f78c161384859d913050900a13c3c93d2d696b5f32c74b55cc051be"}}