{"as_of":"2026-08-06T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b717a17a2d6d17873731d11e7bd05121fd895771caf0d837fc4758023dc3b91d","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-05T06:32:48.257954+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-07-09T22:14:39.794031Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14891","last_updated":"2021-10-28T05:08:30Z","snapshot_observed_at":"2026-07-06T12:02:52.936070Z","submitted_at":"2021-10-28T05:08:30Z","title":"Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery","version":1},"cited_work":{"arxiv_id":"2110.14891","doi":"10.48550/arxiv.2110.14891","metadata_source":"pith","pith_arxiv_id":"2110.14891","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery","venue":"cs.MA","work_id":"b8efcd2b-5b29-447e-af04-9f9c68d7ba7d","year":2021},"citing_paper":{"arxiv_id":"2607.06990","last_updated":"2026-07-08T04:23:41Z","snapshot_observed_at":"2026-08-02T20:43:49.646497Z","submitted_at":"2026-07-08T04:23:41Z","title":"A Closed-Loop Multi-Agent Framework for Robust Multi-Robot Manipulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T22:14:39.794031Z"},"links":{"cited_paper":"/paper/2110.14891","citing_paper":"/paper/2607.06990"},"observation_digest":"sha256:7df17ed52ab463a4b7e759582dedf1562324eba3ce7a99d10fdeff28e2b4cd85","observation_id":"d217bfee-0ba0-408a-8a45-e76bec46a693","resolution":{"observed_at":"2026-07-09T22:16:36.256929Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14891/citation-record","integrity":"/paper/2110.14891/integrity","json":"/paper/2110.14891/citation-record.json","paper":"/paper/2110.14891"},"outbound":[],"paper":{"arxiv_id":"2110.14891","last_updated":"2021-10-28T05:08:30Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-07-06T12:02:52.936070Z","submitted_at":"2021-10-28T05:08:30Z","title":"Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.14891."}