{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7OJQW5OFJR4A5AMHS5KYVBUXQY","short_pith_number":"pith:7OJQW5OF","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"},"canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","source":{"kind":"arxiv","id":"1902.06599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06599","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06599v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06599","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"7OJQW5OFJR4A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OJQW5OFJR4A5AMH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OJQW5OF","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7OJQW5OFJR4A5AMHS5KYVBUXQY","target":"record","payload":{"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"},"canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","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"},"source_kind":"arxiv","source_id":"1902.06599","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3G1OSzqlmKylI7bpwS3blfwoSr5oLy4/EKGvzldLlTZUaA3aGa2SXQYynXnC7Og65fd3iISgpKZV0j8vJI9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:23:34.569855Z"},"content_sha256":"37fff6243883fe445ff7e56f47e14e61fd4eba04df80a98d59d20fccb9760b2c","schema_version":"1.0","event_id":"sha256:37fff6243883fe445ff7e56f47e14e61fd4eba04df80a98d59d20fccb9760b2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7OJQW5OFJR4A5AMHS5KYVBUXQY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnFnF6Rl/RARJpU3olsAEM3NZJT4vTRT5IvnKVqLK+zHlYxd3s5kR5WTpnRh8odsLjYXYvWLAPZGoDzmWiLBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:23:34.570489Z"},"content_sha256":"208692d6e517ed7a06f5c93af28a25126d8efd89b3ea5c744c056bd574c92e72","schema_version":"1.0","event_id":"sha256:208692d6e517ed7a06f5c93af28a25126d8efd89b3ea5c744c056bd574c92e72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/bundle.json","state_url":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:23:34Z","links":{"resolver":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY","bundle":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/bundle.json","state":"https://pith.science/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OJQW5OFJR4A5AMHS5KYVBUXQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7OJQW5OFJR4A5AMHS5KYVBUXQY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c30bda7d4582ba13029c988c3cb50d857ea0f26f233b6f22960333b68c7b127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-18T14:52:40Z","title_canon_sha256":"06deb60b88e18f801ee9a630cec44d1d0e12a57677cd72735014dcc3416f5829"},"schema_version":"1.0","source":{"id":"1902.06599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06599","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06599v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06599","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"7OJQW5OFJR4A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7OJQW5OFJR4A5AMH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7OJQW5OF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:208692d6e517ed7a06f5c93af28a25126d8efd89b3ea5c744c056bd574c92e72","target":"graph","created_at":"2026-05-17T23:53:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Andr\\'e van Renssen, Jonas Cleve, Katharina Klost, Man-Kwun Chiu, Marcel Roeloffzen, Matias Korman, Max Willert, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-18T14:52:40Z","title":"Routing in Histograms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06599","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37fff6243883fe445ff7e56f47e14e61fd4eba04df80a98d59d20fccb9760b2c","target":"record","created_at":"2026-05-17T23:53:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c30bda7d4582ba13029c988c3cb50d857ea0f26f233b6f22960333b68c7b127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-18T14:52:40Z","title_canon_sha256":"06deb60b88e18f801ee9a630cec44d1d0e12a57677cd72735014dcc3416f5829"},"schema_version":"1.0","source":{"id":"1902.06599","kind":"arxiv","version":1}},"canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb930b75c54c780e818797558a86978629185aa34c934fb5a2aaf7b4620235e3","first_computed_at":"2026-05-17T23:53:45.016201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.016201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2LRoLgpGIl6sXT279/YdRVDk+qtK5o7+m72y1XZTe9/EZoMWGPnKmGR2u+D5iAbw/WkJ18A43sFXt05I8fHPAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.016589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37fff6243883fe445ff7e56f47e14e61fd4eba04df80a98d59d20fccb9760b2c","sha256:208692d6e517ed7a06f5c93af28a25126d8efd89b3ea5c744c056bd574c92e72"],"state_sha256":"8b76d440d5057c5abd7dc40603b8634d96a1669d03f472521ffd32134c4faf58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bGmxkSIupcE7+C2umhNZyyLhaGVh2nCxAqdHxB34juOYRAQTqanVIOmAIdyj0oLYXyeTXSjcHUsNEBKLs8hCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:23:34.573864Z","bundle_sha256":"47857a659cff32aaf2d1384f782659dd98b08140ad17902d859304f8c9f3bc14"}}