{"as_of":"2026-08-15T15:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04355ebfef2b15de28d91a74d1d4e18f39836bda1c6aea7960eee96aebeb9e6a","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-15T06:32:42.880941+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-12T18:12:06.369284Z","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-05-16T08:25:18.118930Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.01576","last_updated":"2023-05-22T15:49:42Z","snapshot_observed_at":"2026-08-15T09:05:12.902496Z","submitted_at":"2022-11-03T04:12:04Z","title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","version":2},"cited_work":{"arxiv_id":"2211.01576","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.01576","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ef941112-c99a-4d4b-bf2f-2db6efc700de","year":2022},"citing_paper":{"arxiv_id":"2409.01652","last_updated":"2024-11-12T04:33:26Z","snapshot_observed_at":"2026-07-29T23:37:00.228879Z","submitted_at":"2024-09-03T06:45:22Z","title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-05-16T08:25:17.847571Z"},"links":{"cited_paper":"/paper/2211.01576","citing_paper":"/paper/2409.01652"},"observation_digest":"sha256:398fdfb25950ab98280ed9af1e5b9f2c426734870b072a792b58e9d5b770653f","observation_id":"a86487cf-0246-4a5b-aaee-6aa486d9133f","resolution":{"observed_at":"2026-05-16T08:25:18.121092Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01576","last_updated":"2023-05-22T15:49:42Z","snapshot_observed_at":"2026-08-15T09:05:12.902496Z","submitted_at":"2022-11-03T04:12:04Z","title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01576","snapshot_observed_at":"2026-08-12T18:12:06.369284Z","title":"Sequence-based plan feasibility prediction for efficient task and motion planning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.369284Z"},"links":{"cited_paper":"/paper/2211.01576","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:658ac2f901b8d8812c22ed0d4553ca4d866c51893eb98ab64d39918aac7e076f","observation_id":"bc5a3920-0f88-4339-889d-77ae2ed11098","resolution":{"observed_at":"2026-08-12T18:12:06.369284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.01576/citation-record","integrity":"/paper/2211.01576/integrity","json":"/paper/2211.01576/citation-record.json","paper":"/paper/2211.01576"},"outbound":[],"paper":{"arxiv_id":"2211.01576","last_updated":"2023-05-22T15:49:42Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T09:05:12.902496Z","submitted_at":"2022-11-03T04:12:04Z","title":"Sequence-Based Plan Feasibility Prediction for Efficient 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.01576."}