{"as_of":"2026-08-09T03:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:baec33902cd432d2f025ecb91b231a921149fd8380bc4c3c1e38e23379df14e6","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T16:51:27.620021Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.01626","last_updated":"2025-03-03T15:00:55Z","snapshot_observed_at":"2026-08-07T17:33:25.273423Z","submitted_at":"2025-03-03T15:00:55Z","title":"A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01626","snapshot_observed_at":"2026-08-01T16:51:27.620021Z","title":"A Note on the Time Complexity of Using Sub- division Methods for the Approximation of Fibers,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17852","last_updated":"2026-07-20T11:46:57Z","snapshot_observed_at":"2026-08-07T12:51:40.000976Z","submitted_at":"2026-07-20T11:46:57Z","title":"Lifelong Localization in Dynamic Indoor Environments Combining Odometry with Sparse Distance Sampling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T16:51:27.620021Z"},"links":{"cited_paper":"/paper/2503.01626","citing_paper":"/paper/2607.17852"},"observation_digest":"sha256:f5ddd809150f7f5cb2f2c3c008c946dea1161f848787aeceeab2c6c7f2777abe","observation_id":"1cb3e307-dcb6-4539-9a99-aac05c6b9d65","resolution":{"observed_at":"2026-08-01T16:51:27.620021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01626","last_updated":"2025-03-03T15:00:55Z","snapshot_observed_at":"2026-08-07T17:33:25.273423Z","submitted_at":"2025-03-03T15:00:55Z","title":"A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01626","snapshot_observed_at":"2026-08-01T16:45:59.993989Z","title":"A note on the time complexity of using subdivi- sion methods for the approximation of fibers,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17898","last_updated":"2026-07-20T12:46:27Z","snapshot_observed_at":"2026-08-05T10:26:15.649094Z","submitted_at":"2026-07-20T12:46:27Z","title":"Manifold-Guided Motion Planning for Tight Assemblies","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T16:45:59.993989Z"},"links":{"cited_paper":"/paper/2503.01626","citing_paper":"/paper/2607.17898"},"observation_digest":"sha256:809a5c8b980006d017e0bd3500176714ef54772afad660d303d3a892c5346cec","observation_id":"e955912a-ad3a-424e-941d-ce735798bae7","resolution":{"observed_at":"2026-08-01T16:45:59.993989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.01626/citation-record","integrity":"/paper/2503.01626/integrity","json":"/paper/2503.01626/citation-record.json","paper":"/paper/2503.01626"},"outbound":[],"paper":{"arxiv_id":"2503.01626","last_updated":"2025-03-03T15:00:55Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-07T17:33:25.273423Z","submitted_at":"2025-03-03T15:00:55Z","title":"A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.01626."}