{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VDREIKR4UPAV7CEEYXQPULIWEZ","short_pith_number":"pith:VDREIKR4","schema_version":"1.0","canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","source":{"kind":"arxiv","id":"1807.01247","version":2},"attestation_state":"computed","paper":{"title":"Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alessandra Tappini, Fabrizio Montecchiani, Giuseppe Liotta","submitted_at":"2018-07-03T15:46:30Z","abstract_excerpt":"An ortho-polygon visibility representation $\\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility between its end-vertices. The representation $\\Gamma$ has vertex complexity $k$ if every polygon of $\\Gamma$ has at most $k$ reflex corners. It is known that $3$-connected $1$-plane graphs admit an OPVR with vertex complexity at most twelve, while vertex complexity at least two may be required in some cases. In this paper, we reduce this gap by showi"},"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":"1807.01247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"976fb8d07efa72ba08c4cbec7b562f0595ce29fc6da0490356e2857d2253ea6d","abstract_canon_sha256":"9bda3d7bd127f7eb88ff81550ffec9e875bff2d423fdf82c76fe2281a95803a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:03.729394Z","signature_b64":"36f8mKPxu4+SKnKRXWNwgLBKJdk6r/oa2Iv0hMFtp9oOFI1axOhbMDP3r+kVxdelm6D8wmgmVFYF8QEQa1l5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","last_reissued_at":"2026-05-18T00:09:03.728821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:03.728821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alessandra Tappini, Fabrizio Montecchiani, Giuseppe Liotta","submitted_at":"2018-07-03T15:46:30Z","abstract_excerpt":"An ortho-polygon visibility representation $\\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility between its end-vertices. The representation $\\Gamma$ has vertex complexity $k$ if every polygon of $\\Gamma$ has at most $k$ reflex corners. It is known that $3$-connected $1$-plane graphs admit an OPVR with vertex complexity at most twelve, while vertex complexity at least two may be required in some cases. In this paper, we reduce this gap by showi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01247","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":"1807.01247","created_at":"2026-05-18T00:09:03.728912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01247v2","created_at":"2026-05-18T00:09:03.728912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01247","created_at":"2026-05-18T00:09:03.728912+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDREIKR4UPAV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDREIKR4UPAV7CEE","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDREIKR4","created_at":"2026-05-18T12:32:59.047623+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/VDREIKR4UPAV7CEEYXQPULIWEZ","json":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ.json","graph_json":"https://pith.science/api/pith-number/VDREIKR4UPAV7CEEYXQPULIWEZ/graph.json","events_json":"https://pith.science/api/pith-number/VDREIKR4UPAV7CEEYXQPULIWEZ/events.json","paper":"https://pith.science/paper/VDREIKR4"},"agent_actions":{"view_html":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ","download_json":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ.json","view_paper":"https://pith.science/paper/VDREIKR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01247&json=true","fetch_graph":"https://pith.science/api/pith-number/VDREIKR4UPAV7CEEYXQPULIWEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VDREIKR4UPAV7CEEYXQPULIWEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/action/storage_attestation","attest_author":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/action/author_attestation","sign_citation":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/action/citation_signature","submit_replication":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/action/replication_record"}},"created_at":"2026-05-18T00:09:03.728912+00:00","updated_at":"2026-05-18T00:09:03.728912+00:00"}