{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GHOWKNXPHTNXQWVSMDI2OCVBJW","short_pith_number":"pith:GHOWKNXP","schema_version":"1.0","canonical_sha256":"31dd6536ef3cdb785ab260d1a70aa14d96efd7451cea0aa73db82eaa1c538bf6","source":{"kind":"arxiv","id":"1204.4374","version":1},"attestation_state":"computed","paper":{"title":"Higher Order City Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Gemsa, Chih-Hung Liu, Dorothea Wagner, D. T. Lee","submitted_at":"2012-04-19T15:20:38Z","abstract_excerpt":"We investigate higher-order Voronoi diagrams in the city metric. This metric is induced by quickest paths in the L1 metric in the presence of an accelerating transportation network of axis-parallel line segments. For the structural complexity of kth-order city Voronoi diagrams of n point sites, we show an upper bound of O(k(n - k) + kc) and a lower bound of {\\Omega}(n + kc), where c is the complexity of the transportation network. This is quite different from the bound O(k(n - k)) in the Euclidean metric. For the special case where k = n - 1 the complexity in the Euclidean metric is O(n), whil"},"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":"1204.4374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-19T15:20:38Z","cross_cats_sorted":[],"title_canon_sha256":"c6ac37af16a9ff9d05124b077d6582a3aaf527c129fd0f192210c19149f34966","abstract_canon_sha256":"0ef56bc1e97f08b378e8917293debb678d6a25f2fc86895d2a1625695f3b9e43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:27.644559Z","signature_b64":"WuBlBpI58MhJnBfv0WKa/+tM7c3mr7fEXH2gZa+nHMye7xIGlqTKyWxImas4VUDybtCv67OcdSRr9IqZNjmDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31dd6536ef3cdb785ab260d1a70aa14d96efd7451cea0aa73db82eaa1c538bf6","last_reissued_at":"2026-05-18T03:57:27.643908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:27.643908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher Order City Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Gemsa, Chih-Hung Liu, Dorothea Wagner, D. T. Lee","submitted_at":"2012-04-19T15:20:38Z","abstract_excerpt":"We investigate higher-order Voronoi diagrams in the city metric. This metric is induced by quickest paths in the L1 metric in the presence of an accelerating transportation network of axis-parallel line segments. For the structural complexity of kth-order city Voronoi diagrams of n point sites, we show an upper bound of O(k(n - k) + kc) and a lower bound of {\\Omega}(n + kc), where c is the complexity of the transportation network. This is quite different from the bound O(k(n - k)) in the Euclidean metric. For the special case where k = n - 1 the complexity in the Euclidean metric is O(n), whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4374","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":"1204.4374","created_at":"2026-05-18T03:57:27.644006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4374v1","created_at":"2026-05-18T03:57:27.644006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4374","created_at":"2026-05-18T03:57:27.644006+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHOWKNXPHTNX","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHOWKNXPHTNXQWVS","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHOWKNXP","created_at":"2026-05-18T12:27:06.952714+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/GHOWKNXPHTNXQWVSMDI2OCVBJW","json":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW.json","graph_json":"https://pith.science/api/pith-number/GHOWKNXPHTNXQWVSMDI2OCVBJW/graph.json","events_json":"https://pith.science/api/pith-number/GHOWKNXPHTNXQWVSMDI2OCVBJW/events.json","paper":"https://pith.science/paper/GHOWKNXP"},"agent_actions":{"view_html":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW","download_json":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW.json","view_paper":"https://pith.science/paper/GHOWKNXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4374&json=true","fetch_graph":"https://pith.science/api/pith-number/GHOWKNXPHTNXQWVSMDI2OCVBJW/graph.json","fetch_events":"https://pith.science/api/pith-number/GHOWKNXPHTNXQWVSMDI2OCVBJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW/action/storage_attestation","attest_author":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW/action/author_attestation","sign_citation":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW/action/citation_signature","submit_replication":"https://pith.science/pith/GHOWKNXPHTNXQWVSMDI2OCVBJW/action/replication_record"}},"created_at":"2026-05-18T03:57:27.644006+00:00","updated_at":"2026-05-18T03:57:27.644006+00:00"}