{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XTJHGO4Q63XT67YNPV2FU6H37D","short_pith_number":"pith:XTJHGO4Q","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"},"canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","source":{"kind":"arxiv","id":"1102.3165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3165","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3165v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3165","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"XTJHGO4Q63XT","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XTJHGO4Q63XT67YN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XTJHGO4Q","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XTJHGO4Q63XT67YNPV2FU6H37D","target":"record","payload":{"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"},"canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","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"},"source_kind":"arxiv","source_id":"1102.3165","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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8EyeErsahlkOBx28WI5XL4Tw1A4DMGhwbfb1+sDPWp2rv6++6oSLyv8SKwNi2TeNPog/RGndkwx9TC5RKG0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:00:45.668303Z"},"content_sha256":"0b8581727ef31b3909f6cc19e041015b090db7270dd437bc6553a6f5931ec633","schema_version":"1.0","event_id":"sha256:0b8581727ef31b3909f6cc19e041015b090db7270dd437bc6553a6f5931ec633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XTJHGO4Q63XT67YNPV2FU6H37D","target":"graph","payload":{"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"},"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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pv1pi9qvztJwyFezwxg9Hi6eo8hhmopguTonKgdZvC7zCQuGY4TNanqgeu4ATvyV7lIkzPB3boyalt5rdNmpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:00:45.668950Z"},"content_sha256":"3737747ed509c32800b5883bd4cfd198a78f70ac6992a62767d07703466c493d","schema_version":"1.0","event_id":"sha256:3737747ed509c32800b5883bd4cfd198a78f70ac6992a62767d07703466c493d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/bundle.json","state_url":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTJHGO4Q63XT67YNPV2FU6H37D/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-06-08T02:00:45Z","links":{"resolver":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D","bundle":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/bundle.json","state":"https://pith.science/pith/XTJHGO4Q63XT67YNPV2FU6H37D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTJHGO4Q63XT67YNPV2FU6H37D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XTJHGO4Q63XT67YNPV2FU6H37D","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":"8b8f4c050e0840e4869497eccb6698ab425245f71470ddda70ff3267e0d8c48a","cross_cats_sorted":["cs.DS","cs.GR","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-15T19:50:45Z","title_canon_sha256":"4c709f2187f35faf7318063581cdbe23090f342aba57b85a8a894ac7bf9bc928"},"schema_version":"1.0","source":{"id":"1102.3165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3165","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3165v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3165","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"XTJHGO4Q63XT","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XTJHGO4Q63XT67YN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XTJHGO4Q","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:3737747ed509c32800b5883bd4cfd198a78f70ac6992a62767d07703466c493d","target":"graph","created_at":"2026-05-18T04:28:38Z","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":"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","authors_text":"Anil Maheshwari, Hristo Djidjev, Joerg-Rudiger Sack, Lyudmil Aleksandrov","cross_cats":["cs.DS","cs.GR","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-15T19:50:45Z","title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3165","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:0b8581727ef31b3909f6cc19e041015b090db7270dd437bc6553a6f5931ec633","target":"record","created_at":"2026-05-18T04:28:38Z","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":"8b8f4c050e0840e4869497eccb6698ab425245f71470ddda70ff3267e0d8c48a","cross_cats_sorted":["cs.DS","cs.GR","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-15T19:50:45Z","title_canon_sha256":"4c709f2187f35faf7318063581cdbe23090f342aba57b85a8a894ac7bf9bc928"},"schema_version":"1.0","source":{"id":"1102.3165","kind":"arxiv","version":1}},"canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcd2733b90f6ef3f7f0d7d745a78fbf8e1668fc4eba15105e226e7cf9c4381a8","first_computed_at":"2026-05-18T04:28:38.299519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:38.299519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"osUbwFej2NekXBBTNNaSBLdPHMpaSAbTmr+hTSF93pwswfW3kUaFxBzbRPF0HNLiRkO+BZ/WD17/V5/b0n7SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:38.299918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8581727ef31b3909f6cc19e041015b090db7270dd437bc6553a6f5931ec633","sha256:3737747ed509c32800b5883bd4cfd198a78f70ac6992a62767d07703466c493d"],"state_sha256":"c18896030199a683d5c2bad6656a6d150ef2f0e9ef40b7439da19dba1b9981b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ys5lEY0L0mYSn4JpolOr/+SnpO+8JSzhQbL2roKiuvqJRr8ThXxvXHRhSgDzphAZm4zNnsbSQj7lO6jUBoKjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:00:45.672771Z","bundle_sha256":"ed88adae568b96721b56d322da3b7c899085f03609c384449b5cdb5ffa695b49"}}