{"as_of":"2026-08-08T16:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35fc5369529e710c9d5f326c35039147c9d8a5835a4323b32b00b20a5901cd99","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:39.045014Z","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-07-02T11:06:52.505859Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.00311","last_updated":"2023-09-30T08:50:49Z","snapshot_observed_at":"2026-08-04T15:28:49.017902Z","submitted_at":"2023-09-30T08:50:49Z","title":"Efficient Planning with Latent Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00311","snapshot_observed_at":"2026-08-07T14:20:39.045014Z","title":"Efficient planning with latent diffusion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20350","last_updated":"2025-05-26T03:42:20Z","snapshot_observed_at":"2026-08-08T01:01:01.114971Z","submitted_at":"2025-05-26T03:42:20Z","title":"Decision Flow Policy Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:39.045014Z"},"links":{"cited_paper":"/paper/2310.00311","citing_paper":"/paper/2505.20350"},"observation_digest":"sha256:9c61cbf25e4d11b2f182e139db2cec8eba4cbe9705df1f74f6fd046279ea8f8c","observation_id":"65e40278-984b-4041-8211-9b2dc7e9e0a3","resolution":{"observed_at":"2026-08-07T14:20:39.045014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00311","last_updated":"2023-09-30T08:50:49Z","snapshot_observed_at":"2026-08-04T15:28:49.017902Z","submitted_at":"2023-09-30T08:50:49Z","title":"Efficient Planning with Latent Diffusion","version":1},"cited_work":{"arxiv_id":"2310.00311","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00311","snapshot_observed_at":"2026-07-02T11:06:52.505859Z","title":"Efficient planning with latent diffusion.arXiv preprint arXiv:2310.00311","venue":null,"work_id":"25982c81-60c9-4e9a-93f6-46903db2a017","year":2023},"citing_paper":{"arxiv_id":"2605.02777","last_updated":"2026-05-05T02:44:52Z","snapshot_observed_at":"2026-07-06T23:15:46.390406Z","submitted_at":"2026-05-04T16:19:42Z","title":"Decoupled Guidance Diffusion for Adaptive Offline Safe Reinforcement Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T15:44:36.262834Z"},"links":{"cited_paper":"/paper/2310.00311","citing_paper":"/paper/2605.02777"},"observation_digest":"sha256:2b9f1fd645e8cf1972ca6fde81a1eca1e15c215b8afaf5f0d14289d5625d62d8","observation_id":"f1f2c9e9-d960-42f8-84a1-4f0be1c68039","resolution":{"observed_at":"2026-05-11T16:36:09.872505Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00311","last_updated":"2023-09-30T08:50:49Z","snapshot_observed_at":"2026-08-04T15:28:49.017902Z","submitted_at":"2023-09-30T08:50:49Z","title":"Efficient Planning with Latent Diffusion","version":1},"cited_work":{"arxiv_id":"2310.00311","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00311","snapshot_observed_at":"2026-07-02T11:06:52.505859Z","title":"Efficient planning with latent diffusion.arXiv preprint arXiv:2310.00311","venue":null,"work_id":"25982c81-60c9-4e9a-93f6-46903db2a017","year":2023},"citing_paper":{"arxiv_id":"2606.02209","last_updated":"2026-06-01T13:10:16Z","snapshot_observed_at":"2026-08-03T04:41:01.110839Z","submitted_at":"2026-06-01T13:10:16Z","title":"Conditional Graph Diffusion for Negotiation Support: Overcoming Discrete Infeasibility and Preference Elicitation Gaps","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T12:18:58.904218Z"},"links":{"cited_paper":"/paper/2310.00311","citing_paper":"/paper/2606.02209"},"observation_digest":"sha256:6812efd9e0d01f0ff7f586486a009c1608e329a4d3539cc49974a081b2ad1ca7","observation_id":"02e37448-85b7-42b1-8e92-2845d03b849b","resolution":{"observed_at":"2026-07-02T01:16:24.731066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00311","last_updated":"2023-09-30T08:50:49Z","snapshot_observed_at":"2026-08-04T15:28:49.017902Z","submitted_at":"2023-09-30T08:50:49Z","title":"Efficient Planning with Latent Diffusion","version":1},"cited_work":{"arxiv_id":"2310.00311","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00311","snapshot_observed_at":"2026-07-02T11:06:52.505859Z","title":"Efficient planning with latent diffusion.arXiv preprint arXiv:2310.00311","venue":null,"work_id":"25982c81-60c9-4e9a-93f6-46903db2a017","year":2023},"citing_paper":{"arxiv_id":"2607.01166","last_updated":"2026-07-01T16:52:49Z","snapshot_observed_at":"2026-08-02T05:07:13.258277Z","submitted_at":"2026-07-01T16:52:49Z","title":"Structured 4D Latent Predictive Model for Robot Planning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-02T11:02:42.282246Z"},"links":{"cited_paper":"/paper/2310.00311","citing_paper":"/paper/2607.01166"},"observation_digest":"sha256:39329e8c4393acad22a5ff2fe86249b4cf5dc309cdfc7f768611117f9aa74738","observation_id":"bcc1e6bc-61a2-4132-a198-fc1e961e7dc0","resolution":{"observed_at":"2026-07-02T11:06:52.507243Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.00311/citation-record","integrity":"/paper/2310.00311/integrity","json":"/paper/2310.00311/citation-record.json","paper":"/paper/2310.00311"},"outbound":[],"paper":{"arxiv_id":"2310.00311","last_updated":"2023-09-30T08:50:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T15:28:49.017902Z","submitted_at":"2023-09-30T08:50:49Z","title":"Efficient Planning with Latent Diffusion"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2310.00311."}