{"as_of":"2026-08-19T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4b15aa7a1eb5ed4e6d3dc0eddf16061bf75651a3498192654b357d879c9f30b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:11:52.113059Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T10:11:52.167015Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.00805","last_updated":"2018-06-03T14:56:42Z","snapshot_observed_at":"2026-08-18T10:12:17.515055Z","submitted_at":"2018-06-03T14:56:42Z","title":"Admissible Abstractions for Near-optimal Task and Motion Planning","version":1},"cited_work":{"arxiv_id":"1806.00805","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.00805","snapshot_observed_at":"2026-08-16T10:11:52.167015Z","title":"Admissible Abstractions for Near-optimal Task and Motion Planning","venue":"cs.AI","work_id":"ce4ed089-6f17-4c9c-b1cc-556107bf4ef3","year":2018},"citing_paper":{"arxiv_id":"2504.18899","last_updated":"2025-04-29T16:26:35Z","snapshot_observed_at":"2026-08-18T10:11:59.073560Z","submitted_at":"2025-04-26T12:07:52Z","title":"Hierarchical Temporal Logic Task and Motion Planning for Multi-Robot Systems","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T10:11:52.113059Z"},"links":{"cited_paper":"/paper/1806.00805","citing_paper":"/paper/2504.18899"},"observation_digest":"sha256:07183e401069c5815e64822390635c4802cbcf293241a0d91362157b17c43c36","observation_id":"4f2a4d9b-bc70-46d0-8e61-74d11eed68cd","resolution":{"observed_at":"2026-08-16T10:11:52.174354Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1806.00805/citation-record","integrity":"/paper/1806.00805/integrity","json":"/paper/1806.00805/citation-record.json","paper":"/paper/1806.00805"},"outbound":[],"paper":{"arxiv_id":"1806.00805","last_updated":"2018-06-03T14:56:42Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T10:12:17.515055Z","submitted_at":"2018-06-03T14:56:42Z","title":"Admissible Abstractions for Near-optimal Task and Motion Planning"},"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 1 inbound Pith citation observation for arXiv:1806.00805."}