{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7OJQW5OFJR4A5AMHS5KYVBUXQY","short_pith_number":"pith:7OJQW5OF","schema_version":"1.0","canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","source":{"kind":"arxiv","id":"1902.06599","version":1},"attestation_state":"computed","paper":{"title":"Routing in Histograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Jonas Cleve, Katharina Klost, Man-Kwun Chiu, Marcel Roeloffzen, Matias Korman, Max Willert, Wolfgang Mulzer","submitted_at":"2019-02-18T14:52:40Z","abstract_excerpt":"Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points $p$ and $q$ in $P$ are co-visible if and only if the (axis-parallel) rectangle spanned by $p$ and $q$ completely lies in $P$. In the $r$-visibility graph $G(P)$ of $P$, we connect two vertices of $P$ with an edge if and only if they are co-visible.\n  We consider routing with preprocessing in $G(P)$. We may preprocess $P$ to obtain a label and a routing "},"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":"1902.06599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-18T14:52:40Z","cross_cats_sorted":[],"title_canon_sha256":"06deb60b88e18f801ee9a630cec44d1d0e12a57677cd72735014dcc3416f5829","abstract_canon_sha256":"0c30bda7d4582ba13029c988c3cb50d857ea0f26f233b6f22960333b68c7b127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.016589Z","signature_b64":"2LRoLgpGIl6sXT279/YdRVDk+qtK5o7+m72y1XZTe9/EZoMWGPnKmGR2u+D5iAbw/WkJ18A43sFXt05I8fHPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","last_reissued_at":"2026-05-17T23:53:45.016201Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.016201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing in Histograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Jonas Cleve, Katharina Klost, Man-Kwun Chiu, Marcel Roeloffzen, Matias Korman, Max Willert, Wolfgang Mulzer","submitted_at":"2019-02-18T14:52:40Z","abstract_excerpt":"Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points $p$ and $q$ in $P$ are co-visible if and only if the (axis-parallel) rectangle spanned by $p$ and $q$ completely lies in $P$. In the $r$-visibility graph $G(P)$ of $P$, we connect two vertices of $P$ with an edge if and only if they are co-visible.\n  We consider routing with preprocessing in $G(P)$. We may preprocess $P$ to obtain a label and a routing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06599","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":"1902.06599","created_at":"2026-05-17T23:53:45.016265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06599v1","created_at":"2026-05-17T23:53:45.016265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06599","created_at":"2026-05-17T23:53:45.016265+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OJQW5OFJR4A","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OJQW5OFJR4A5AMH","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OJQW5OF","created_at":"2026-05-18T12:33:12.712433+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/7OJQW5OFJR4A5AMHS5KYVBUXQY","json":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY.json","graph_json":"https://pith.science/api/pith-number/7OJQW5OFJR4A5AMHS5KYVBUXQY/graph.json","events_json":"https://pith.science/api/pith-number/7OJQW5OFJR4A5AMHS5KYVBUXQY/events.json","paper":"https://pith.science/paper/7OJQW5OF"},"agent_actions":{"view_html":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY","download_json":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY.json","view_paper":"https://pith.science/paper/7OJQW5OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06599&json=true","fetch_graph":"https://pith.science/api/pith-number/7OJQW5OFJR4A5AMHS5KYVBUXQY/graph.json","fetch_events":"https://pith.science/api/pith-number/7OJQW5OFJR4A5AMHS5KYVBUXQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/action/storage_attestation","attest_author":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/action/author_attestation","sign_citation":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/action/citation_signature","submit_replication":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/action/replication_record"}},"created_at":"2026-05-17T23:53:45.016265+00:00","updated_at":"2026-05-17T23:53:45.016265+00:00"}