{"as_of":"2026-08-19T20:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b93c923e1ca26afca425356fc6ea61cfab354043a642204827c380ed96966fa","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:57:22.474549Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T22:16:16.575230Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-08-10T19:39:55.579376Z","title":"A survey of algorithms for geodesic paths and distances","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.09900","last_updated":"2025-01-17T01:13:44Z","snapshot_observed_at":"2026-08-17T02:34:17.992578Z","submitted_at":"2025-01-17T01:13:44Z","title":"SBAMDT: Bayesian Additive Decision Trees with Adaptive Soft Semi-multivariate Split Rules","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T19:39:55.579376Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2501.09900"},"observation_digest":"sha256:829ea9effc670805c66b3c1717c9263b2b29c5a8a57a0c0b6e23f26bbb80f752","observation_id":"75fd21f6-c2de-4016-ba15-2b1ffd7957f3","resolution":{"observed_at":"2026-08-10T19:39:55.579376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-08-15T22:57:22.474549Z","title":"& Qin, Y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.05961","last_updated":"2026-07-15T20:34:56Z","snapshot_observed_at":"2026-08-15T22:49:43.366806Z","submitted_at":"2025-05-09T11:21:51Z","title":"GEORCE: A Fast New Control Algorithm for Computing Geodesics","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T22:57:22.474549Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2505.05961"},"observation_digest":"sha256:61fa9df4285b3e8db19fd10b3480b6ec62b10eaa01b16e866463596a76a396cc","observation_id":"56ccdd94-183d-46e4-aef3-00b6d0344334","resolution":{"observed_at":"2026-08-15T22:57:22.474549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-08-15T20:14:54.859777Z","title":"Crane, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14732","last_updated":"2025-05-20T02:29:55Z","snapshot_observed_at":"2026-08-19T17:49:57.255771Z","submitted_at":"2025-05-20T02:29:55Z","title":"Geodesic distance approximation using a surface finite element method for the $p$-Laplacian","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:14:54.859777Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2505.14732"},"observation_digest":"sha256:adb2b837471b58c0971cacd444069bb7692e2241016af8e96c5563736b288744","observation_id":"a544d819-d35d-43db-b198-5a8e61b786c0","resolution":{"observed_at":"2026-08-15T20:14:54.859777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":"2007.10430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-07-01T22:16:16.575230Z","title":"Guo, Z., Zhang, R., Qiu, L., Li, X., and Heng, P.-A","venue":null,"work_id":"a8afa234-7f64-4245-b751-c309d9b88f1e","year":2007},"citing_paper":{"arxiv_id":"2605.25921","last_updated":"2026-05-25T14:57:35Z","snapshot_observed_at":"2026-08-13T00:24:11.824140Z","submitted_at":"2026-05-25T14:57:35Z","title":"Curve Skeletonization in Continuous domain for Meshes and Point Clouds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T19:23:32.460454Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2605.25921"},"observation_digest":"sha256:174fd7851d36e24374b82522284ea6fcd8b1367fe717efc5cd90fc521c0d0c74","observation_id":"b5f608b3-123b-43db-a89a-f4a3d7f85435","resolution":{"observed_at":"2026-06-29T19:23:53.676625Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":"2007.10430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-07-01T22:16:16.575230Z","title":"Guo, Z., Zhang, R., Qiu, L., Li, X., and Heng, P.-A","venue":null,"work_id":"a8afa234-7f64-4245-b751-c309d9b88f1e","year":2007},"citing_paper":{"arxiv_id":"2606.02268","last_updated":"2026-06-01T13:54:26Z","snapshot_observed_at":"2026-08-08T10:08:12.277563Z","submitted_at":"2026-06-01T13:54:26Z","title":"From Extrinsic to Intrinsic: Geodesic-Guided Representation Learning for 3D Geometric Data","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T15:32:45.116189Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2606.02268"},"observation_digest":"sha256:7ee3e812e7f4986bdccc0d96b1b0227ca430cde6cc081337d4155e977c075549","observation_id":"11a5e980-985f-472c-9ad7-03244acb4c26","resolution":{"observed_at":"2026-07-01T22:16:16.576767Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10430","snapshot_observed_at":"2026-08-03T01:34:32.437962Z","title":"Crane, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28886","last_updated":"2026-07-30T23:05:15Z","snapshot_observed_at":"2026-08-19T18:42:53.947117Z","submitted_at":"2026-07-30T23:05:15Z","title":"Differentiable Approximations for Distance Queries","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T01:34:32.437962Z"},"links":{"cited_paper":"/paper/2007.10430","citing_paper":"/paper/2607.28886"},"observation_digest":"sha256:3c6292c676565944b5be99e708d030e72a5fea465e14eb251fafa43a81b454d1","observation_id":"31fb9030-77c4-4a68-8932-7367a451d54f","resolution":{"observed_at":"2026-08-03T01:34:32.437962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.10430/citation-record","integrity":"/paper/2007.10430/integrity","json":"/paper/2007.10430/citation-record.json","paper":"/paper/2007.10430"},"outbound":[],"paper":{"arxiv_id":"2007.10430","last_updated":"2020-07-20T19:41:41Z","latest_version":1,"primary_category":"cs.GR","snapshot_observed_at":"2026-08-19T15:00:12.218053Z","submitted_at":"2020-07-20T19:41:41Z","title":"A Survey of Algorithms for Geodesic Paths and Distances"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2007.10430."}