{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6EOLTXPGUX3CLK5DV3IXTDMKMX","short_pith_number":"pith:6EOLTXPG","canonical_record":{"source":{"id":"1301.5896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-24T20:54:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8238b06df34ccc8ccab4b30c9ca01297d48f7b65b5379ed1f55cf9737b3b5d00","abstract_canon_sha256":"c19575cbe627e2db834f95cdc5ddd2266c71a21eb2c04187128ce0a7830baf60"},"schema_version":"1.0"},"canonical_sha256":"f11cb9dde6a5f625aba3aed1798d8a65d462186243dfff6e9a7c69e8b33945a4","source":{"kind":"arxiv","id":"1301.5896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5896","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5896v1","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5896","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"6EOLTXPGUX3C","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6EOLTXPGUX3CLK5D","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6EOLTXPG","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6EOLTXPGUX3CLK5DV3IXTDMKMX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-24T20:54:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8238b06df34ccc8ccab4b30c9ca01297d48f7b65b5379ed1f55cf9737b3b5d00","abstract_canon_sha256":"c19575cbe627e2db834f95cdc5ddd2266c71a21eb2c04187128ce0a7830baf60"},"schema_version":"1.0"},"canonical_sha256":"f11cb9dde6a5f625aba3aed1798d8a65d462186243dfff6e9a7c69e8b33945a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:37.025685Z","signature_b64":"viZQs75egZDGP2GxwwBHytgG4pyR9LLgOl9W8yCFyKhAydV932GsOjHspZk89fpBBIKWS0qOzWHr7ZyB3sjaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f11cb9dde6a5f625aba3aed1798d8a65d462186243dfff6e9a7c69e8b33945a4","last_reissued_at":"2026-05-18T03:35:37.025191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:37.025191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5896","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-18T03:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPZZhQBsUe995KZ6yg53TROhhidpfA4TRH2CXVo4r56YYF8hOT1FVMzFtE4BHyCx6PYdDJOafLPcKzjgPnPKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:05:05.077488Z"},"content_sha256":"ca5647a377ed608877a8b2f18c386f051c944119c69fcfcb0a17417b98a3be29","schema_version":"1.0","event_id":"sha256:ca5647a377ed608877a8b2f18c386f051c944119c69fcfcb0a17417b98a3be29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6EOLTXPGUX3CLK5DV3IXTDMKMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ioannis Katsikarelis","submitted_at":"2013-01-24T20:54:38Z","abstract_excerpt":"By a well known result the treewidth of k-outerplanar graphs is at most 3k-1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i.e. it is shown that, given a k-outerplanar graph G, a tree decomposition of G of width at most 3k-1 can be found in O(kn) time and space. Similarly, a branch decomposition of a k-outerplanar graph of width at most 2k+1 can be also obtained in O(kn) time, the algorithm for which is also analyzed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5896","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-18T03:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N9z9guzLJgfxPF/3MxROXol2cEGEB/K2ZSzkjb1WMaSO45iB/8oksz8vJrwuB478f2+zhOq0oFkA8Sm0MrmWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:05:05.078101Z"},"content_sha256":"785f482eb7296beb4772f0229926cf60e7eb786bf086d5c83a873f0f855c738f","schema_version":"1.0","event_id":"sha256:785f482eb7296beb4772f0229926cf60e7eb786bf086d5c83a873f0f855c738f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/bundle.json","state_url":"https://pith.science/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/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-21T16:05:05Z","links":{"resolver":"https://pith.science/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX","bundle":"https://pith.science/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/bundle.json","state":"https://pith.science/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EOLTXPGUX3CLK5DV3IXTDMKMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6EOLTXPGUX3CLK5DV3IXTDMKMX","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":"c19575cbe627e2db834f95cdc5ddd2266c71a21eb2c04187128ce0a7830baf60","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-24T20:54:38Z","title_canon_sha256":"8238b06df34ccc8ccab4b30c9ca01297d48f7b65b5379ed1f55cf9737b3b5d00"},"schema_version":"1.0","source":{"id":"1301.5896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5896","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5896v1","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5896","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"6EOLTXPGUX3C","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6EOLTXPGUX3CLK5D","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6EOLTXPG","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:785f482eb7296beb4772f0229926cf60e7eb786bf086d5c83a873f0f855c738f","target":"graph","created_at":"2026-05-18T03:35:37Z","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":"By a well known result the treewidth of k-outerplanar graphs is at most 3k-1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i.e. it is shown that, given a k-outerplanar graph G, a tree decomposition of G of width at most 3k-1 can be found in O(kn) time and space. Similarly, a branch decomposition of a k-outerplanar graph of width at most 2k+1 can be also obtained in O(kn) time, the algorithm for which is also analyzed.","authors_text":"Ioannis Katsikarelis","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-24T20:54:38Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5896","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:ca5647a377ed608877a8b2f18c386f051c944119c69fcfcb0a17417b98a3be29","target":"record","created_at":"2026-05-18T03:35:37Z","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":"c19575cbe627e2db834f95cdc5ddd2266c71a21eb2c04187128ce0a7830baf60","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-24T20:54:38Z","title_canon_sha256":"8238b06df34ccc8ccab4b30c9ca01297d48f7b65b5379ed1f55cf9737b3b5d00"},"schema_version":"1.0","source":{"id":"1301.5896","kind":"arxiv","version":1}},"canonical_sha256":"f11cb9dde6a5f625aba3aed1798d8a65d462186243dfff6e9a7c69e8b33945a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f11cb9dde6a5f625aba3aed1798d8a65d462186243dfff6e9a7c69e8b33945a4","first_computed_at":"2026-05-18T03:35:37.025191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:37.025191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"viZQs75egZDGP2GxwwBHytgG4pyR9LLgOl9W8yCFyKhAydV932GsOjHspZk89fpBBIKWS0qOzWHr7ZyB3sjaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:37.025685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca5647a377ed608877a8b2f18c386f051c944119c69fcfcb0a17417b98a3be29","sha256:785f482eb7296beb4772f0229926cf60e7eb786bf086d5c83a873f0f855c738f"],"state_sha256":"976709b5b7b6c5aa1d7706971f1c80722169fb1e04e6185d014ae066864479d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2rvx0vtul5NwX3sEnS80900hipmtwadGpls6sFB8f9Z6/PN0Dqv0yUAvXoSmYmqjdxqfChdyIHA0ermkh7LBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T16:05:05.081487Z","bundle_sha256":"92ee2b8a586a334e2fe84e00f7f6a280b6d1b6da5132e6f47ce3d525f2e0afef"}}