{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:D5PTPATE5N4FSMV45PZLPXTO4I","short_pith_number":"pith:D5PTPATE","schema_version":"1.0","canonical_sha256":"1f5f378264eb785932bcebf2b7de6ee20aac562772e0fdc90e141960d547850d","source":{"kind":"arxiv","id":"2209.08269","version":2},"attestation_state":"computed","paper":{"title":"B$_0$-VPG Representation of AT-free Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Sparsh Jain, Sreejith K. Pallathumadam","submitted_at":"2022-09-17T07:22:42Z","abstract_excerpt":"A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_k$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper, we show that all AT-free outerplanar graphs are B$_0$-VPG, i.e., intersection graphs of horizontal and vertical line segments in the plane. Our proofs are constructive and give a polynomial time B$_0$-VPG drawing algorithm for the class.\n  Following a long line of improvements, Gon\\c{c}alves, Isenmann, and Pennarun [SODA 2018] showed that all planar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2209.08269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-17T07:22:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8c47c58a852bbc1e8423bca11aeba6ef9ded6a6e592fef8e8096297c02d5bca4","abstract_canon_sha256":"384f3d86fb9171da8ec6e6b409199181b2be9eac35bf5c6c28718acb0dc8d552"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:01.410807Z","signature_b64":"8haOGN/xJ9RA77U/djjHdcrXnNMgOzCUY6vkg17rkyirMTnIVAas0Pmr0Lc3rlG4TXcxa+MQwA+0l842bcVdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5f378264eb785932bcebf2b7de6ee20aac562772e0fdc90e141960d547850d","last_reissued_at":"2026-07-05T05:48:01.410292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:01.410292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"B$_0$-VPG Representation of AT-free Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Sparsh Jain, Sreejith K. Pallathumadam","submitted_at":"2022-09-17T07:22:42Z","abstract_excerpt":"A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_k$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper, we show that all AT-free outerplanar graphs are B$_0$-VPG, i.e., intersection graphs of horizontal and vertical line segments in the plane. Our proofs are constructive and give a polynomial time B$_0$-VPG drawing algorithm for the class.\n  Following a long line of improvements, Gon\\c{c}alves, Isenmann, and Pennarun [SODA 2018] showed that all planar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08269","kind":"arxiv","version":2},"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/2209.08269/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.08269","created_at":"2026-07-05T05:48:01.410369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08269v2","created_at":"2026-07-05T05:48:01.410369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08269","created_at":"2026-07-05T05:48:01.410369+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5PTPATE5N4F","created_at":"2026-07-05T05:48:01.410369+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5PTPATE5N4FSMV4","created_at":"2026-07-05T05:48:01.410369+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5PTPATE","created_at":"2026-07-05T05:48:01.410369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I","json":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I.json","graph_json":"https://pith.science/api/pith-number/D5PTPATE5N4FSMV45PZLPXTO4I/graph.json","events_json":"https://pith.science/api/pith-number/D5PTPATE5N4FSMV45PZLPXTO4I/events.json","paper":"https://pith.science/paper/D5PTPATE"},"agent_actions":{"view_html":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I","download_json":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I.json","view_paper":"https://pith.science/paper/D5PTPATE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08269&json=true","fetch_graph":"https://pith.science/api/pith-number/D5PTPATE5N4FSMV45PZLPXTO4I/graph.json","fetch_events":"https://pith.science/api/pith-number/D5PTPATE5N4FSMV45PZLPXTO4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I/action/storage_attestation","attest_author":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I/action/author_attestation","sign_citation":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I/action/citation_signature","submit_replication":"https://pith.science/pith/D5PTPATE5N4FSMV45PZLPXTO4I/action/replication_record"}},"created_at":"2026-07-05T05:48:01.410369+00:00","updated_at":"2026-07-05T05:48:01.410369+00:00"}