{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XTJHGO4Q63XT67YNPV2FU6H37D","short_pith_number":"pith:XTJHGO4Q","schema_version":"1.0","canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","source":{"kind":"arxiv","id":"1102.3165","version":1},"attestation_state":"computed","paper":{"title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GR","cs.RO"],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Hristo Djidjev, Joerg-Rudiger Sack, Lyudmil Aleksandrov","submitted_at":"2011-02-15T19:50:45Z","abstract_excerpt":"We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\\D$, consisting of $n$ tetrahedra with positive weights, and a real number $\\eps\\in(0,1)$, our algorithm constructs paths in $\\D$ from a fixed source vertex to all vertices of $\\D$, whose costs are at most $1+\\eps$ times the costs of (weighted) shortest paths, in $O(\\C(\\D)\\frac{n}{\\eps^{2.5}}\\log\\frac{n}{\\eps}\\log^3\\frac{1}{\\eps})$ time, where $\\C(\\D)$ is a geometric parameter related to the aspect ratios of tetrahedra. The efficiency of th"},"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":"1102.3165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-15T19:50:45Z","cross_cats_sorted":["cs.DS","cs.GR","cs.RO"],"title_canon_sha256":"4c709f2187f35faf7318063581cdbe23090f342aba57b85a8a894ac7bf9bc928","abstract_canon_sha256":"8b8f4c050e0840e4869497eccb6698ab425245f71470ddda70ff3267e0d8c48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.299918Z","signature_b64":"osUbwFej2NekXBBTNNaSBLdPHMpaSAbTmr+hTSF93pwswfW3kUaFxBzbRPF0HNLiRkO+BZ/WD17/V5/b0n7SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","last_reissued_at":"2026-05-18T04:28:38.299519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.299519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GR","cs.RO"],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Hristo Djidjev, Joerg-Rudiger Sack, Lyudmil Aleksandrov","submitted_at":"2011-02-15T19:50:45Z","abstract_excerpt":"We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\\D$, consisting of $n$ tetrahedra with positive weights, and a real number $\\eps\\in(0,1)$, our algorithm constructs paths in $\\D$ from a fixed source vertex to all vertices of $\\D$, whose costs are at most $1+\\eps$ times the costs of (weighted) shortest paths, in $O(\\C(\\D)\\frac{n}{\\eps^{2.5}}\\log\\frac{n}{\\eps}\\log^3\\frac{1}{\\eps})$ time, where $\\C(\\D)$ is a geometric parameter related to the aspect ratios of tetrahedra. The efficiency of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3165","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":"1102.3165","created_at":"2026-05-18T04:28:38.299575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3165v1","created_at":"2026-05-18T04:28:38.299575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3165","created_at":"2026-05-18T04:28:38.299575+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTJHGO4Q63XT","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTJHGO4Q63XT67YN","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTJHGO4Q","created_at":"2026-05-18T12:26:47.523578+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/XTJHGO4Q63XT67YNPV2FU6H37D","json":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D.json","graph_json":"https://pith.science/api/pith-number/XTJHGO4Q63XT67YNPV2FU6H37D/graph.json","events_json":"https://pith.science/api/pith-number/XTJHGO4Q63XT67YNPV2FU6H37D/events.json","paper":"https://pith.science/paper/XTJHGO4Q"},"agent_actions":{"view_html":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D","download_json":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D.json","view_paper":"https://pith.science/paper/XTJHGO4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3165&json=true","fetch_graph":"https://pith.science/api/pith-number/XTJHGO4Q63XT67YNPV2FU6H37D/graph.json","fetch_events":"https://pith.science/api/pith-number/XTJHGO4Q63XT67YNPV2FU6H37D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/action/storage_attestation","attest_author":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/action/author_attestation","sign_citation":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/action/citation_signature","submit_replication":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/action/replication_record"}},"created_at":"2026-05-18T04:28:38.299575+00:00","updated_at":"2026-05-18T04:28:38.299575+00:00"}