{"as_of":"2026-08-15T01:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:346d60b14144155a63e77acd825d08043bfd77275a25189ae9f6afdcc4eab5af","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:07:14.193055Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2411.09111/citation-record","integrity":"/paper/2411.09111/integrity","json":"/paper/2411.09111/citation-record.json","paper":"/paper/2411.09111"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.809744Z","title":null,"venue":null,"work_id":"13e8bd93-8770-4442-9217-88f30b5aa63d","year":2023},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.045386Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:2aeb22555cd2aa0836330fdbce438bb69c37f846371efae9b780ff9bb8b2fbef","observation_id":"352ae7df-3bf0-47a9-890a-94a8268ab967","resolution":{"observed_at":"2026-08-12T21:07:14.814661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.793624Z","title":null,"venue":null,"work_id":"eacef424-5700-48ec-8030-b1aff047af53","year":2023},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.050880Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:991c31320fa756abd67fa725eede0bb5e237e2ebfc81050c95cde91abc057eeb","observation_id":"90253eb9-2172-4bdf-99dc-7553d63169d5","resolution":{"observed_at":"2026-08-12T21:07:14.798640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.14680","last_updated":"2022-10-12T18:01:23Z","snapshot_observed_at":"2026-08-14T00:33:35.030678Z","submitted_at":"2022-03-28T12:26:00Z","title":"Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.14680","snapshot_observed_at":"2026-08-12T21:07:14.056196Z","title":"R., & Goldberg, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.056196Z"},"links":{"cited_paper":"/paper/2203.14680","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:909631fb66d8e78c74b372dbc11d6313d5ff94240fc3de2bde548d5fbb5dcb37","observation_id":"54a9ae9b-3797-440c-b52b-5c5ba5979ae3","resolution":{"observed_at":"2026-08-12T21:07:14.056196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.07324","last_updated":"2022-05-15T16:23:30Z","snapshot_observed_at":"2026-08-15T00:22:46.038775Z","submitted_at":"2022-05-15T16:23:30Z","title":"Transkimmer: Transformer Learns to Layer-wise Skim","version":1},"cited_work":{"arxiv_id":"2205.07324","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.07324","snapshot_observed_at":"2026-08-12T21:07:14.486928Z","title":"Transkimmer: Transformer Learns to Layer-wise Skim","venue":"cs.CL","work_id":"f00b55d1-819c-42e0-8053-792d49546597","year":2022},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.062133Z"},"links":{"cited_paper":"/paper/2205.07324","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:4c2b60745ae6f091a45a313961f7b6ac69db7ab62915b27a5295247e57bf17fd","observation_id":"7d7311ae-f99f-4f53-a133-162a92e41da0","resolution":{"observed_at":"2026-08-12T21:07:14.493124Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04925","last_updated":"2024-06-22T08:18:48Z","snapshot_observed_at":"2026-08-13T04:45:32.719820Z","submitted_at":"2024-01-10T04:37:38Z","title":"The Impact of Reasoning Step Length on Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04925","snapshot_observed_at":"2026-08-12T21:07:14.067573Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.067573Z"},"links":{"cited_paper":"/paper/2401.04925","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:6e21ca8b0fbac3bd9d03c1e5518f69a91670dae42ecefa33315fdb27e2d6affc","observation_id":"3e082394-610d-437c-b61f-eed8904a0b7b","resolution":{"observed_at":"2026-08-12T21:07:14.067573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02406","last_updated":"2023-04-11T19:39:17Z","snapshot_observed_at":"2026-08-10T13:37:57.622090Z","submitted_at":"2022-10-05T17:28:20Z","title":"Decomposed Prompting: A Modular Approach for Solving Complex Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.02406","snapshot_observed_at":"2026-08-12T21:07:14.073224Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.073224Z"},"links":{"cited_paper":"/paper/2210.02406","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:a9cc48310090964286556eeda11721088b7dc5525872d80c29703deb1250e99b","observation_id":"8b12c4c3-34ea-434f-aec7-403cf2d35ccd","resolution":{"observed_at":"2026-08-12T21:07:14.073224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04451","last_updated":"2020-02-18T16:01:18Z","snapshot_observed_at":"2026-07-06T08:50:12.690900Z","submitted_at":"2020-01-13T18:38:28Z","title":"Reformer: The Efficient Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.04451","snapshot_observed_at":"2026-08-12T21:07:14.078987Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.078987Z"},"links":{"cited_paper":"/paper/2001.04451","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:b5f046d233edd84ac868b0f784cde0193d886027ca72b7cbeda3917922669b0e","observation_id":"8439da01-cccd-4fab-8051-0b0b0cdb0551","resolution":{"observed_at":"2026-08-12T21:07:14.078987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12399","last_updated":"2024-04-24T08:48:13Z","snapshot_observed_at":"2026-08-13T05:20:39.225920Z","submitted_at":"2023-11-21T07:22:48Z","title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12399","snapshot_observed_at":"2026-08-12T21:07:14.084389Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.084389Z"},"links":{"cited_paper":"/paper/2311.12399","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:4492c4428529d5b9727f28abbba44f03e56d9904d5f45daf740f3da4a8898a3a","observation_id":"da0585ec-5d15-4189-98f3-e3d0754549c8","resolution":{"observed_at":"2026-08-12T21:07:14.084389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12875","last_updated":"2024-09-21T06:48:45Z","snapshot_observed_at":"2026-08-13T04:14:39.684680Z","submitted_at":"2024-02-20T10:11:03Z","title":"Chain of Thought Empowers Transformers to Solve Inherently Serial Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12875","snapshot_observed_at":"2026-08-12T21:07:14.089640Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.089640Z"},"links":{"cited_paper":"/paper/2402.12875","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:5a56ec046a8ee8d3f3c36a3ef9d47397ba8113b4cbced01306144b7b728bf11d","observation_id":"55f6241f-eec1-4c19-af0d-82b21456c427","resolution":{"observed_at":"2026-08-12T21:07:14.089640Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.776679Z","title":"L., Ho, C","venue":null,"work_id":"3a37fcc6-785f-4924-9603-5d90e3a84e46","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.094694Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:c92e49fb4dda1fe1a28844b6a964f68d7e2313c466924bc4c2fe1dc3406d645f","observation_id":"913a42e2-354e-4fdc-bd00-b7485afadd0e","resolution":{"observed_at":"2026-08-12T21:07:14.782102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.759350Z","title":null,"venue":null,"work_id":"061fa103-e04b-473d-aec1-35ea37db92d9","year":2016},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.099561Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:7854ee46a2b98b7dabfb1b81b30b92e7b1fcb7102f5245e345684727177c13cc","observation_id":"530bc43f-f497-4dcc-91de-587a041b15e3","resolution":{"observed_at":"2026-08-12T21:07:14.764388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.743270Z","title":null,"venue":null,"work_id":"49c3c4ed-ac8d-4097-a4f2-a2960b3c1435","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.104639Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:0dd3cb8a1bcf6dd846111af731633c8e6ca7564a1fb576ba650ed27e5d995f83","observation_id":"5a3c94ac-c37f-4fa0-84cc-bcb60a5fc33b","resolution":{"observed_at":"2026-08-12T21:07:14.748410Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.726821Z","title":"A., & Field, D","venue":null,"work_id":"035d7823-59b6-4d28-8ea7-16de48e3e5f4","year":2004},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.109708Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:c394785a4f7373cf9c9b337f7f459e37aa0de77bfe6847b35841861c10e66da1","observation_id":"38c48cb2-b16f-4271-bc7b-f2152a7b2987","resolution":{"observed_at":"2026-08-12T21:07:14.731601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.710766Z","title":null,"venue":null,"work_id":"c16645a5-58ff-4434-8f48-75acc864be2b","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.114597Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:cac34e25d7bcd7bd5ffc64267133145105eecd0c6ab0cb942f021b76ad57310e","observation_id":"47f0f20f-f6d4-4809-b6e1-4a7908713346","resolution":{"observed_at":"2026-08-12T21:07:14.715749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.693522Z","title":null,"venue":null,"work_id":"aee8f799-f980-4a72-bfbd-630e6e168ee3","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.119323Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:ef2b287be709462cc3dfddb24b7f628f4d558a8a6ca7eaed1cd25badf6a5d540","observation_id":"ecd6bb61-094a-4d96-b4c5-d4a5fe9caab6","resolution":{"observed_at":"2026-08-12T21:07:14.699401Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.124249Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.124249Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:b327ec0387f13ec1e04a4ce12e588d283e41652f7d40f218e2209e5a3ce8ab2a","observation_id":"b33cd817-1a5e-4253-9d83-09c888bc1136","resolution":{"observed_at":"2026-08-12T21:07:14.124249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13077","last_updated":"2024-10-15T22:50:58Z","snapshot_observed_at":"2026-08-13T00:03:21.673387Z","submitted_at":"2024-05-21T03:16:35Z","title":"GPT-4 Jailbreaks Itself with Near-Perfect Success Using Self-Explanation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13077","snapshot_observed_at":"2026-08-12T21:07:14.129310Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.129310Z"},"links":{"cited_paper":"/paper/2405.13077","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:12c72073d2949519aa4edb80806290ebc769c00917037f5c4c2263e90ca50b10","observation_id":"203fe581-cec9-4456-94ec-252a57482b52","resolution":{"observed_at":"2026-08-12T21:07:14.129310Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.665218Z","title":null,"venue":null,"work_id":"5bf5dead-694c-4734-8bc9-f383d0194cd7","year":2023},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.134250Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:3850ac18c9da537c8105c2222c89d16a08dac6acf5d81c2d37dade28a395e619","observation_id":"39450b38-91ef-4db0-9cff-f80c05c8b0f5","resolution":{"observed_at":"2026-08-12T21:07:14.670223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.12188","last_updated":"2022-04-21T07:17:11Z","snapshot_observed_at":"2026-08-13T18:05:09.664033Z","submitted_at":"2021-09-24T20:51:21Z","title":"Predicting Attention Sparsity in Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.12188","snapshot_observed_at":"2026-08-12T21:07:14.139019Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.139019Z"},"links":{"cited_paper":"/paper/2109.12188","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:66777c036b897bfa4ec25d1eb9c4bd5b13877ac0741ec128be682de79ca0ad6f","observation_id":"252946ae-4f9b-4ff8-a62e-5e8f114532fb","resolution":{"observed_at":"2026-08-12T21:07:14.139019Z","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-12T21:07:14.144033Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.144033Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:6cc1bc11afe059b00f101d5ee6e1ade708d0dd8fd22871e67a66a108326e6dcb","observation_id":"45f91695-6e69-4cc7-8fa2-7f53ab78e055","resolution":{"observed_at":"2026-08-12T21:07:14.144033Z","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-12T21:07:14.148579Z","title":"& Zhou, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.148579Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:36877ac7218ebc4241707541e7615ceeec639d045a8fda933200dc10831429e3","observation_id":"ac7aaffe-a4eb-480c-b23f-ba3ac3a081e5","resolution":{"observed_at":"2026-08-12T21:07:14.148579Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.627170Z","title":null,"venue":null,"work_id":"90fafd87-0a6b-4040-b5d3-1f2965fad12f","year":2021},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.153592Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:ca9004eee17fa6db9cdc45af55916ea329d9687a6c96d481084923f6d4d21b80","observation_id":"a7aa8b0d-0661-4451-9131-7be57a11dd6b","resolution":{"observed_at":"2026-08-12T21:07:14.632752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01283","last_updated":"2024-06-03T12:51:52Z","snapshot_observed_at":"2026-08-12T23:51:37.453126Z","submitted_at":"2024-06-03T12:51:52Z","title":"Focus on the Core: Efficient Attention via Pruned Token Compression for Document Classification","version":1},"cited_work":{"arxiv_id":"2406.01283","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.01283","snapshot_observed_at":"2026-08-12T21:07:14.341213Z","title":"Focus on the Core: Efficient Attention via Pruned Token Compression for Document Classification","venue":"cs.CL","work_id":"37a13603-5387-4f56-af39-12810d03f0de","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.158200Z"},"links":{"cited_paper":"/paper/2406.01283","citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:20efe531e906f2a521a4f2dbfd75fc93373ca3684c8e475fafcf94f75f3e1923","observation_id":"7d936c12-6224-4649-887c-c3b7da10e383","resolution":{"observed_at":"2026-08-12T21:07:14.348904Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.609336Z","title":null,"venue":null,"work_id":"3e43364b-c99a-4fef-a65d-da3a1c7b67d3","year":2023},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.163351Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:720cd5f3ca9c7450892caf975c2d2d0002469e9508d1f614779dba726641e4b8","observation_id":"b912cc97-2479-45c8-9ccb-b4bb413b9374","resolution":{"observed_at":"2026-08-12T21:07:14.614507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.590265Z","title":null,"venue":null,"work_id":"ee5d7783-ba37-4c19-9ff1-aec167e88cc8","year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.167872Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:5a06985efd8aeec007cf5c16790d603f5d2aca06a1e6f0588251e37e7f36b930","observation_id":"7cc4c017-d2a7-45d2-92af-af663accc241","resolution":{"observed_at":"2026-08-12T21:07:14.595468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.172580Z","title":"& Liu, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.172580Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:eed7ee056afd70683df534cc89d37fcf0152b3a323fac41437c49e797bf20db0","observation_id":"2b327d4a-3c11-472f-9db0-e8ed57c6af77","resolution":{"observed_at":"2026-08-12T21:07:14.172580Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.573108Z","title":null,"venue":null,"work_id":"fd63a8aa-ccf0-4bea-b4fc-6faa10867660","year":null},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.177510Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:b814a1ed41365fe723f90e29ddcfa5c0be6d4bc2de68a17adf813ed48840b305","observation_id":"5247c691-4832-4028-9ff3-7c23a3ffcb8a","resolution":{"observed_at":"2026-08-12T21:07:14.578386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.556686Z","title":"All combinations of the four columns","venue":null,"work_id":"e66c1b3d-27c4-49b4-a83d-3c3b1db0f586","year":null},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.182799Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:2f506bd8ed3e9c2211cfaf36aceb64e951039f81bfbebb1a8f99ae5b4db37798","observation_id":"c02ba5dd-279a-4e3e-9c7a-9eab965afaf7","resolution":{"observed_at":"2026-08-12T21:07:14.561896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.539703Z","title":"Then the equation Ax = b (always / sometimes but not always) has (a unique solution / many solutions / no solution)","venue":null,"work_id":"3e08497c-9a89-4e0d-a2d2-92e2d7925853","year":null},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.187867Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:dceac4204de40d125177ac3a40f2056f7bc6b1d1ac1a4a27b8c7868df8497c59","observation_id":"f1fbee70-bcba-426b-9cfa-ff87a292701a","resolution":{"observed_at":"2026-08-12T21:07:14.545221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:07:14.522820Z","title":"All combinations of the four columns","venue":null,"work_id":"e2c0e7db-0ea2-4fe0-baa9-b7f15084aa94","year":null},"citing_paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism","version":8},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T21:07:14.193055Z"},"links":{"citing_paper":"/paper/2411.09111"},"observation_digest":"sha256:1ffd1b842696c6544e005650bfec969d166b6bd975ca2a70e316cd1e3ec6a8e4","observation_id":"fa0a6a13-31ff-4f2c-af56-457d43e380d2","resolution":{"observed_at":"2026-08-12T21:07:14.527909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.09111","last_updated":"2025-07-09T19:21:45Z","latest_version":8,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T17:43:32.940507Z","submitted_at":"2024-11-14T00:59:13Z","title":"Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2411.09111."}