{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Q5YMVIJWX45PXRBPKE352C5S6I","short_pith_number":"pith:Q5YMVIJW","canonical_record":{"source":{"id":"2408.04264","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f4eda317a081dd091679a8b0bd82768dfba7d2d5905ff6ceba226ecc446a1de5","abstract_canon_sha256":"598cf2527c64ea0894bb8ada3330bd11915ff49ab345b9bac396638060da6976"},"schema_version":"1.0"},"canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","source":{"kind":"arxiv","id":"2408.04264","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04264","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04264v3","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04264","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"Q5YMVIJWX45P","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_16","alias_value":"Q5YMVIJWX45PXRBP","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_8","alias_value":"Q5YMVIJW","created_at":"2026-07-05T10:52:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Q5YMVIJWX45PXRBPKE352C5S6I","target":"record","payload":{"canonical_record":{"source":{"id":"2408.04264","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f4eda317a081dd091679a8b0bd82768dfba7d2d5905ff6ceba226ecc446a1de5","abstract_canon_sha256":"598cf2527c64ea0894bb8ada3330bd11915ff49ab345b9bac396638060da6976"},"schema_version":"1.0"},"canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:55.318096Z","signature_b64":"hWemTmn7bgnws4jOqlSIPQ1u5g7xERH6AOwNXJBinwbNoxQbbun8c1ChXMPv/tf1d6qlScydzzrRvevqhkFyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","last_reissued_at":"2026-07-05T10:52:55.317626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:55.317626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.04264","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-07-05T10:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/EtZly0ex67vbR5m7sADdwt2vZrwguiQM5j3FvZfXS/Ql6k4GxkTygrGPT5KeCLlWHNkUUhsITbtu0LskE1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:16:03.610142Z"},"content_sha256":"0985b19caa2a793c7796e13e64f972f88fa9ba5a6920bfe7436e02108c3c062a","schema_version":"1.0","event_id":"sha256:0985b19caa2a793c7796e13e64f972f88fa9ba5a6920bfe7436e02108c3c062a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Q5YMVIJWX45PXRBPKE352C5S6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Alexander Wolff, Grzegorz Gutowski, Myroslav Kryven, Oksana Firman, Yuto Okada","submitted_at":"2024-08-08T07:03:12Z","abstract_excerpt":"The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer $k$-planar graphs, that is, graphs that admit a straight-line drawing where all the vertices lie on a circle, and every edge is crossed by at most $k$ other edges.\n  Wood and Telle [New York J. Math., 2007] showed that every outer $k$-planar graph has treewidth at most $3k + 11$ using so-called planar decompositions, and later, Auer et al. [Algorithmica, 2016] proved that the treewi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04264","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.04264/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1zP8cj9yuhjdvP7qRk9vjfIvo2yYrwFlyMX5WYMGz0wcajxLr/ImJSb6ETDNg4CMyPuyh4oUYb/2ataJ10DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:16:03.611049Z"},"content_sha256":"f5d65bb93dc17f5374f974e2530c1804c214c078557e72a0bd867f5e3c8b5e7d","schema_version":"1.0","event_id":"sha256:f5d65bb93dc17f5374f974e2530c1804c214c078557e72a0bd867f5e3c8b5e7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/bundle.json","state_url":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5YMVIJWX45PXRBPKE352C5S6I/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-08-13T02:16:03Z","links":{"resolver":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I","bundle":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/bundle.json","state":"https://pith.science/pith/Q5YMVIJWX45PXRBPKE352C5S6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5YMVIJWX45PXRBPKE352C5S6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Q5YMVIJWX45PXRBPKE352C5S6I","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":"598cf2527c64ea0894bb8ada3330bd11915ff49ab345b9bac396638060da6976","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","title_canon_sha256":"f4eda317a081dd091679a8b0bd82768dfba7d2d5905ff6ceba226ecc446a1de5"},"schema_version":"1.0","source":{"id":"2408.04264","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04264","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04264v3","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04264","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"Q5YMVIJWX45P","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_16","alias_value":"Q5YMVIJWX45PXRBP","created_at":"2026-07-05T10:52:55Z"},{"alias_kind":"pith_short_8","alias_value":"Q5YMVIJW","created_at":"2026-07-05T10:52:55Z"}],"graph_snapshots":[{"event_id":"sha256:f5d65bb93dc17f5374f974e2530c1804c214c078557e72a0bd867f5e3c8b5e7d","target":"graph","created_at":"2026-07-05T10:52:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.04264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer $k$-planar graphs, that is, graphs that admit a straight-line drawing where all the vertices lie on a circle, and every edge is crossed by at most $k$ other edges.\n  Wood and Telle [New York J. Math., 2007] showed that every outer $k$-planar graph has treewidth at most $3k + 11$ using so-called planar decompositions, and later, Auer et al. [Algorithmica, 2016] proved that the treewi","authors_text":"Alexander Wolff, Grzegorz Gutowski, Myroslav Kryven, Oksana Firman, Yuto Okada","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04264","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:0985b19caa2a793c7796e13e64f972f88fa9ba5a6920bfe7436e02108c3c062a","target":"record","created_at":"2026-07-05T10:52:55Z","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":"598cf2527c64ea0894bb8ada3330bd11915ff49ab345b9bac396638060da6976","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-08-08T07:03:12Z","title_canon_sha256":"f4eda317a081dd091679a8b0bd82768dfba7d2d5905ff6ceba226ecc446a1de5"},"schema_version":"1.0","source":{"id":"2408.04264","kind":"arxiv","version":3}},"canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8770caa136bf3afbc42f5137dd0bb2f20ca905bb97c590274554bba171fe0622","first_computed_at":"2026-07-05T10:52:55.317626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:55.317626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWemTmn7bgnws4jOqlSIPQ1u5g7xERH6AOwNXJBinwbNoxQbbun8c1ChXMPv/tf1d6qlScydzzrRvevqhkFyCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:55.318096Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.04264","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0985b19caa2a793c7796e13e64f972f88fa9ba5a6920bfe7436e02108c3c062a","sha256:f5d65bb93dc17f5374f974e2530c1804c214c078557e72a0bd867f5e3c8b5e7d"],"state_sha256":"c89cbd3c7d68a5c662208c45322e2464cf7a3dfcfab29d66783e2cf7e829c57b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJhtfnknc3kqqNKVAByR6mUXixVV4u1j9fCQ8eFuKhh+gbJcpRgd5OE6MhBCqGstuSIi1caU+RUK0zPzlQQ/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:16:03.619539Z","bundle_sha256":"05e7647374ce9cc616e01b15919b52733e017a9c6965164c1ff02f9e96ff3ec8"}}