{"as_of":"2026-08-08T11:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20a39b52f75db437ef0f5c304425d8fdb5ca44c27603c8172adf1326c53ddb02","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-07T21:38:34.615153Z","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-02T21:47:28.176395Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.17765","last_updated":"2025-02-10T09:58:34Z","snapshot_observed_at":"2026-08-06T01:23:29.572374Z","submitted_at":"2024-10-23T11:06:36Z","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17765","snapshot_observed_at":"2026-08-07T21:38:34.615153Z","title":"Faster language models with better multi-token prediction using tensor decomposition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09419","last_updated":"2025-02-13T15:42:44Z","snapshot_observed_at":"2026-08-07T21:46:16.569812Z","submitted_at":"2025-02-13T15:42:44Z","title":"On multi-token prediction for efficient LLM inference","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T21:38:34.615153Z"},"links":{"cited_paper":"/paper/2410.17765","citing_paper":"/paper/2502.09419"},"observation_digest":"sha256:73c4ef6ec303511ddac987b26506b10024206492689e9b4f13439ae12fecfad0","observation_id":"63302489-244a-41a6-ad7d-cbf2bcfede47","resolution":{"observed_at":"2026-08-07T21:38:34.615153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17765","last_updated":"2025-02-10T09:58:34Z","snapshot_observed_at":"2026-08-06T01:23:29.572374Z","submitted_at":"2024-10-23T11:06:36Z","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition","version":2},"cited_work":{"arxiv_id":"2410.17765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.17765","snapshot_observed_at":"2026-07-02T21:47:28.176395Z","title":"arXiv preprint arXiv:2410.17765 , year=","venue":null,"work_id":"8a8c565b-bc22-4402-87fc-ba0613df00c0","year":null},"citing_paper":{"arxiv_id":"2606.08347","last_updated":"2026-06-06T21:36:51Z","snapshot_observed_at":"2026-08-08T08:22:54.652566Z","submitted_at":"2026-06-06T21:36:51Z","title":"Tensorizing Engram: Sharing Latents Across N-Gram Embeddings is Beneficial in LLMs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T19:28:11.498476Z"},"links":{"cited_paper":"/paper/2410.17765","citing_paper":"/paper/2606.08347"},"observation_digest":"sha256:2541309e0930e554f81b157820264d819b00b12b79374b75667eff6fe620222f","observation_id":"b98260e6-5202-40dd-b5ef-d99b3dd77e9f","resolution":{"observed_at":"2026-07-02T21:47:28.177756Z","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":"2410.17765","last_updated":"2025-02-10T09:58:34Z","snapshot_observed_at":"2026-08-06T01:23:29.572374Z","submitted_at":"2024-10-23T11:06:36Z","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17765","snapshot_observed_at":"2026-07-11T23:56:55.728852Z","title":"arXiv preprint arXiv:2410.17765 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03788","last_updated":"2026-07-20T06:10:09Z","snapshot_observed_at":"2026-08-02T08:49:44.342506Z","submitted_at":"2026-07-04T09:32:12Z","title":"Tensor-Train Joint Modeling for Few-Step Discrete Diffusion","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T23:56:55.728852Z"},"links":{"cited_paper":"/paper/2410.17765","citing_paper":"/paper/2607.03788"},"observation_digest":"sha256:bad21e36314f445b9b9232a05bfab8bc59bfbb1149afbee334d4dcba0be4662d","observation_id":"55cd9e8d-2216-4b67-a402-2075e554d33d","resolution":{"observed_at":"2026-07-11T23:56:55.728852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17765","last_updated":"2025-02-10T09:58:34Z","snapshot_observed_at":"2026-08-06T01:23:29.572374Z","submitted_at":"2024-10-23T11:06:36Z","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17765","snapshot_observed_at":"2026-08-02T08:49:47.245513Z","title":"arXiv preprint arXiv:2410.17765 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03788","last_updated":"2026-07-20T06:10:09Z","snapshot_observed_at":"2026-08-02T08:49:44.342506Z","submitted_at":"2026-07-04T09:32:12Z","title":"Tensor-Train Joint Modeling for Few-Step Discrete Diffusion","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T08:49:47.245513Z"},"links":{"cited_paper":"/paper/2410.17765","citing_paper":"/paper/2607.03788"},"observation_digest":"sha256:d97a9a3713c546d2ebfb897a55bec4de31f4a1fd0271e3f3c792ebd4daf9be75","observation_id":"644f7d2e-0fea-4ea6-92c5-e67268a081b4","resolution":{"observed_at":"2026-08-02T08:49:47.245513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.17765/citation-record","integrity":"/paper/2410.17765/integrity","json":"/paper/2410.17765/citation-record.json","paper":"/paper/2410.17765"},"outbound":[],"paper":{"arxiv_id":"2410.17765","last_updated":"2025-02-10T09:58:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T01:23:29.572374Z","submitted_at":"2024-10-23T11:06:36Z","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition"},"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:2410.17765."}