{"as_of":"2026-08-23T00:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00a519eae3cbd34e9076d423399c3f551098b637a4fb22288ac9c280bb258b9a","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-22T06:32:14.747728+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-10T20:11:48.608075Z","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-06T18:21:52.159012Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.05766","last_updated":"2024-06-04T20:55:04Z","snapshot_observed_at":"2026-08-17T10:34:38.412426Z","submitted_at":"2024-03-09T02:27:45Z","title":"FLAP: Flow-Adhering Planning with Constrained Decoding in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05766","snapshot_observed_at":"2026-08-10T20:11:48.608075Z","title":"FLAP: flow-adhering planning with constrained decoding in llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09316","last_updated":"2025-01-16T06:14:58Z","snapshot_observed_at":"2026-08-17T01:53:40.193404Z","submitted_at":"2025-01-16T06:14:58Z","title":"SOP-Agent: Empower General Purpose AI Agent with Domain-Specific SOPs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T20:11:48.608075Z"},"links":{"cited_paper":"/paper/2403.05766","citing_paper":"/paper/2501.09316"},"observation_digest":"sha256:efaecf0993bd75f16f109bb4da9bc181c40a16c4bc69c216ee066db32624fcf1","observation_id":"c92e1551-e177-432c-b4d6-ea8bfb3111a7","resolution":{"observed_at":"2026-08-10T20:11:48.608075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05766","last_updated":"2024-06-04T20:55:04Z","snapshot_observed_at":"2026-08-17T10:34:38.412426Z","submitted_at":"2024-03-09T02:27:45Z","title":"FLAP: Flow-Adhering Planning with Constrained Decoding in LLMs","version":3},"cited_work":{"arxiv_id":"2403.05766","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.05766","snapshot_observed_at":"2026-08-06T18:21:52.159012Z","title":"FLAP: Flow-Adhering Planning with Constrained Decoding in LLMs","venue":"cs.CL","work_id":"a8e8bd67-2186-4441-9b9f-073dde652d60","year":2024},"citing_paper":{"arxiv_id":"2507.08496","last_updated":"2025-07-11T11:18:49Z","snapshot_observed_at":"2026-08-21T15:21:35.353593Z","submitted_at":"2025-07-11T11:18:49Z","title":"LLaPa: A Vision-Language Model Framework for Counterfactual-Aware Procedural Planning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T18:21:48.407968Z"},"links":{"cited_paper":"/paper/2403.05766","citing_paper":"/paper/2507.08496"},"observation_digest":"sha256:0e39d372533b15416bd10cde6278d34522f4c1c0ad39f501e23bd3087fbab5d3","observation_id":"e44564d2-74e2-4c89-95df-10e4106c651a","resolution":{"observed_at":"2026-08-06T18:21:52.259006Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.05766/citation-record","integrity":"/paper/2403.05766/integrity","json":"/paper/2403.05766/citation-record.json","paper":"/paper/2403.05766"},"outbound":[],"paper":{"arxiv_id":"2403.05766","last_updated":"2024-06-04T20:55:04Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T10:34:38.412426Z","submitted_at":"2024-03-09T02:27:45Z","title":"FLAP: Flow-Adhering Planning with Constrained Decoding in LLMs"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.05766."}