{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7BKDJQEKWOTMDZQONJXUXRVM33","short_pith_number":"pith:7BKDJQEK","schema_version":"1.0","canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","source":{"kind":"arxiv","id":"1604.08797","version":3},"attestation_state":"computed","paper":{"title":"Ortho-polygon Visibility Representations of Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","submitted_at":"2016-04-29T12:35:54Z","abstract_excerpt":"An ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility between its end-vertices. The vertex complexity of an OPVR of $G$ is the minimum $k$ such that every polygon has at most $k$ reflex corners. We present polynomial time algorithms that test whether $G$ has an OPVR and, if so, compute one of minimum vertex complexity. We argue that the existence and the vertex complexity of an OPVR of $G$ are related to it"},"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":"1604.08797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"d71707cb3881cb1eb197b3ceeb6192dac172bf01b065b29a77b1fe3bb234e2f2","abstract_canon_sha256":"7f941d37644cf199f1e0e499a54090a40d23ca58feb5aa42e93bf05cb4cf092f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.757311Z","signature_b64":"DOqpWvqn8dIa8zHtfKxHq4cOzAzkZgzRefQbGkBekhDVVSAkRlTLYoIKo7c60a9uNoVLUmL+RR/xVv2XQKwKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","last_reissued_at":"2026-05-18T00:44:24.756598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.756598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ortho-polygon Visibility Representations of Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","submitted_at":"2016-04-29T12:35:54Z","abstract_excerpt":"An ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility between its end-vertices. The vertex complexity of an OPVR of $G$ is the minimum $k$ such that every polygon has at most $k$ reflex corners. We present polynomial time algorithms that test whether $G$ has an OPVR and, if so, compute one of minimum vertex complexity. We argue that the existence and the vertex complexity of an OPVR of $G$ are related to it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08797","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":""},"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":"1604.08797","created_at":"2026-05-18T00:44:24.756693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08797v3","created_at":"2026-05-18T00:44:24.756693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08797","created_at":"2026-05-18T00:44:24.756693+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BKDJQEKWOTM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BKDJQEKWOTMDZQO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BKDJQEK","created_at":"2026-05-18T12:30:04.600751+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/7BKDJQEKWOTMDZQONJXUXRVM33","json":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33.json","graph_json":"https://pith.science/api/pith-number/7BKDJQEKWOTMDZQONJXUXRVM33/graph.json","events_json":"https://pith.science/api/pith-number/7BKDJQEKWOTMDZQONJXUXRVM33/events.json","paper":"https://pith.science/paper/7BKDJQEK"},"agent_actions":{"view_html":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33","download_json":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33.json","view_paper":"https://pith.science/paper/7BKDJQEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08797&json=true","fetch_graph":"https://pith.science/api/pith-number/7BKDJQEKWOTMDZQONJXUXRVM33/graph.json","fetch_events":"https://pith.science/api/pith-number/7BKDJQEKWOTMDZQONJXUXRVM33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/action/storage_attestation","attest_author":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/action/author_attestation","sign_citation":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/action/citation_signature","submit_replication":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/action/replication_record"}},"created_at":"2026-05-18T00:44:24.756693+00:00","updated_at":"2026-05-18T00:44:24.756693+00:00"}