{"as_of":"2026-08-20T16:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b8a1075dcc8aec68592586fbd7e0f484a12b503e603d4f542bf99f2212b18db","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:26:55.613769Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-02T01:48:52.205655Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.23278","snapshot_observed_at":"2026-08-02T01:48:52.205655Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14557","last_updated":"2026-07-16T04:37:02Z","snapshot_observed_at":"2026-08-19T16:14:14.617610Z","submitted_at":"2026-07-16T04:37:02Z","title":"Seeing the End at Step Zero: Accelerating Diffusion MLLMs via MLP Sparsity-Aware Truncation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T01:48:52.205655Z"},"links":{"cited_paper":"/paper/2601.23278","citing_paper":"/paper/2607.14557"},"observation_digest":"sha256:d02f09444bbf8eff34ca3e78be28d5e12525e89a85c1ae8bcf6f993a7b574448","observation_id":"e1f6b121-646d-4472-8d1f-766c067b4b36","resolution":{"observed_at":"2026-08-02T01:48:52.205655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.23278/citation-record","integrity":"/paper/2601.23278/integrity","json":"/paper/2601.23278/citation-record.json","paper":"/paper/2601.23278"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:55.360488Z","title":"18 FOCUS: DLLMs Know How to Tame Their Compute Bound","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.360488Z"},"links":{"citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:d36b8d9a0a44dcca8b8a820f092be670bba93ef0beebe4be8f470b8505f8c005","observation_id":"03ac1c42-9565-4413-96de-7842529327b7","resolution":{"observed_at":"2026-08-03T06:26:55.360488Z","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-03T06:26:55.417493Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.417493Z"},"links":{"citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:4d0089519076750d15abf51b712aca39c554864f249e72a3ca129074b92cb2db","observation_id":"5721acd8-4d03-4cfb-866c-4c6bccc5e81f","resolution":{"observed_at":"2026-08-03T06:26:55.417493Z","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-03T06:26:55.478730Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.478730Z"},"links":{"citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:11a90765388d41d9bfca105476d80f0ca18f3b2d205a23e3858fb27a4c9535fd","observation_id":"428fa1ec-701e-46d2-a816-f822aee0946a","resolution":{"observed_at":"2026-08-03T06:26:55.478730Z","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-03T06:26:55.553223Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.553223Z"},"links":{"citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:b5985fdafae58bebc3b8338ffacdcbee0b99caaf760bbbd2888265d0bc796e52","observation_id":"fa4d190f-a952-43c0-bdb1-1f8254e0efdb","resolution":{"observed_at":"2026-08-03T06:26:55.553223Z","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-03T06:26:55.613769Z","title":"State Persistence and ResetWhen a block completes processing (all tokens become cached), the scheduler resets per-sequence states: •FocusState.rightmost processedis reset to−1","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.613769Z"},"links":{"citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:ecdf18ab5bca751a3d02c0ec35a1b647b7798a02ed4e99a15ea766233c6c1045","observation_id":"f3400da6-ff92-482c-b4a8-fce0e859cb85","resolution":{"observed_at":"2026-08-03T06:26:55.613769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-03T06:26:55.266118Z","title":"Jawahar, G., Sagot, B., and Seddah, D","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.266118Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:dcc4ae17119e3799c8f5dd84205bd80338d8a4d1230adeb56489b502322ac786","observation_id":"60ed0fa4-2b42-4fc3-80a6-78f60285de2e","resolution":{"observed_at":"2026-08-03T06:26:55.266118Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.14067","last_updated":"2026-04-29T20:52:08Z","snapshot_observed_at":"2026-08-13T02:27:38.752907Z","submitted_at":"2025-12-16T04:12:17Z","title":"Efficient-DLM: From Autoregressive to Diffusion Language Models, and Beyond in Speed","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.14067","snapshot_observed_at":"2026-08-03T06:26:55.152907Z","title":"Devlin, J., Chang, M.-W., Lee, K., and Toutanova, K","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.152907Z"},"links":{"cited_paper":"/paper/2512.14067","citing_paper":"/paper/2601.23278"},"observation_digest":"sha256:0c85b2509b83a6b328639c2f9888e082841a0569ff238e51550fd0eb9caf35ca","observation_id":"5755630b-d3c4-4d5b-8f66-babc52f2498f","resolution":{"observed_at":"2026-08-03T06:26:55.152907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.23278","last_updated":"2026-06-10T16:44:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T14:19:47.685366Z","submitted_at":"2026-01-30T18:52:06Z","title":"FOCUS: DLLMs Know How to Tame Their Compute Bound"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":7},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 1 inbound Pith citation observation for arXiv:2601.23278."}