{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2OIOG6T67GMLHXCGCQARAZG5HO","short_pith_number":"pith:2OIOG6T6","schema_version":"1.0","canonical_sha256":"d390e37a7ef998b3dc4614011064dd3ba637289b34760faaa3ed345fa3c799c9","source":{"kind":"arxiv","id":"1309.2884","version":2},"attestation_state":"computed","paper":{"title":"Causal Domain Restriction for Eikonal Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Adam Chacon, Alexander Vladimirsky, Zachary Clawson","submitted_at":"2013-09-11T16:37:02Z","abstract_excerpt":"Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several fast numerical algorithms have been developed to solve such equations on the whole domain. In this paper we consider a somewhat different problem, where the solution is needed at one specific point, so we restrict the computations to a neighborhood of the characteristic. We explain how heuristic under/over-estimate functions can be used to obtain a causal domain restriction, significantly decreasing the computational"},"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":"1309.2884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-11T16:37:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"49e48a68859e12af69c0d2d063401dd87198d5b09090f214451fc7ec762aab86","abstract_canon_sha256":"1aeb7c768081d6143925baecaca722fcdc729be26ebe9001a53b907c57101799"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:26.692916Z","signature_b64":"Ixw6kNpHwrgicum0zryBoTweJwzqK8erxENYCsOACsSS6K1CEoImrZN9sWxJ7ZemdQmcx9sF2iclo12FheV6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d390e37a7ef998b3dc4614011064dd3ba637289b34760faaa3ed345fa3c799c9","last_reissued_at":"2026-05-18T01:23:26.692368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:26.692368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Causal Domain Restriction for Eikonal Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Adam Chacon, Alexander Vladimirsky, Zachary Clawson","submitted_at":"2013-09-11T16:37:02Z","abstract_excerpt":"Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several fast numerical algorithms have been developed to solve such equations on the whole domain. In this paper we consider a somewhat different problem, where the solution is needed at one specific point, so we restrict the computations to a neighborhood of the characteristic. We explain how heuristic under/over-estimate functions can be used to obtain a causal domain restriction, significantly decreasing the computational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2884","kind":"arxiv","version":2},"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":"1309.2884","created_at":"2026-05-18T01:23:26.692451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2884v2","created_at":"2026-05-18T01:23:26.692451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2884","created_at":"2026-05-18T01:23:26.692451+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OIOG6T67GML","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OIOG6T67GMLHXCG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OIOG6T6","created_at":"2026-05-18T12:27:32.513160+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/2OIOG6T67GMLHXCGCQARAZG5HO","json":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO.json","graph_json":"https://pith.science/api/pith-number/2OIOG6T67GMLHXCGCQARAZG5HO/graph.json","events_json":"https://pith.science/api/pith-number/2OIOG6T67GMLHXCGCQARAZG5HO/events.json","paper":"https://pith.science/paper/2OIOG6T6"},"agent_actions":{"view_html":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO","download_json":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO.json","view_paper":"https://pith.science/paper/2OIOG6T6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2884&json=true","fetch_graph":"https://pith.science/api/pith-number/2OIOG6T67GMLHXCGCQARAZG5HO/graph.json","fetch_events":"https://pith.science/api/pith-number/2OIOG6T67GMLHXCGCQARAZG5HO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO/action/storage_attestation","attest_author":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO/action/author_attestation","sign_citation":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO/action/citation_signature","submit_replication":"https://pith.science/pith/2OIOG6T67GMLHXCGCQARAZG5HO/action/replication_record"}},"created_at":"2026-05-18T01:23:26.692451+00:00","updated_at":"2026-05-18T01:23:26.692451+00:00"}