{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VHEB5ZDIYZMQ5XDDZPBVST3N2X","short_pith_number":"pith:VHEB5ZDI","schema_version":"1.0","canonical_sha256":"a9c81ee468c6590edc63cbc3594f6dd5c1079926a3b9c7a14bb3580b6bd0a81e","source":{"kind":"arxiv","id":"1602.01777","version":1},"attestation_state":"computed","paper":{"title":"Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Gemsa, Franziska Wegner, Ignaz Rutter, Moritz Baum, Thomas Bl\\\"asius","submitted_at":"2016-02-04T18:17:44Z","abstract_excerpt":"Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose polygons with minimum number of segments that separate reachable and unreachable components of the network. Since the resulting problem is not known to be solvable in polynomial time, we introduce several heuristics that are simple enough to be implemented in practice. A key ingredient is a new practical linear-time algorithm for minimum-link paths in simple polygons. Experiments in 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":"1602.01777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T18:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc0fa604a9f6b06877fd8948affec9473df747704ddea74f674112e0da268e2d","abstract_canon_sha256":"9a17aafcf02dc2080b4fec36433ff3e4edc4c3067034c6c30ea395c98a2dce44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.137983Z","signature_b64":"5AzuUbh7yTA6IU2lVYpkfFqwbiEXDjkbofjnnbVNV0t22BHpGBblMtCEovPG1M+FgZipxEgP8zwDDH8EqUw/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9c81ee468c6590edc63cbc3594f6dd5c1079926a3b9c7a14bb3580b6bd0a81e","last_reissued_at":"2026-05-18T01:21:18.137429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.137429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Gemsa, Franziska Wegner, Ignaz Rutter, Moritz Baum, Thomas Bl\\\"asius","submitted_at":"2016-02-04T18:17:44Z","abstract_excerpt":"Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose polygons with minimum number of segments that separate reachable and unreachable components of the network. Since the resulting problem is not known to be solvable in polynomial time, we introduce several heuristics that are simple enough to be implemented in practice. A key ingredient is a new practical linear-time algorithm for minimum-link paths in simple polygons. Experiments in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01777","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":"1602.01777","created_at":"2026-05-18T01:21:18.137510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01777v1","created_at":"2026-05-18T01:21:18.137510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01777","created_at":"2026-05-18T01:21:18.137510+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHEB5ZDIYZMQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHEB5ZDIYZMQ5XDD","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHEB5ZDI","created_at":"2026-05-18T12:30:48.956258+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/VHEB5ZDIYZMQ5XDDZPBVST3N2X","json":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X.json","graph_json":"https://pith.science/api/pith-number/VHEB5ZDIYZMQ5XDDZPBVST3N2X/graph.json","events_json":"https://pith.science/api/pith-number/VHEB5ZDIYZMQ5XDDZPBVST3N2X/events.json","paper":"https://pith.science/paper/VHEB5ZDI"},"agent_actions":{"view_html":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X","download_json":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X.json","view_paper":"https://pith.science/paper/VHEB5ZDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01777&json=true","fetch_graph":"https://pith.science/api/pith-number/VHEB5ZDIYZMQ5XDDZPBVST3N2X/graph.json","fetch_events":"https://pith.science/api/pith-number/VHEB5ZDIYZMQ5XDDZPBVST3N2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X/action/storage_attestation","attest_author":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X/action/author_attestation","sign_citation":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X/action/citation_signature","submit_replication":"https://pith.science/pith/VHEB5ZDIYZMQ5XDDZPBVST3N2X/action/replication_record"}},"created_at":"2026-05-18T01:21:18.137510+00:00","updated_at":"2026-05-18T01:21:18.137510+00:00"}