{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EEPXMTYUHLENIDLLPLATSEPCHV","short_pith_number":"pith:EEPXMTYU","schema_version":"1.0","canonical_sha256":"211f764f143ac8d40d6b7ac13911e23d792ec642eb6f41eed29f89156af81933","source":{"kind":"arxiv","id":"1808.06892","version":2},"attestation_state":"computed","paper":{"title":"Monotone Drawings of $k$-Inner Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anargyros Oikonomou, Antonios Symvonis","submitted_at":"2018-08-21T13:31:38Z","abstract_excerpt":"A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In this paper, we show how to construct a monotone drawing of a $k$-inner planar graph on a $2(k+1)n \\times 2(k+1)n$ grid. In the special case of an outerplanar graph, we can produce a planar monotone drawing on a $n \\times n$ grid, improving previously known results."},"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":"1808.06892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-21T13:31:38Z","cross_cats_sorted":[],"title_canon_sha256":"51a2193359d47e3bb49fcb25803194b8415f2d99a90dbd9a9156f1d2b5b32611","abstract_canon_sha256":"7435e6d30a12b15c18b11e1ed65aa352c721f49f2776102c36c5ff4c852c8dd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:32.067080Z","signature_b64":"KUjUyN3HlQtD+Eyq3jWXDaSntXdBWF63hTUjcoULSzxTdLQnknrs7t6H1v/hjmzslwMV8hHfGtgCnADv0RtEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211f764f143ac8d40d6b7ac13911e23d792ec642eb6f41eed29f89156af81933","last_reissued_at":"2026-05-18T00:07:32.066452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:32.066452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Drawings of $k$-Inner Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anargyros Oikonomou, Antonios Symvonis","submitted_at":"2018-08-21T13:31:38Z","abstract_excerpt":"A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In this paper, we show how to construct a monotone drawing of a $k$-inner planar graph on a $2(k+1)n \\times 2(k+1)n$ grid. In the special case of an outerplanar graph, we can produce a planar monotone drawing on a $n \\times n$ grid, improving previously known results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06892","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":""},"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":"1808.06892","created_at":"2026-05-18T00:07:32.066565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06892v2","created_at":"2026-05-18T00:07:32.066565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06892","created_at":"2026-05-18T00:07:32.066565+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEPXMTYUHLEN","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEPXMTYUHLENIDLL","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEPXMTYU","created_at":"2026-05-18T12:32:22.470017+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/EEPXMTYUHLENIDLLPLATSEPCHV","json":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV.json","graph_json":"https://pith.science/api/pith-number/EEPXMTYUHLENIDLLPLATSEPCHV/graph.json","events_json":"https://pith.science/api/pith-number/EEPXMTYUHLENIDLLPLATSEPCHV/events.json","paper":"https://pith.science/paper/EEPXMTYU"},"agent_actions":{"view_html":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV","download_json":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV.json","view_paper":"https://pith.science/paper/EEPXMTYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06892&json=true","fetch_graph":"https://pith.science/api/pith-number/EEPXMTYUHLENIDLLPLATSEPCHV/graph.json","fetch_events":"https://pith.science/api/pith-number/EEPXMTYUHLENIDLLPLATSEPCHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV/action/storage_attestation","attest_author":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV/action/author_attestation","sign_citation":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV/action/citation_signature","submit_replication":"https://pith.science/pith/EEPXMTYUHLENIDLLPLATSEPCHV/action/replication_record"}},"created_at":"2026-05-18T00:07:32.066565+00:00","updated_at":"2026-05-18T00:07:32.066565+00:00"}