{"as_of":"2026-08-09T04:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22d8b0c6ec8ba50fafb352ef594bca499373bc24bc2fcf6a1971f61b39be1af7","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:41:11.816898Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T19:33:02.153310Z","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-03T19:18:54.782295Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14398","snapshot_observed_at":"2026-08-02T19:33:02.153310Z","title":"B., Zhang, Y ., Roth, D., Madden, S., Andreas, J., and Cafarella, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.01761","last_updated":"2026-06-16T11:36:48Z","snapshot_observed_at":"2026-08-08T18:03:36.079735Z","submitted_at":"2026-03-02T11:40:05Z","title":"Position: Modular Memory is the Key to Continual Learning Agents","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T19:33:02.153310Z"},"links":{"cited_paper":"/paper/2505.14398","citing_paper":"/paper/2603.01761"},"observation_digest":"sha256:b859d748249edf2f9feb16b38ac5bc22a8e8f2aa25a0081ebeb9582dbec4294d","observation_id":"3ffda898-5cab-4cae-b5ef-5584db95f3df","resolution":{"observed_at":"2026-08-02T19:33:02.153310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"cited_work":{"arxiv_id":"2505.14398","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14398","snapshot_observed_at":"2026-07-03T19:18:54.782295Z","title":"Log-augmented generation: Scaling test-time reasoning with reusable computation.arXiv preprint arXiv:2505.14398, 2025","venue":null,"work_id":"a0ebbfb7-a551-4a05-b9d1-343391640157","year":2025},"citing_paper":{"arxiv_id":"2606.17803","last_updated":"2026-06-16T11:27:28Z","snapshot_observed_at":"2026-07-06T23:53:21.186284Z","submitted_at":"2026-06-16T11:27:28Z","title":"Continual Self-Improvement with Lightweight Experiential Latent Memories","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T01:56:44.269388Z"},"links":{"cited_paper":"/paper/2505.14398","citing_paper":"/paper/2606.17803"},"observation_digest":"sha256:36f45007dd684995a287dd2c9f77dc145ff1741bf536eccceba6ce4a7d35160a","observation_id":"d45299af-b92f-4f6e-86a9-3528d5599417","resolution":{"observed_at":"2026-07-03T19:18:54.783853Z","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/2505.14398/citation-record","integrity":"/paper/2505.14398/integrity","json":"/paper/2505.14398/citation-record.json","paper":"/paper/2505.14398"},"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-07T15:41:15.694681Z","title":"Memprompt: Memory-assisted prompt editing with user feedback, 2022","venue":null,"work_id":"c45b3918-c875-49c1-80b6-06bc7ead6ef4","year":2022},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.011603Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:8051f7bb5039de64def63e589988b8fc1dc5998980cbe5c52695ae25757fd58f","observation_id":"6771f619-9fa7-4a76-837b-e9bf090157e5","resolution":{"observed_at":"2026-08-07T15:41:15.768905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:09.072887Z","title":"Reflexion: Language agents with verbal reinforcement learning.Advances in Neural Information Processing Systems, 36:8634–8652, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.072887Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:6086b9ca2e84ae2d6fe19115eb28e2d1bd367a25deaced613cc0b692735defc8","observation_id":"7a9091cf-1ee8-437f-b4e2-70f18cec064b","resolution":{"observed_at":"2026-08-07T15:41:09.072887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07952","last_updated":"2025-04-10T17:57:33Z","snapshot_observed_at":"2026-08-07T16:06:45.454822Z","submitted_at":"2025-04-10T17:57:33Z","title":"Dynamic Cheatsheet: Test-Time Learning with Adaptive Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07952","snapshot_observed_at":"2026-08-07T15:41:09.171600Z","title":"Dynamic cheatsheet: Test-time learning with adaptive memory.arXiv preprint arXiv:2504.07952, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.171600Z"},"links":{"cited_paper":"/paper/2504.07952","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:f5829e0ca18d7ce6eca485545189ab0ba29263f3eec2d385208f38a30a5b6a40","observation_id":"3a85bc31-c7fb-4e52-89a2-b5eb26b9caf2","resolution":{"observed_at":"2026-08-07T15:41:09.171600Z","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-07T15:41:15.505769Z","title":"Thought-retriever: Don’t just retrieve raw data, retrieve thoughts","venue":null,"work_id":"8f60c6ea-e89e-450f-b28b-1169148377b4","year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.275334Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:2c3e534c6fcdc8b4955037517dd2fe97ad9aca38900801d4d4737f39f1464a2f","observation_id":"3538ac07-5cd4-4966-afd8-cc84e1a53227","resolution":{"observed_at":"2026-08-07T15:41:15.576773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:09.336465Z","title":"Buffer of thoughts: Thought-augmented reasoning with large language models.Advances in Neural Information Processing Systems, 37:113519–113544, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.336465Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:34c9b6b177779ac033ffd2d91fc90e5f3bf1ac4a1e0eec24c22e790d98568cea","observation_id":"53d00901-31c8-4b4a-b3be-d1ef6d684790","resolution":{"observed_at":"2026-08-07T15:41:09.336465Z","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-07T15:41:09.413038Z","title":"Prompt cache: Modular attention reuse for low-latency inference.Proceedings of Machine Learning and Systems, 6:325–338, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.413038Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:00a49ac77ec1eb9b335d70b17c662b03185a0e17086f24ba447d388d124241e5","observation_id":"42b7377d-510a-4e5f-bdfc-f7a41d2e8021","resolution":{"observed_at":"2026-08-07T15:41:09.413038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07590","last_updated":"2024-10-10T03:52:54Z","snapshot_observed_at":"2026-08-08T04:57:30.278258Z","submitted_at":"2024-10-10T03:52:54Z","title":"TurboRAG: Accelerating Retrieval-Augmented Generation with Precomputed KV Caches for Chunked Text","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07590","snapshot_observed_at":"2026-08-07T15:41:09.511580Z","title":"Turborag: Accelerating retrieval-augmented generation with precomputed kv caches for chunked text.arXiv preprint arXiv:2410.07590, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.511580Z"},"links":{"cited_paper":"/paper/2410.07590","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:0f7a99609a8076c2b4eb729800815fda4f09b4312ef5a96c8c9392242eb5a3d5","observation_id":"b8d84489-84cc-4504-99cb-c18006c41af5","resolution":{"observed_at":"2026-08-07T15:41:09.511580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15605","last_updated":"2025-02-23T19:48:12Z","snapshot_observed_at":"2026-07-06T20:10:41.978020Z","submitted_at":"2024-12-20T06:58:32Z","title":"Don't Do RAG: When Cache-Augmented Generation is All You Need for Knowledge Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15605","snapshot_observed_at":"2026-08-07T15:41:09.585466Z","title":"Don’t do rag: When cache-augmented generation is all you need for knowledge tasks.arXiv preprint arXiv:2412.15605, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.585466Z"},"links":{"cited_paper":"/paper/2412.15605","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:c5448aa3a3a2b4e1bb6ce5dbc85d5adb252b7a54ed96b4aac72bc29e605eb78a","observation_id":"24e430fb-c330-4497-b457-ccae01f71b3d","resolution":{"observed_at":"2026-08-07T15:41:09.585466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-07T15:41:09.659563Z","title":"Block-attention for efficient rag.arXiv preprint arXiv:2409.15355, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.659563Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:11634091c240dc310484d0de1af8875dc01e9255205cc919781e7395cbff9ae1","observation_id":"cfc08c28-0def-4fa9-9842-366c6a0abc59","resolution":{"observed_at":"2026-08-07T15:41:09.659563Z","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-07T15:41:09.754365Z","title":"Musique: Multihop questions via single-hop question composition.Transactions of the Association for Computational Linguistics, 10:539–554, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.754365Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:70f136f474d15dbb875d7b5d63067c2a0a0e80008ebe5608cf6d04a19ede94d4","observation_id":"c05190d7-866e-4d4d-88e0-bf30c693c2e4","resolution":{"observed_at":"2026-08-07T15:41:09.754365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.01060","last_updated":"2020-11-12T07:47:48Z","snapshot_observed_at":"2026-07-06T10:10:56.466018Z","submitted_at":"2020-11-02T15:42:40Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.01060","snapshot_observed_at":"2026-08-07T15:41:09.825922Z","title":"Constructing a multi-hop qa dataset for comprehensive evaluation of reasoning steps.arXiv preprint arXiv:2011.01060, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.825922Z"},"links":{"cited_paper":"/paper/2011.01060","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:352f7ea41ccd67778ef4578756ccddd84b0b539ac406a5b3849e6ee8af67b2d5","observation_id":"e5d7070d-1e11-4d88-a629-25d2cce2a0fa","resolution":{"observed_at":"2026-08-07T15:41:09.825922Z","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-07T15:41:09.894995Z","title":"Gpqa: A graduate-level google-proof q&a benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.894995Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:c724bec62024cdd6ecf91cf9778e499e50913d4585109986a48f0673d0e0ef14","observation_id":"ec7b51cd-f8e7-4467-b4a6-f154d41e1f50","resolution":{"observed_at":"2026-08-07T15:41:09.894995Z","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-07T15:41:09.986710Z","title":"Mmlu-pro: A more robust and challenging multi-task language understanding benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.986710Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:ee68bb37e8d08ffa68bfeb5f978c502062e14a3379338e880f44c7742e11eb66","observation_id":"f354cb75-5214-4de1-9f95-1ed469d2121f","resolution":{"observed_at":"2026-08-07T15:41:09.986710Z","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-07T15:41:10.083230Z","title":"React: Synergizing reasoning and acting in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.083230Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:e7a42c0b3d92d1d1199556f5e2cb8d20e9e319a1a8e612784c445dd311c7bee8","observation_id":"829ca4dc-7383-444d-9f7c-87c34628d340","resolution":{"observed_at":"2026-08-07T15:41:10.083230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04506","last_updated":"2024-12-14T00:13:09Z","snapshot_observed_at":"2026-07-06T20:02:26.756229Z","submitted_at":"2024-12-03T22:59:36Z","title":"Arctic-Embed 2.0: Multilingual Retrieval Without Compromise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04506","snapshot_observed_at":"2026-08-07T15:41:10.151457Z","title":"Arctic-embed 2.0: Multilingual retrieval without compromise.arXiv preprint arXiv:2412.04506, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.151457Z"},"links":{"cited_paper":"/paper/2412.04506","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:14bb8eb43e554a3d121564ed7c3971731c8812343c227100ab06d91c717b271d","observation_id":"c78709b8-2bde-4adc-9a65-ebc335a35a16","resolution":{"observed_at":"2026-08-07T15:41:10.151457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07316","last_updated":"2023-03-19T13:37:01Z","snapshot_observed_at":"2026-07-06T14:04:58.943383Z","submitted_at":"2022-10-13T19:42:08Z","title":"MTEB: Massive Text Embedding Benchmark","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07316","snapshot_observed_at":"2026-08-07T15:41:10.248463Z","title":"Mteb: Massive text embedding benchmark.arXiv preprint arXiv:2210.07316, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.248463Z"},"links":{"cited_paper":"/paper/2210.07316","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:c760e2c2549023d28cd0293cb77915fdb09a194fee54ad587eba89a060ad93c9","observation_id":"56ed8872-6ee9-4d1a-b6e0-dce9818b18ca","resolution":{"observed_at":"2026-08-07T15:41:10.248463Z","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-07T15:41:15.226789Z","title":null,"venue":null,"work_id":"f3c39b5d-6d84-4b5c-9ca8-818b74b08303","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.346046Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:59140d4b0d18b7859bd76104e156d9fe07bd6184418c669dc8111826eac97f06","observation_id":"950514d5-465b-459b-96a8-8521fdc0e3f3","resolution":{"observed_at":"2026-08-07T15:41:15.309427Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:15.012761Z","title":"The short answer must be wrapped in <ans></ans>","venue":null,"work_id":"e38945d6-2dc7-4052-9355-e150e63ed409","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.415210Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:1dda5c730a5e6af3a3f6095176bec71ca09bdb0c75fcea073e633a9a15fe2287","observation_id":"cd7a4444-53e7-4783-9f60-fcf17ca74098","resolution":{"observed_at":"2026-08-07T15:41:15.102242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:14.844917Z","title":null,"venue":null,"work_id":"df3c823b-cd95-40e1-acc3-5f93c1864df7","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.510167Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:9589f5e7052bb27a82c19614b10687a2b21e6efc5d1b5c93c6e6158d40cecfd1","observation_id":"e953ce3e-2685-45fa-8b0c-717bd2c8171f","resolution":{"observed_at":"2026-08-07T15:41:14.923581Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:14.628077Z","title":null,"venue":null,"work_id":"fc7fecfe-9dda-4ab2-acc6-673d8bbd0bae","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.580770Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:e889fa318141ce2fe046ea836f63fcf0e29235974155efa3f9ed42d988f0b273","observation_id":"91d1891e-f85b-44da-bf90-0e7dddd73a47","resolution":{"observed_at":"2026-08-07T15:41:14.701252Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:14.433292Z","title":"- If you cannot identify the answer, output sub-questions that, if solved, can lead to new information","venue":null,"work_id":"ab40f785-d239-4599-9305-af60e6a93632","year":1974},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.686609Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:f1b3929c4d47137d350514942cfffcab9e24c21d230c85b7662b23aeabba7f6b","observation_id":"c54c770d-7872-4f9c-99e2-fe4d5cb66875","resolution":{"observed_at":"2026-08-07T15:41:14.512361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:14.257302Z","title":"- The number of stereoisomers can be calculated based on the number of chiral centers (asymmetric carbon atoms) in the molecule","venue":null,"work_id":"ba3d4c82-7bf3-40f6-8340-77987af0a05c","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.740470Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:f2990fa9843ea91af0795ecd00ae8e7ce9e073e83b3c3ac6d84847600411317c","observation_id":"1c9d3e14-8882-4c86-a5b2-a10250608350","resolution":{"observed_at":"2026-08-07T15:41:14.343308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:14.095884Z","title":"- To find the number of stereoisomers, we need to identify the chiral centers in the molecule","venue":null,"work_id":"757cd6dc-f40b-4220-8c03-5dc929a44ac0","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.744437Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:7f2ba8fe1c5b65a7573eb5b369bc8bdd68992d5d4a2a23e9b7402478c45a41da","observation_id":"5e073581-1239-4827-99d6-748ebb061e55","resolution":{"observed_at":"2026-08-07T15:41:14.177394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:13.956405Z","title":"- We can break down the molecule into its components: - The main chain has 11 carbon atoms","venue":null,"work_id":"00114c47-7109-4cc1-98a8-83a8f788837f","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.817309Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:501487627794724b42a5bffcb194448742d0c531463ad4bc2b867fbf1113ac05","observation_id":"44663363-cb84-43af-9f85-e8504cab2143","resolution":{"observed_at":"2026-08-07T15:41:14.004695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:13.788059Z","title":"- Each chiral center can have two possible configurations (R or S)","venue":null,"work_id":"78c90a11-5e7e-457a-a8cd-ce6092fc956d","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:10.966211Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:473ea87fe0b9ebd7b0ba8bb6c2b3660414f467a6372742c9e3ac3d23b601f61c","observation_id":"ee414276-2c51-4fd5-a624-6cf4f1661eba","resolution":{"observed_at":"2026-08-07T15:41:13.870863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:13.609721Z","title":null,"venue":null,"work_id":"48babbea-7951-49e6-9799-5f3b1be57a06","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.091653Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:a20d09fcd02cb224adb55d8c606b20a042ff29f752a3bad022ca75f388fd07e1","observation_id":"c3caefb9-dadc-4ac1-b748-1c24e0fd708d","resolution":{"observed_at":"2026-08-07T15:41:13.693373Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:13.475107Z","title":"This suggests that it may have multiple stereocenters","venue":null,"work_id":"be13f9de-001a-4f69-9fea-a1626311ef0c","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.184369Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:952559b3ea6a9a057bce13e31dbd8192e6557af91bc6ffaacff685da49b6254a","observation_id":"09df4125-869a-45d1-82f3-c142806468f6","resolution":{"observed_at":"2026-08-07T15:41:13.522705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:13.189431Z","title":null,"venue":null,"work_id":"ba15a1ba-3978-4b76-8904-ba54ca369017","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.296879Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:2b2cb287462357c2fe0c37aa6de06613f3503ade4021872cd9efb2bd0145682f","observation_id":"cd01171d-4a5a-4131-bc53-59552b350264","resolution":{"observed_at":"2026-08-07T15:41:13.408112Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:12.882812Z","title":null,"venue":null,"work_id":"2d1a01f3-076d-47b9-b94b-066a6d166c73","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.420701Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:fa5a5e7db123924b70f44c65b9f7f32967aa4c88874ac2370ba8b7373ecd85c9","observation_id":"7797b3de-e920-4bff-9f23-f6dbbff0904e","resolution":{"observed_at":"2026-08-07T15:41:13.001394Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:12.581825Z","title":null,"venue":null,"work_id":"d825c19c-a37f-47d3-8a94-c5d52ad763d7","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.567797Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:cd26068f94c7063d73edd36b0ba7bfc3488b305c0b122f0082a3fccb882235e3","observation_id":"6274118d-69e8-4471-9029-9ce527d1ac66","resolution":{"observed_at":"2026-08-07T15:41:12.738026Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:12.303171Z","title":null,"venue":null,"work_id":"3915b453-81ae-4ea8-bec4-cf4db458bfa0","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.705973Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:f08b109b44bf3a1743b89630fabae96621c97dff263d760473f14b59f0d38cfa","observation_id":"7d0fe754-1482-40ac-9be5-5776a27124d7","resolution":{"observed_at":"2026-08-07T15:41:12.423316Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:41:12.059968Z","title":null,"venue":null,"work_id":"a92b7988-5007-40f9-89d4-8892cb99f9ac","year":null},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:11.816898Z"},"links":{"citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:d1ed169ba118a0c5f924ab0dae777308dfbe7d2e1db3610bc66d08ad00b10770","observation_id":"ee08a43a-fc68-4741-a13d-70237c9b2547","resolution":{"observed_at":"2026-08-07T15:41:12.177772Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":32},"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 9 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 2 inbound Pith citation observations for arXiv:2505.14398."}