{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RQRSZFBOIAD7LJR4YZPUS5X2H4","short_pith_number":"pith:RQRSZFBO","schema_version":"1.0","canonical_sha256":"8c232c942e4007f5a63cc65f4976fa3f25efe84b9ac71f6942aec3963620f9e7","source":{"kind":"arxiv","id":"1904.06760","version":1},"attestation_state":"computed","paper":{"title":"Drawing HV-Restricted Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, Saeed Mehrabi, Stefan Felsner, Stephane Durocher","submitted_at":"2019-04-14T21:13:48Z","abstract_excerpt":"A strict orthogonal drawing of a graph $G=(V, E)$ in $\\mathbb{R}^2$ is a drawing of $G$ such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph $G$ is $HV$-restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an $HV$-restricted graph $G$ is good if it is planar and respects the edge orientations of $G$. In this paper, we give a polynomial-time algorithm to check whether a given $HV$-restricted plane graph (i.e., a planar graph with a fixed combinatorial embedding) a"},"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":"1904.06760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-14T21:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"b1f61bcd979f7016bb46095cd0079d30e7fe2b9d071cefcb295ee721468ac0f7","abstract_canon_sha256":"26f5b61cd57810f8153a11e8976d3a050f2c91e7803311ce1fe1326d76b9234e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:36.297331Z","signature_b64":"d1ZtZDGtY4bjukpNkwa4n0tDdnyE0dzvjOK2gY4+u+k53H9hzclIJYHCWXtNlfWhYezoa02LVeyBrx8hLX4QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c232c942e4007f5a63cc65f4976fa3f25efe84b9ac71f6942aec3963620f9e7","last_reissued_at":"2026-05-17T23:48:36.296713Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:36.296713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing HV-Restricted Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, Saeed Mehrabi, Stefan Felsner, Stephane Durocher","submitted_at":"2019-04-14T21:13:48Z","abstract_excerpt":"A strict orthogonal drawing of a graph $G=(V, E)$ in $\\mathbb{R}^2$ is a drawing of $G$ such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph $G$ is $HV$-restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an $HV$-restricted graph $G$ is good if it is planar and respects the edge orientations of $G$. In this paper, we give a polynomial-time algorithm to check whether a given $HV$-restricted plane graph (i.e., a planar graph with a fixed combinatorial embedding) a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06760","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":""},"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":"1904.06760","created_at":"2026-05-17T23:48:36.296798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06760v1","created_at":"2026-05-17T23:48:36.296798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06760","created_at":"2026-05-17T23:48:36.296798+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQRSZFBOIAD7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQRSZFBOIAD7LJR4","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQRSZFBO","created_at":"2026-05-18T12:33:27.125529+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/RQRSZFBOIAD7LJR4YZPUS5X2H4","json":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4.json","graph_json":"https://pith.science/api/pith-number/RQRSZFBOIAD7LJR4YZPUS5X2H4/graph.json","events_json":"https://pith.science/api/pith-number/RQRSZFBOIAD7LJR4YZPUS5X2H4/events.json","paper":"https://pith.science/paper/RQRSZFBO"},"agent_actions":{"view_html":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4","download_json":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4.json","view_paper":"https://pith.science/paper/RQRSZFBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06760&json=true","fetch_graph":"https://pith.science/api/pith-number/RQRSZFBOIAD7LJR4YZPUS5X2H4/graph.json","fetch_events":"https://pith.science/api/pith-number/RQRSZFBOIAD7LJR4YZPUS5X2H4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4/action/storage_attestation","attest_author":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4/action/author_attestation","sign_citation":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4/action/citation_signature","submit_replication":"https://pith.science/pith/RQRSZFBOIAD7LJR4YZPUS5X2H4/action/replication_record"}},"created_at":"2026-05-17T23:48:36.296798+00:00","updated_at":"2026-05-17T23:48:36.296798+00:00"}