{"as_of":"2026-08-23T17:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc387f6b23c83c91aa4087f7550e738d24ed96692915f35cddbf7a019b7caea9","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-23T06:30:58.430688+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-06T19:56:40.639332Z","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-06T19:56:40.967230Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.00955","last_updated":"2023-07-09T20:55:43Z","snapshot_observed_at":"2026-08-19T07:17:00.742894Z","submitted_at":"2022-05-02T14:56:51Z","title":"Coordination-free Multi-robot Path Planning for Congestion Reduction Using Topological Reasoning","version":3},"cited_work":{"arxiv_id":"2205.00955","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.00955","snapshot_observed_at":"2026-08-06T19:56:40.967230Z","title":"Coordination-free Multi-robot Path Planning for Congestion Reduction Using Topological Reasoning","venue":"cs.RO","work_id":"02302ca6-20ee-4561-ab0b-623d543e081d","year":2022},"citing_paper":{"arxiv_id":"2507.04263","last_updated":"2025-07-06T06:45:14Z","snapshot_observed_at":"2026-08-15T22:10:58.158718Z","submitted_at":"2025-07-06T06:45:14Z","title":"SRefiner: Soft-Braid Attention for Multi-Agent Trajectory Refinement","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:56:40.639332Z"},"links":{"cited_paper":"/paper/2205.00955","citing_paper":"/paper/2507.04263"},"observation_digest":"sha256:9e8d3b3fd172f142ed8c6e8c85709beded352ed9bb712b784b4e0c0bcbc1dbeb","observation_id":"2f952abf-e6a8-4893-aec1-4763196ea9e7","resolution":{"observed_at":"2026-08-06T19:56:40.973754Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.00955/citation-record","integrity":"/paper/2205.00955/integrity","json":"/paper/2205.00955/citation-record.json","paper":"/paper/2205.00955"},"outbound":[],"paper":{"arxiv_id":"2205.00955","last_updated":"2023-07-09T20:55:43Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T07:17:00.742894Z","submitted_at":"2022-05-02T14:56:51Z","title":"Coordination-free Multi-robot Path Planning for Congestion Reduction Using Topological Reasoning"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2205.00955."}