{"as_of":"2026-08-07T09:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c300f457a73686e4f7d1bbd6131a6a405c24c008b9362131176013b10c14cb1","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T23:33:05.515359Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06-30T22:28:27.179593Z","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-07-01T13:55:46.678085Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"cited_work":{"arxiv_id":"2511.05355","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.05355","snapshot_observed_at":"2026-07-01T13:55:46.678085Z","title":"Sad-flower: Flow matching for safe, admissible, and dynamically consistent planning.arXiv preprint arXiv:2511.05355","venue":"cs.LG","work_id":"bb374526-aeb1-437d-82bd-b3d687bf475b","year":2025},"citing_paper":{"arxiv_id":"2605.12053","last_updated":"2026-06-10T10:26:01Z","snapshot_observed_at":"2026-08-02T22:59:07.016035Z","submitted_at":"2026-05-12T12:35:25Z","title":"Closing the Motion Execution Gap: From Semantic Motion Task Constraints to Kinematic Control","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T05:18:56.968905Z"},"links":{"cited_paper":"/paper/2511.05355","citing_paper":"/paper/2605.12053"},"observation_digest":"sha256:6ed9c371f2ad14f8253ad1329e1e9c5fbfc98fbac113cba00697f87c2b6ee405","observation_id":"b3145609-8b1d-4e25-a609-5b177086a2a5","resolution":{"observed_at":"2026-06-09T03:07:05.890846Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"cited_work":{"arxiv_id":"2511.05355","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.05355","snapshot_observed_at":"2026-07-01T13:55:46.678085Z","title":"Sad-flower: Flow matching for safe, admissible, and dynamically consistent planning.arXiv preprint arXiv:2511.05355","venue":"cs.LG","work_id":"bb374526-aeb1-437d-82bd-b3d687bf475b","year":2025},"citing_paper":{"arxiv_id":"2605.12053","last_updated":"2026-06-10T10:26:01Z","snapshot_observed_at":"2026-08-02T22:59:07.016035Z","submitted_at":"2026-05-12T12:35:25Z","title":"Closing the Motion Execution Gap: From Semantic Motion Task Constraints to Kinematic Control","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T22:28:27.179593Z"},"links":{"cited_paper":"/paper/2511.05355","citing_paper":"/paper/2605.12053"},"observation_digest":"sha256:c124ed86e234abd5b365cf3e8ea6cf496a770ce82140da4ce767f32abd6859a7","observation_id":"9c792737-0351-4cd5-bb72-5cb1d6e6679c","resolution":{"observed_at":"2026-07-01T13:55:46.679300Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.05355/citation-record","integrity":"/paper/2511.05355/integrity","json":"/paper/2511.05355/citation-record.json","paper":"/paper/2511.05355"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:33:05.331662Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T23:33:05.331662Z"},"links":{"citing_paper":"/paper/2511.05355"},"observation_digest":"sha256:fec97b465b6215d00a64c1e410641a168b7e21b4fe3b62eca5f39d8fc693a05e","observation_id":"2f11bbb7-2812-4771-a3fd-9fadb4d38568","resolution":{"observed_at":"2026-08-03T23:33:05.331662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:33:05.408014Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T23:33:05.408014Z"},"links":{"citing_paper":"/paper/2511.05355"},"observation_digest":"sha256:dae58bf721396a16d97072870ec9bac7c7d6c41c6cd1a554f86924dde0ea6e50","observation_id":"8dc47df3-e765-4753-943a-991140cd14c9","resolution":{"observed_at":"2026-08-03T23:33:05.408014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:33:05.464359Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T23:33:05.464359Z"},"links":{"citing_paper":"/paper/2511.05355"},"observation_digest":"sha256:3b200b2843f4038ffbfba4bbc80b57bcb65122edb2780fba6901cbdac87a21c2","observation_id":"288468c2-36da-4b33-b384-8ce9d3817db0","resolution":{"observed_at":"2026-08-03T23:33:05.464359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:33:05.515359Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T23:33:05.515359Z"},"links":{"citing_paper":"/paper/2511.05355"},"observation_digest":"sha256:1be5e0754ebd0710caba03c40a5c90b7984c566d239df1dd67b3c638271b8bf2","observation_id":"99e1d9d8-e610-4a0c-92ec-5cc9418d7fd8","resolution":{"observed_at":"2026-08-03T23:33:05.515359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.05355","last_updated":"2026-06-07T17:07:48Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T23:33:04.018641Z","submitted_at":"2025-11-07T15:46:44Z","title":"SAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":4},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 2 inbound Pith citation observations for arXiv:2511.05355."}