{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KUHHZW7W7QLSPCNY24Z5V3SQJP","short_pith_number":"pith:KUHHZW7W","canonical_record":{"source":{"id":"2108.12321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-08-27T14:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"63b85a47ed11c63d31c02b029e41d90a345b24c8004f948c69a859d4d2c09ac9","abstract_canon_sha256":"1a2bf8abbbf35cd3a19bfe9cf6ac04f440adbaf38faec8773b52639102b8e899"},"schema_version":"1.0"},"canonical_sha256":"550e7cdbf6fc172789b8d733daee504bfc0b726139903ac8b5c62a377acb6462","source":{"kind":"arxiv","id":"2108.12321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.12321","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2108.12321v1","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.12321","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"KUHHZW7W7QLS","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"KUHHZW7W7QLSPCNY","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"KUHHZW7W","created_at":"2026-07-05T03:09:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KUHHZW7W7QLSPCNY24Z5V3SQJP","target":"record","payload":{"canonical_record":{"source":{"id":"2108.12321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-08-27T14:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"63b85a47ed11c63d31c02b029e41d90a345b24c8004f948c69a859d4d2c09ac9","abstract_canon_sha256":"1a2bf8abbbf35cd3a19bfe9cf6ac04f440adbaf38faec8773b52639102b8e899"},"schema_version":"1.0"},"canonical_sha256":"550e7cdbf6fc172789b8d733daee504bfc0b726139903ac8b5c62a377acb6462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:24.525245Z","signature_b64":"Nf8FJxBXhl23Qq2AdhJl+Dg1vFfdN/QKxuk+vJ5AqfFB4YG5PhXRb/85t0fPQh9bgKkuLPjLIS4pYAEcF2GRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"550e7cdbf6fc172789b8d733daee504bfc0b726139903ac8b5c62a377acb6462","last_reissued_at":"2026-07-05T03:09:24.524870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:24.524870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.12321","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-07-05T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPCbICf8LbW4mENcA0Ui67jjb6RSpZ2Zg+eAoGPv06zJCSE/eP0HvYHHBrQ2jJ5BC08sADoPC80WaSQRZSUEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:06:28.061739Z"},"content_sha256":"dffcb0227e22ce9bec71edb8f387e25988c3987a0774460874218c01ff07f7fd","schema_version":"1.0","event_id":"sha256:dffcb0227e22ce9bec71edb8f387e25988c3987a0774460874218c01ff07f7fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KUHHZW7W7QLSPCNY24Z5V3SQJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andre L\\\"offler, Antonios Symvonis, Lena Schlipf, Patrizio Angelini, Philipp Kindermann","submitted_at":"2021-08-27T14:55:16Z","abstract_excerpt":"We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where $m\\le n-3$ is the number of interior edges. In the positive case, we can also compute such a drawing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.12321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.12321/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-05T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sL0bdK5p4Wr02n+Mhi/Iskfx2CIoySc+oZoPoMqhx+RzOARtIn+2ehONgb3IZ7GNmEnb+T7i4HGC5CdCpJa/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:06:28.062218Z"},"content_sha256":"7e96c8bb2c96af8f96e4f385a5d4d135643f1307f42b8c2e403788544914fa82","schema_version":"1.0","event_id":"sha256:7e96c8bb2c96af8f96e4f385a5d4d135643f1307f42b8c2e403788544914fa82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/bundle.json","state_url":"https://pith.science/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/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-04T10:06:28Z","links":{"resolver":"https://pith.science/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP","bundle":"https://pith.science/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/bundle.json","state":"https://pith.science/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUHHZW7W7QLSPCNY24Z5V3SQJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KUHHZW7W7QLSPCNY24Z5V3SQJP","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":"1a2bf8abbbf35cd3a19bfe9cf6ac04f440adbaf38faec8773b52639102b8e899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-08-27T14:55:16Z","title_canon_sha256":"63b85a47ed11c63d31c02b029e41d90a345b24c8004f948c69a859d4d2c09ac9"},"schema_version":"1.0","source":{"id":"2108.12321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.12321","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2108.12321v1","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.12321","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"KUHHZW7W7QLS","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"KUHHZW7W7QLSPCNY","created_at":"2026-07-05T03:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"KUHHZW7W","created_at":"2026-07-05T03:09:24Z"}],"graph_snapshots":[{"event_id":"sha256:7e96c8bb2c96af8f96e4f385a5d4d135643f1307f42b8c2e403788544914fa82","target":"graph","created_at":"2026-07-05T03:09:24Z","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/2108.12321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where $m\\le n-3$ is the number of interior edges. In the positive case, we can also compute such a drawing.","authors_text":"Andre L\\\"offler, Antonios Symvonis, Lena Schlipf, Patrizio Angelini, Philipp Kindermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-08-27T14:55:16Z","title":"One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.12321","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:dffcb0227e22ce9bec71edb8f387e25988c3987a0774460874218c01ff07f7fd","target":"record","created_at":"2026-07-05T03:09:24Z","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":"1a2bf8abbbf35cd3a19bfe9cf6ac04f440adbaf38faec8773b52639102b8e899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-08-27T14:55:16Z","title_canon_sha256":"63b85a47ed11c63d31c02b029e41d90a345b24c8004f948c69a859d4d2c09ac9"},"schema_version":"1.0","source":{"id":"2108.12321","kind":"arxiv","version":1}},"canonical_sha256":"550e7cdbf6fc172789b8d733daee504bfc0b726139903ac8b5c62a377acb6462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550e7cdbf6fc172789b8d733daee504bfc0b726139903ac8b5c62a377acb6462","first_computed_at":"2026-07-05T03:09:24.524870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:09:24.524870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nf8FJxBXhl23Qq2AdhJl+Dg1vFfdN/QKxuk+vJ5AqfFB4YG5PhXRb/85t0fPQh9bgKkuLPjLIS4pYAEcF2GRDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:09:24.525245Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.12321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dffcb0227e22ce9bec71edb8f387e25988c3987a0774460874218c01ff07f7fd","sha256:7e96c8bb2c96af8f96e4f385a5d4d135643f1307f42b8c2e403788544914fa82"],"state_sha256":"4342fb34b140a5846ca68af7dbcada48a2631b4992b9bb87e9551e39c16786cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFV5Nc/T7iMJQlcCusQxr1qhowrPo6GiPSiN5RKghqyiyoYokvTn2EF+4xfZdCRxU0QP0U7U6CE1Pr3whcdTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:06:28.065709Z","bundle_sha256":"c102a349c19eea95640e0be4319f4cb895302a4c2ca9fc35bf658ea3a398b855"}}