{"as_of":"2026-08-18T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:934e27d63fdd1f65dd2be27aa462a22432f45e36f8d3c3904190b42a9f7a49bf","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":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-18T06:34:40.430872+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:12:58.909939Z","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-05-25T04:36:36.600162Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-08-09T13:25:52.163737Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02095","last_updated":"2025-05-20T12:35:46Z","snapshot_observed_at":"2026-08-13T14:08:47.184627Z","submitted_at":"2025-02-04T08:25:17Z","title":"LongDPO: Unlock Better Long-form Generation Abilities for LLMs via Critique-augmented Stepwise Information","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-09T13:25:52.163737Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2502.02095"},"observation_digest":"sha256:bbec3655e262ee26db1cfb0b5119e4905360285b88cb01dedb31c428e1c9fb10","observation_id":"4ea6e2ad-f1b1-4fb5-9d0d-ef200366c7d6","resolution":{"observed_at":"2026-08-09T13:25:52.163737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.09342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://arxiv.org/abs/2410.09342","venue":null,"work_id":"75adf482-5d84-4fa2-9d26-71978e836fdd","year":2024},"citing_paper":{"arxiv_id":"2502.11089","last_updated":"2025-02-27T09:01:21Z","snapshot_observed_at":"2026-08-16T16:29:35.500686Z","submitted_at":"2025-02-16T11:53:44Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-16T23:46:29.975858Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2502.11089"},"observation_digest":"sha256:1c4db72fdca86789a5b9a071325c79efc83c127131b1360223f7d421f302d0f8","observation_id":"dfd50428-6ded-43d2-b8d9-2025b1001f23","resolution":{"observed_at":"2026-05-16T23:46:30.083580Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-08-15T22:12:58.909939Z","title":"Llm mapreduce: Simplified long-sequence processing using large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07793","last_updated":"2025-09-08T20:57:22Z","snapshot_observed_at":"2026-08-18T02:49:39.030741Z","submitted_at":"2025-05-12T17:45:05Z","title":"Overflow Prevention Enhances Long-Context Recurrent LLMs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T22:12:58.909939Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2505.07793"},"observation_digest":"sha256:b8f11936ee9a79879385e02756adbce538377d66c519668b7d129cb95783bb98","observation_id":"48f3ac94-d8f0-4e05-b061-028589427d13","resolution":{"observed_at":"2026-08-15T22:12:58.909939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-08-06T23:10:14.487065Z","title":"LLM$\\times$MapReduce: Simplified long-sequence processing using large language models,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19897","last_updated":"2025-06-24T13:02:35Z","snapshot_observed_at":"2026-08-08T11:24:18.587635Z","submitted_at":"2025-06-24T13:02:35Z","title":"Can LLMs Replace Humans During Code Chunking?","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:10:14.487065Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2506.19897"},"observation_digest":"sha256:491107fbce6dd321ae83dd8b5ca85f9bcbc7a72666c6f763b6de7fd6b08c0f79","observation_id":"24017d1c-6b92-40f5-aeb5-d672ee523380","resolution":{"observed_at":"2026-08-06T23:10:14.487065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.09342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://arxiv.org/abs/2410.09342","venue":null,"work_id":"75adf482-5d84-4fa2-9d26-71978e836fdd","year":2024},"citing_paper":{"arxiv_id":"2510.10129","last_updated":"2026-05-21T08:20:19Z","snapshot_observed_at":"2026-08-15T05:17:04.317852Z","submitted_at":"2025-10-11T09:28:26Z","title":"CacheClip: Accelerating RAG with Effective KV Cache Reuse","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T12:36:41.630618Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2510.10129"},"observation_digest":"sha256:e2943ffc187e0ba3d38cab92ccd6b8cede8ba03daabb5026ea531cfb4953127e","observation_id":"3bf80704-82dc-40ef-8d85-8e6f55272ffd","resolution":{"observed_at":"2026-05-22T12:41:33.710830Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.09342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.09342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://arxiv.org/abs/2410.09342","venue":null,"work_id":"75adf482-5d84-4fa2-9d26-71978e836fdd","year":2024},"citing_paper":{"arxiv_id":"2605.23296","last_updated":"2026-05-22T07:12:38Z","snapshot_observed_at":"2026-08-16T17:42:40.127873Z","submitted_at":"2026-05-22T07:12:38Z","title":"Parallel Context Compaction for Long-Horizon LLM Agent Serving","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T04:36:22.084650Z"},"links":{"cited_paper":"/paper/2410.09342","citing_paper":"/paper/2605.23296"},"observation_digest":"sha256:49223dde09f51cde273ad05c6138a7f9c94a7eb8e6dab74baba591562357a79f","observation_id":"eec95493-a1b3-44c6-9be8-72bebfb140d0","resolution":{"observed_at":"2026-05-25T04:36:36.603208Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.09342/citation-record","integrity":"/paper/2410.09342/integrity","json":"/paper/2410.09342/citation-record.json","paper":"/paper/2410.09342"},"outbound":[],"paper":{"arxiv_id":"2410.09342","last_updated":"2024-10-12T03:13:44Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:10:08.094720Z","submitted_at":"2024-10-12T03:13:44Z","title":"LLM$\\times$MapReduce: Simplified Long-Sequence Processing using Large Language Models"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2410.09342."}