{"as_of":"2026-08-08T20:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73d828631629a4fa6f9367256adefa0b1d7c415dc14d6770d8a86af693b8ae7f","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:16:58.216555Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"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-06T00:53:42.488397Z","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-15T12:25:35.666043Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"cited_work":{"arxiv_id":"2505.15784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15784","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wan and L","venue":null,"work_id":"a9d5e8bd-2da0-4f55-a103-926455c7deb8","year":null},"citing_paper":{"arxiv_id":"2603.11749","last_updated":"2026-04-03T18:52:02Z","snapshot_observed_at":"2026-08-02T15:49:30.960394Z","submitted_at":"2026-03-12T09:52:38Z","title":"Truth as a Compression Artifact in Language Model Training","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-15T12:22:46.780345Z"},"links":{"cited_paper":"/paper/2505.15784","citing_paper":"/paper/2603.11749"},"observation_digest":"sha256:0c19972318234eb7b789e29d21602032aff06bbcb85c59fed5272a49bcb144e8","observation_id":"3942ecaa-2bba-460f-bf79-188dfc651ab7","resolution":{"observed_at":"2026-05-15T12:25:35.668542Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15784","snapshot_observed_at":"2026-08-06T00:53:42.488397Z","title":"arXiv preprint arXiv:2505.15784 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01005","last_updated":"2026-08-02T05:22:30Z","snapshot_observed_at":"2026-08-08T01:27:54.317708Z","submitted_at":"2026-08-02T05:22:30Z","title":"Hierarchical Solomonoff Induction: An Unbounded Machine Learning Model","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T00:53:42.488397Z"},"links":{"cited_paper":"/paper/2505.15784","citing_paper":"/paper/2608.01005"},"observation_digest":"sha256:c9e8aa4490e713b1cc4267433ab0698936f2542e63292a83a8db519c16da5c4c","observation_id":"0576a033-cee0-4769-80a0-a9d0efacd47c","resolution":{"observed_at":"2026-08-06T00:53:42.488397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15784/citation-record","integrity":"/paper/2505.15784/integrity","json":"/paper/2505.15784/citation-record.json","paper":"/paper/2505.15784"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:16:51.484930Z","title":"SMS Spam Collection","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.484930Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:1a692e79186650f38978ed8d67c5e06c7082e749f31a66fecad8e8bf3781b39e","observation_id":"063e8730-11b7-4bb7-b2e3-a4cc6095543c","resolution":{"observed_at":"2026-08-07T15:16:51.484930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14469","last_updated":"2025-05-27T07:25:49Z","snapshot_observed_at":"2026-08-08T01:27:17.124514Z","submitted_at":"2024-09-22T14:35:09Z","title":"Rethinking Semantic Parsing for Large Language Models: Enhancing LLM Performance with Semantic Hints","version":2},"cited_work":{"arxiv_id":"2409.14469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.14469","snapshot_observed_at":"2026-08-07T15:16:59.959288Z","title":"Rethinking Semantic Parsing for Large Language Models: Enhancing LLM Performance with Semantic Hints","venue":"cs.CL","work_id":"8c4e3ca8-cc86-4410-a384-0ee3fc51e69f","year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.617619Z"},"links":{"cited_paper":"/paper/2409.14469","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:91c5c9289a3ee7e960e0c50c70a9509735a2e6bbdce75be92de088ee28292b1d","observation_id":"c2303fa5-4113-4750-bb0c-ae92a9723f49","resolution":{"observed_at":"2026-08-07T15:17:00.006070Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:16:51.744108Z","title":"Thread: A logic-based data organization paradigm for how-to question answering with retrieval augmented generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.744108Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:f2acc902b6e28f0e19b32f944358d2039ebb9b7f015e72adee2739feacca1b9d","observation_id":"96b2a74f-4bdf-48f2-905e-8dbdb3f40190","resolution":{"observed_at":"2026-08-07T15:16:51.744108Z","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:16:51.804630Z","title":"Ultraif: Advancing instruction following from the wild","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.804630Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:89ef3dde9e1593d8ccb43dcfc4d60653e778b77b8520451cb754971ded3a5ab9","observation_id":"f965ca57-f193-44bc-a1a7-f8c78f21c757","resolution":{"observed_at":"2026-08-07T15:16:51.804630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15280","last_updated":"2024-12-18T04:08:18Z","snapshot_observed_at":"2026-07-06T20:10:29.099784Z","submitted_at":"2024-12-18T04:08:18Z","title":"Context-DPO: Aligning Language Models for Context-Faithfulness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15280","snapshot_observed_at":"2026-08-07T15:16:51.849593Z","title":"Context-dpo: Aligning language models for context-faithfulness","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.849593Z"},"links":{"cited_paper":"/paper/2412.15280","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:6a3621319889326d8fdb6ea232e9deefae2ad0e4524b8596f41f43fcf2071d2f","observation_id":"e1700061-75a5-4274-8994-3747b23cc3a0","resolution":{"observed_at":"2026-08-07T15:16:51.849593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11613","last_updated":"2024-05-21T04:52:32Z","snapshot_observed_at":"2026-07-06T18:16:24.847459Z","submitted_at":"2024-05-19T17:08:31Z","title":"Decoding by Contrasting Knowledge: Enhancing LLMs' Confidence on Edited Facts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11613","snapshot_observed_at":"2026-08-07T15:16:51.894014Z","title":"Decoding by contrasting knowledge: Enhancing llms' confidence on edited facts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.894014Z"},"links":{"cited_paper":"/paper/2405.11613","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:2dfa8e3a0c58808aac946bddd95d0f537eccc39d432e23d936fb12bc45276039","observation_id":"7e10401d-11b9-4c8f-8d4d-0d74027c9f52","resolution":{"observed_at":"2026-08-07T15:16:51.894014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00216","last_updated":"2024-10-04T03:30:24Z","snapshot_observed_at":"2026-07-06T17:53:19.196215Z","submitted_at":"2024-03-30T02:08:28Z","title":"Is Factuality Enhancement a Free Lunch For LLMs? Better Factuality Can Lead to Worse Context-Faithfulness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00216","snapshot_observed_at":"2026-08-07T15:16:51.960526Z","title":"Is factuality enhancement a free lunch for llms? better factuality can lead to worse context-faithfulness","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:51.960526Z"},"links":{"cited_paper":"/paper/2404.00216","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:d4c5ebb413e01136c4fc41838a8ef0404b73f2092f09681e25a08cba1fa27b01","observation_id":"9f7a9e99-41f0-4520-bcdf-493f41df5f6b","resolution":{"observed_at":"2026-08-07T15:16:51.960526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15888","last_updated":"2025-03-20T06:26:28Z","snapshot_observed_at":"2026-08-07T16:49:59.776500Z","submitted_at":"2025-03-20T06:26:28Z","title":"Parameters vs. Context: Fine-Grained Control of Knowledge Reliance in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15888","snapshot_observed_at":"2026-08-07T15:16:52.066040Z","title":"Parameters vs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.066040Z"},"links":{"cited_paper":"/paper/2503.15888","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:4ec1698330c24729f3a01adfcf9bacdcd0396b12ddb387c3223ea997f79e5b99","observation_id":"29337656-e44a-4826-bd43-932a878560c8","resolution":{"observed_at":"2026-08-07T15:16:52.066040Z","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:17:02.570755Z","title":"The description length of deep learning models","venue":null,"work_id":"649e2073-945b-420e-9c8e-1256e4fdb6a5","year":2018},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.156424Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:5104d7a5cdab85003aef503a641d21f0cba18ae1a0fcbac367044f63b85108b5","observation_id":"b565f13a-0316-46ff-9adc-beff92d250d3","resolution":{"observed_at":"2026-08-07T15:17:02.612692Z","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:16:52.297889Z","title":"A machine-independent theory of the complexity of recursive functions","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.297889Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:aa3caec1ce6b9784d2419923d03ec5fa7e4993ed1434c7015bef1eb04f9f94b2","observation_id":"de992326-10ad-430e-8841-94dc6d12912b","resolution":{"observed_at":"2026-08-07T15:16:52.297889Z","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":"10.1016/s0019-9958(67)90546-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:16:58.310298Z","title":"On the size of machines","venue":null,"work_id":"76a173e5-3b1f-43c2-af79-fd2b07fed470","year":1967},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.364209Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:9fa34d700d649435064f4a3f9182c8d7f9d6a3681730571d076cc1dad49818a7","observation_id":"bfd1848e-beb2-43ef-8641-1cc6e1686e2a","resolution":{"observed_at":"2026-08-07T15:16:58.395699Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-07T15:16:52.427280Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.427280Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:3166b42b1ebfa376d9e21ca738ff23c3b5fb8239da79e88e5062bbb3137cdc04","observation_id":"de458f8b-4516-4e22-a00e-8e44a4df9466","resolution":{"observed_at":"2026-08-07T15:16:52.427280Z","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:17:02.440839Z","title":"On the length of programs for computing finite binary sequences","venue":null,"work_id":"fde856f9-6730-485a-87fb-505562a49754","year":1966},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.500551Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:8c95c593160f11f783d43c53705e748a31994fb3e5627f820d4ac1096f39eb69","observation_id":"a31ef084-821d-4167-9544-29a3849dd989","resolution":{"observed_at":"2026-08-07T15:17:02.512565Z","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:17:02.257001Z","title":"Algorithmic information theory","venue":null,"work_id":"ae955da9-8a59-4269-9d41-1e1eecef8035","year":1977},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.560500Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:c89bd6fff1d2e1c5d81de6a61f5e198c5780520b0298e06f10926992aab08634","observation_id":"2f86e3ea-de33-4e34-bc26-38eed0021d0f","resolution":{"observed_at":"2026-08-07T15:17:02.344520Z","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:17:02.131441Z","title":"Kolmogorov's contributions to information theory and algorithmic complexity","venue":null,"work_id":"8760bad5-d276-48be-987b-d579398bdf3f","year":1989},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.645878Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:a0aa376ff81a9792e4d8b9e5665f9eac68488acd19232c29b6d8ff1a6e1fc295","observation_id":"10afb4f7-b91e-43cd-b3bd-42aae8f80c23","resolution":{"observed_at":"2026-08-07T15:17:02.171886Z","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":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T15:16:52.759595Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.759595Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:aae1f563bb6657f7c723d57158aaacfc7c1d2fe4a3eb9a97729ee639d35f7549","observation_id":"1a7301b0-73a8-4dc7-8ecd-26b186dd2ff0","resolution":{"observed_at":"2026-08-07T15:16:52.759595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T15:16:52.894506Z","title":"Zhang, Han Bao, Hanwei Xu, Haocheng Wang, Haowei Zhang, Honghui Ding, Huajian Xin, Huazuo Gao, Hui Li, and et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:52.894506Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:e02d27c1481fd636de511553d53aed822d8d7fb2ee35f416a19c3f2b85c70ea6","observation_id":"3805c81f-5a5e-4f6c-8704-b754bd75d894","resolution":{"observed_at":"2026-08-07T15:16:52.894506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10668","last_updated":"2024-03-18T23:15:47Z","snapshot_observed_at":"2026-07-06T16:20:36.866744Z","submitted_at":"2023-09-19T14:50:38Z","title":"Language Modeling Is Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10668","snapshot_observed_at":"2026-08-07T15:16:53.152526Z","title":"Language modeling is compression, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.152526Z"},"links":{"cited_paper":"/paper/2309.10668","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:a8f542c7169d24aa2a2b23ace23defa2c1d5158f4f9439393f6f179aa6e2ce07","observation_id":"9b17efdb-994a-4f66-acc9-99adddee4590","resolution":{"observed_at":"2026-08-07T15:16:53.152526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18424","last_updated":"2025-07-15T17:55:08Z","snapshot_observed_at":"2026-07-06T20:12:45.239449Z","submitted_at":"2024-12-24T13:39:32Z","title":"LongDocURL: a Comprehensive Multimodal Long Document Benchmark Integrating Understanding, Reasoning, and Locating","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18424","snapshot_observed_at":"2026-08-07T15:16:53.305435Z","title":"Longdocurl: a comprehensive multimodal long document benchmark integrating understanding, reasoning, and locating","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.305435Z"},"links":{"cited_paper":"/paper/2412.18424","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:91886ccd8ff1b2bf396ae7d6584c2136c68953b94fe883935417b49d5bb59798","observation_id":"3a9d30c0-8e9c-4076-b85d-7e259281f449","resolution":{"observed_at":"2026-08-07T15:16:53.305435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00234","last_updated":"2024-10-05T11:47:02Z","snapshot_observed_at":"2026-07-06T14:36:25.690733Z","submitted_at":"2022-12-31T15:57:09Z","title":"A Survey on In-context Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00234","snapshot_observed_at":"2026-08-07T15:16:53.406923Z","title":"A survey on in-context learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.406923Z"},"links":{"cited_paper":"/paper/2301.00234","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:badec11bd22815fa77bc878630a3a4136473af4b8e90d900c62d1b6aaaa31c09","observation_id":"39b5fd5a-8065-435b-9419-6ca2a0953f54","resolution":{"observed_at":"2026-08-07T15:16:53.406923Z","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:17:01.974589Z","title":"Algorithmic randomness and complexity","venue":null,"work_id":"b36b013a-6f33-47e8-b263-8504bccc53c3","year":2010},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.502884Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:4f2c03aae24c4c47f052a07ac869ea239d6d90836bd6f6a737fa92739142babb","observation_id":"da6596a0-67e9-4cf5-bb0c-59202bf5a026","resolution":{"observed_at":"2026-08-07T15:17:02.061652Z","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:17:01.827711Z","title":"Universal artificial intelligence: Practical agents and fundamental challenges","venue":null,"work_id":"e8f9bb03-e1d7-41c1-b44d-d63e810f89e6","year":2018},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.589352Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:9f4202685bb478074418f0c1a8c05a89e8ed490393094a99fd54554073043bb3","observation_id":"ef2d8872-f4f3-43c6-afce-f5f230f2d151","resolution":{"observed_at":"2026-08-07T15:17:01.886478Z","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":{"arxiv_id":"2503.19602","last_updated":"2025-03-25T12:37:22Z","snapshot_observed_at":"2026-08-07T16:38:32.727220Z","submitted_at":"2025-03-25T12:37:22Z","title":"Innate Reasoning is Not Enough: In-Context Learning Enhances Reasoning Large Language Models with Less Overthinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19602","snapshot_observed_at":"2026-08-07T15:16:53.737892Z","title":"Innate reasoning is not enough: In-context learning enhances reasoning large language models with less overthinking, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.737892Z"},"links":{"cited_paper":"/paper/2503.19602","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:e8bd27daa0ecdcef99210ea9df16c232bb2456eb2b8ea70b34a01151598b4008","observation_id":"f4d3b6f9-ea66-41ec-84a0-5f8bad2452f3","resolution":{"observed_at":"2026-08-07T15:16:53.737892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06102","last_updated":"2024-06-06T22:59:58Z","snapshot_observed_at":"2026-08-08T01:23:42.996552Z","submitted_at":"2024-01-11T18:33:48Z","title":"Patchscopes: A Unifying Framework for Inspecting Hidden Representations of Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06102","snapshot_observed_at":"2026-08-07T15:16:53.836079Z","title":"Patchscopes: A unifying framework for inspecting hidden representations of language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.836079Z"},"links":{"cited_paper":"/paper/2401.06102","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:185539db2213c4d7abac73e50cc898c75f7ed61fb4431f29d7634f7464131d8c","observation_id":"81aaf466-036e-4103-8824-ae3b8996ae75","resolution":{"observed_at":"2026-08-07T15:16:53.836079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T15:16:53.936683Z","title":"The llama 3 herd of models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.936683Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:e213ed197bad20fb53ee5f2e6ef93934e45a8a6d7ac0b9dc8eef47d3eb0001a6","observation_id":"11072295-2885-46d5-98ab-1d28c599932b","resolution":{"observed_at":"2026-08-07T15:16:53.936683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14953","last_updated":"2024-01-26T15:37:16Z","snapshot_observed_at":"2026-07-06T17:20:57.937385Z","submitted_at":"2024-01-26T15:37:16Z","title":"Learning Universal Predictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14953","snapshot_observed_at":"2026-08-07T15:16:53.975628Z","title":"Learning universal predictors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:53.975628Z"},"links":{"cited_paper":"/paper/2401.14953","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:072356ca5bbc1bf10560d1c59b6834981fa873fec742cdb0078b927abdcfc1e4","observation_id":"81c8af4e-bd3d-4810-85cf-e5d9d5c1edc5","resolution":{"observed_at":"2026-08-07T15:16:53.975628Z","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:17:01.701364Z","title":"Skywork open reasoner series","venue":null,"work_id":"38ebaab6-1982-497d-af8b-e7816d3e6e16","year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.021362Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:f435c9766ec9d35b08a42889da042391b75c60bebb42f1012a45f70c1bab45cc","observation_id":"b3bd4cd0-35fc-449d-af00-30a7c793c9d9","resolution":{"observed_at":"2026-08-07T15:17:01.744607Z","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:16:54.068533Z","title":"Execoder: Empowering large language models with executability representation for code translation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.068533Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:152d19ac049fe6fe24976cb4c3107a900824f091504cf10b0b50e9c294f93b0e","observation_id":"00a5545e-0df4-4ca0-a72b-6cd2a7724462","resolution":{"observed_at":"2026-08-07T15:16:54.068533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00352","last_updated":"2024-11-01T14:36:52Z","snapshot_observed_at":"2026-07-06T16:01:07.532053Z","submitted_at":"2023-08-01T07:49:10Z","title":"MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00352","snapshot_observed_at":"2026-08-07T15:16:54.143267Z","title":"Metagpt: Meta programming for multi-agent collaborative framework","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.143267Z"},"links":{"cited_paper":"/paper/2308.00352","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:b6547e62b2ae8b3054deac375edc5dc3f249d6ef61727e9192fc17b4be240ee0","observation_id":"7021705c-4ef4-42d1-b236-c125abfa1979","resolution":{"observed_at":"2026-08-07T15:16:54.143267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07207","last_updated":"2022-03-08T06:47:17Z","snapshot_observed_at":"2026-08-06T08:07:23.771593Z","submitted_at":"2022-01-18T18:59:45Z","title":"Language Models as Zero-Shot Planners: Extracting Actionable Knowledge for Embodied Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07207","snapshot_observed_at":"2026-08-07T15:16:54.255854Z","title":"Language models as zero-shot planners: Extracting actionable knowledge for embodied agents, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.255854Z"},"links":{"cited_paper":"/paper/2201.07207","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:c7cf396bc0bb7a2d03967b8ba414f716fd69e3a1aaf9a95ad5dcda7412d18f7c","observation_id":"34251197-bd0b-4a06-b84f-34d70b086294","resolution":{"observed_at":"2026-08-07T15:16:54.255854Z","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:17:01.552871Z","title":"Universal artificial intelligence: Sequential decisions based on algorithmic probability","venue":null,"work_id":"9d8b5450-0b32-4434-8565-2c13af2ad4df","year":2005},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.311883Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:1fc1a399dc021f80473f7fddaa3010167b421e247c01c4e7084b5569974a23d6","observation_id":"9ee812aa-c167-4ff8-84d8-9d6af7c3d67f","resolution":{"observed_at":"2026-08-07T15:17:01.619859Z","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:17:01.405625Z","title":"Large language models are zero-shot reasoners","venue":null,"work_id":"340cb768-8156-49e9-915c-8b121a30b8b0","year":2022},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.376732Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:f1a5093f2c89bd4d715291c0200c3c81d506311461278ac3eae96ff46c9602e7","observation_id":"4880b93c-558a-4201-a765-86a8924081b3","resolution":{"observed_at":"2026-08-07T15:17:01.475405Z","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:16:54.423708Z","title":"Three approaches to the quantitative definition ofinformation’","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.423708Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:c679757d52a0595f33fd4924575e83dd6f7b0b2cd26a34cd5451236c575cb746","observation_id":"30eb98ae-58b9-420e-9a6c-25879fcbfdcc","resolution":{"observed_at":"2026-08-07T15:16:54.423708Z","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:16:54.485857Z","title":"An introduction to Kolmogorov complexity and its applications, volume 3","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.485857Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:92973c4c4b4aebe522e87c5f5632c73d38bbd43a7df97f77dece35621a94c4d8","observation_id":"0347d50a-547c-49e4-b624-e663eee1dca0","resolution":{"observed_at":"2026-08-07T15:16:54.485857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16476","last_updated":"2024-02-20T03:35:46Z","snapshot_observed_at":"2026-07-06T16:53:35.776613Z","submitted_at":"2023-11-25T04:11:19Z","title":"LANS: A Layout-Aware Neural Solver for Plane Geometry Problem","version":2},"cited_work":{"arxiv_id":"2311.16476","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.16476","snapshot_observed_at":"2026-08-07T15:16:59.316263Z","title":"LANS: A Layout-Aware Neural Solver for Plane Geometry Problem","venue":"cs.CV","work_id":"f10398da-bbca-484c-925a-c0275ae0d914","year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.578468Z"},"links":{"cited_paper":"/paper/2311.16476","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:11d529d04009e10d09a5214fb23014dca6347456d3c7a7d12968bf987bc2914f","observation_id":"0fb635be-79ec-4198-adf7-c64a290b74e0","resolution":{"observed_at":"2026-08-07T15:16:59.354860Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12023","last_updated":"2024-06-28T02:35:51Z","snapshot_observed_at":"2026-08-08T00:25:07.037916Z","submitted_at":"2024-06-28T02:35:51Z","title":"CMMaTH: A Chinese Multi-modal Math Skill Evaluation Benchmark for Foundation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12023","snapshot_observed_at":"2026-08-07T15:16:54.680465Z","title":"Cmmath: A chinese multi-modal math skill evaluation benchmark for foundation models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.680465Z"},"links":{"cited_paper":"/paper/2407.12023","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:fd08bfc4f633270c2fdb2014cb8ebee3da30cca52311d8c7e208dc393982f74b","observation_id":"3a2d1bc4-7646-444a-aad8-f7820aa139d3","resolution":{"observed_at":"2026-08-07T15:16:54.680465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17419","last_updated":"2025-06-25T02:24:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-24T18:50:52Z","title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17419","snapshot_observed_at":"2026-08-07T15:16:54.898226Z","title":"From system 1 to system 2: A survey of reasoning large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:54.898226Z"},"links":{"cited_paper":"/paper/2502.17419","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:00f2e5540e4510984b16111159594d9520faff2e70419d3c85051a46d36d5aa3","observation_id":"b9d9f04a-19ea-4bca-8a46-886a32ab02dd","resolution":{"observed_at":"2026-08-07T15:16:54.898226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17140","last_updated":"2025-05-19T16:12:40Z","snapshot_observed_at":"2026-07-06T19:22:14.655041Z","submitted_at":"2024-09-25T17:58:08Z","title":"AXIS: Efficient Human-Agent-Computer Interaction with API-First LLM-Based Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17140","snapshot_observed_at":"2026-08-07T15:16:55.023995Z","title":"Axis: Efficient human-agent-computer interaction with api-first llm-based agents, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.023995Z"},"links":{"cited_paper":"/paper/2409.17140","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:b30b10b5a1b42cc6e2f00c5f9becd05ba4e159576f1e6e8a2536c34f881b0e9f","observation_id":"ad78c414-b15c-45f5-856c-0f50f8730958","resolution":{"observed_at":"2026-08-07T15:16:55.023995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.06707","last_updated":"2021-11-12T13:13:20Z","snapshot_observed_at":"2026-07-06T12:07:52.725269Z","submitted_at":"2021-11-12T13:13:20Z","title":"Transformer-based Image Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.06707","snapshot_observed_at":"2026-08-07T15:16:55.122972Z","title":"Transformer-based image compression","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.122972Z"},"links":{"cited_paper":"/paper/2111.06707","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:6b9eaa04f84cf6ef69697593509cb9e7961ad00b34755965d58c38639c13102e","observation_id":"1c9a0532-3550-4e71-ac41-4885455bbf60","resolution":{"observed_at":"2026-08-07T15:16:55.122972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12874","last_updated":"2024-02-22T04:28:03Z","snapshot_observed_at":"2026-08-07T02:42:56.838903Z","submitted_at":"2024-01-23T16:09:53Z","title":"From Understanding to Utilization: A Survey on Explainability for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12874","snapshot_observed_at":"2026-08-07T15:16:55.208855Z","title":"From understanding to utilization: A survey on explainability for large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.208855Z"},"links":{"cited_paper":"/paper/2401.12874","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:94e4594e21e8772b5d4334792801c32cfccc08a1c646ea568d6a3a2b9f45444b","observation_id":"42bf7bef-ce1e-4a87-b93f-7a4aa653eac6","resolution":{"observed_at":"2026-08-07T15:16:55.208855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12585","last_updated":"2024-11-12T05:09:34Z","snapshot_observed_at":"2026-08-04T05:12:44.639900Z","submitted_at":"2024-01-23T09:33:31Z","title":"SLANG: New Concept Comprehension of Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12585","snapshot_observed_at":"2026-08-07T15:16:55.313146Z","title":"Slang: New concept comprehension of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.313146Z"},"links":{"cited_paper":"/paper/2401.12585","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:0b33da7577c536985eaec24634765126e838fd9b49f5ba52b3155ab6a27059ec","observation_id":"ce65875d-9c8b-4131-be96-ce13e587cbcc","resolution":{"observed_at":"2026-08-07T15:16:55.313146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11668","last_updated":"2025-02-03T09:25:08Z","snapshot_observed_at":"2026-07-06T18:32:19.794373Z","submitted_at":"2024-06-17T15:51:01Z","title":"\"Not Aligned\" is Not \"Malicious\": Being Careful about Hallucinations of Large Language Models' Jailbreak","version":2},"cited_work":{"arxiv_id":"2406.11668","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.11668","snapshot_observed_at":"2026-08-07T15:16:59.097720Z","title":"\"Not Aligned\" is Not \"Malicious\": Being Careful about Hallucinations of Large Language Models' Jailbreak","venue":"cs.CL","work_id":"1ed938cd-e2fd-48e5-9850-5c870ff60c49","year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.429639Z"},"links":{"cited_paper":"/paper/2406.11668","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:656461c47081c6767300f632605b8b6301db9c7c6d1d63836510b760fa709031","observation_id":"2c302736-5bdd-4d74-b443-f6b53293b9b8","resolution":{"observed_at":"2026-08-07T15:16:59.143657Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02684","last_updated":"2024-10-03T17:10:41Z","snapshot_observed_at":"2026-07-06T19:27:07.844117Z","submitted_at":"2024-10-03T17:10:41Z","title":"HiddenGuard: Fine-Grained Safe Generation with Specialized Representation Router","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02684","snapshot_observed_at":"2026-08-07T15:16:55.525371Z","title":"Hiddenguard: Fine-grained safe generation with specialized representation router","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.525371Z"},"links":{"cited_paper":"/paper/2410.02684","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:9b75c195ec819d2516197ca3fc02927d07aab462725c20453769da2b4c76c6f3","observation_id":"73e0e226-e525-44f9-ba6f-ce2ed602f289","resolution":{"observed_at":"2026-08-07T15:16:55.525371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14597","last_updated":"2025-04-20T12:55:59Z","snapshot_observed_at":"2026-08-07T16:00:47.654878Z","submitted_at":"2025-04-20T12:55:59Z","title":"a1: Steep Test-time Scaling Law via Environment Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14597","snapshot_observed_at":"2026-08-07T15:16:55.637101Z","title":"a1: Steep test-time scaling law via environment augmented generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.637101Z"},"links":{"cited_paper":"/paper/2504.14597","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:032940e5422e66209d7d0ed2f2ded5444cf3c4950ba89b2979d2332b47258d4e","observation_id":"1cfa35e8-1059-4f10-be37-eeac3ae781cc","resolution":{"observed_at":"2026-08-07T15:16:55.637101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05262","last_updated":"2023-01-13T15:16:16Z","snapshot_observed_at":"2026-07-06T12:36:34.388460Z","submitted_at":"2022-02-10T18:59:54Z","title":"Locating and Editing Factual Associations in GPT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.05262","snapshot_observed_at":"2026-08-07T15:16:55.753720Z","title":"Locating and editing factual associations in gpt, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.753720Z"},"links":{"cited_paper":"/paper/2202.05262","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:3a9dbd090bfc7a03e15924391ed19ab35505e5b6d593707010a041b97da48893","observation_id":"0d744c41-e6d3-4e06-9767-a979718b2ee8","resolution":{"observed_at":"2026-08-07T15:16:55.753720Z","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:16:55.836464Z","title":"Transformerlens","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.836464Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:c18ff00c85adde49892fc6b5949891d8a2e28440fa828dc0aca4f1361433d434","observation_id":"4fb1d51c-f772-44c4-a2cf-d3ebad3455ff","resolution":{"observed_at":"2026-08-07T15:16:55.836464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T15:16:55.911790Z","title":"Gpt-4 technical report, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.911790Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:1251f24cb4986eda4f8f6597d4b9e6c30d7b273bbd364a7d89fa3c0cb6f4d849","observation_id":"312c8e3a-6d7b-426e-b813-ba0421a1bc6c","resolution":{"observed_at":"2026-08-07T15:16:55.911790Z","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:17:01.202117Z","title":"Introducing openai o1-preview","venue":null,"work_id":"628731d7-6b17-4ad4-9c67-123c21daec2b","year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:55.987802Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:b330a064a16339b0ceae3c8d295883c4f3f59576aa21bef381470e21b2e2c5bf","observation_id":"aa5011c6-e183-4ebc-96b3-919c2cf5667f","resolution":{"observed_at":"2026-08-07T15:17:01.301367Z","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":{"arxiv_id":"2304.03277","last_updated":"2023-04-06T17:58:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-04-06T17:58:09Z","title":"Instruction Tuning with GPT-4","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.03277","snapshot_observed_at":"2026-08-07T15:16:56.087217Z","title":"Instruction tuning with gpt-4","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.087217Z"},"links":{"cited_paper":"/paper/2304.03277","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:b10ef56bb3d05e517d8b2ed7e3ee49e85f70adcc33d62a60436ae31bd068edb4","observation_id":"9cc79de1-34e4-403b-8ef2-b44a6b44a7b7","resolution":{"observed_at":"2026-08-07T15:16:56.087217Z","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:16:56.298434Z","title":"A practical review of mechanistic interpretability for transformer-based language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.298434Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:d382a2380b2db1aa6be7edfa54fbc8a0fb2fad840c374b5557b03f9b62fc1ca4","observation_id":"f0b9882f-f2ae-4d55-9cdd-b3e959dec410","resolution":{"observed_at":"2026-08-07T15:16:56.298434Z","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:16:56.389791Z","title":"CARER : Contextualized affect representations for emotion recognition","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.389791Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:f4ba646d1293a24f1d5dfd83df6ac027c4ebc18f27a610ee01b16521c6072623","observation_id":"f492f16e-e45c-4ce0-982a-86eac8499a15","resolution":{"observed_at":"2026-08-07T15:16:56.389791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-07T15:16:56.517060Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.517060Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:15e7b2d30cf95081170cc903b58fcd79a9780e031d4fb33f42dbd4950a5437c3","observation_id":"89fc6a48-9d8d-48a9-b0af-02d9e19479ff","resolution":{"observed_at":"2026-08-07T15:16:56.517060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T15:16:56.587332Z","title":"Scaling llm test-time compute optimally can be more effective than scaling model parameters, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.587332Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:d6db734d7bd594f661d714a1a1a00a6d795b38a51a4bb98e54a16d52fec1cad5","observation_id":"a188d018-802a-479f-a1b1-0ff7f46b14c2","resolution":{"observed_at":"2026-08-07T15:16:56.587332Z","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:17:01.035759Z","title":"A preliminary report on a general theory of inductive inference","venue":null,"work_id":"4c93565a-a53c-4c8f-b9ef-1b66058e5d57","year":1960},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.670498Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:4641ffdb536b9ced91187f522d4cd46cd9b8c05389866964d24b0125c5c5f803","observation_id":"210ed9f3-4430-4385-9d6a-6b6258149046","resolution":{"observed_at":"2026-08-07T15:17:01.104483Z","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:17:00.865286Z","title":"A formal theory of inductive inference","venue":null,"work_id":"f41a9668-1208-4ec1-9ca0-e61ff0e5947f","year":1964},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.772927Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:c35a9599faea0c0f201d3052208049fa4fabc05ff695241196c69652381b34da","observation_id":"814e54eb-b853-4673-9f1f-e33ffba982b7","resolution":{"observed_at":"2026-08-07T15:17:00.935166Z","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:17:00.686940Z","title":"A formal theory of inductive inference","venue":null,"work_id":"1297e4c7-f51d-426e-8e5c-26c0db7cf933","year":1964},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.858374Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:400edb2a36de34e7caf3058bf544b85249effd22f4823e573e5be0fca07eeba2","observation_id":"62648050-39f1-4b38-9eb1-3cb905f02c25","resolution":{"observed_at":"2026-08-07T15:17:00.785520Z","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":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-07T15:16:56.945343Z","title":"Kimi k1.5: Scaling reinforcement learning with llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:56.945343Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:db87274aa7de0a90e3f3a690dcbd27cd15e6f6bdff03b2df3cb7d6e45c430f43","observation_id":"b9f17ff1-1d57-42ea-9394-d713f93832ba","resolution":{"observed_at":"2026-08-07T15:16:56.945343Z","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:16:57.012634Z","title":"Qwq: Reflect deeply on the boundaries of the unknown, November 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.012634Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:bb307aab3832fcc193e11e046c7b087c6fa70aa08d6bba9f2a7c4ab83deb2717","observation_id":"cfb34b46-7e04-432c-b965-e8246a76d14e","resolution":{"observed_at":"2026-08-07T15:16:57.012634Z","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:17:00.537613Z","title":"On computable numbers, with an application to the entscheidungsproblem","venue":null,"work_id":"cae8f652-1393-449f-93a2-fbec89c244e8","year":1936},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.134787Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:191839f6f745e84ebd2d078e447b06c6af5bb57b20ccdc9f898e2472f8f18dc6","observation_id":"11adbf14-bccb-452d-bc21-ace4434a31db","resolution":{"observed_at":"2026-08-07T15:17:00.596753Z","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:17:00.422976Z","title":"Solomonoff induction: A solution to the problem of the priors? 2012","venue":null,"work_id":"4bbd5404-7a76-415f-a778-1646c6bf3db7","year":2012},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.235483Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:4a3cc112278489d1229682fb79befff562490c0d5da5e9b421df9664ccea5134","observation_id":"5ace1298-03f8-4244-bb27-647eb28bc6fc","resolution":{"observed_at":"2026-08-07T15:17:00.465245Z","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":{"arxiv_id":"2501.06802","last_updated":"2025-02-10T13:55:12Z","snapshot_observed_at":"2026-07-06T20:19:55.486841Z","submitted_at":"2025-01-12T12:52:52Z","title":"Unifying Two Types of Scaling Laws from the Perspective of Conditional Kolmogorov Complexity","version":2},"cited_work":{"arxiv_id":"2501.06802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.06802","snapshot_observed_at":"2026-08-07T15:16:58.801204Z","title":"Unifying Two Types of Scaling Laws from the Perspective of Conditional Kolmogorov Complexity","venue":"cs.AI","work_id":"932dc1af-b0b3-4b84-a129-ba9fd5b127e7","year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.320208Z"},"links":{"cited_paper":"/paper/2501.06802","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:a847c2b5153c52c0a892f9dfd1d168610f18e9783a978e8580e4fdb38152b1bf","observation_id":"f9b59dec-6719-4608-bbc0-9283798d47d1","resolution":{"observed_at":"2026-08-07T15:16:58.849955Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14160","last_updated":"2023-12-19T15:13:52Z","snapshot_observed_at":"2026-08-04T17:03:48.643939Z","submitted_at":"2023-05-23T15:26:20Z","title":"Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14160","snapshot_observed_at":"2026-08-07T15:16:57.387765Z","title":"Label words are anchors: An information flow perspective for understanding in-context learning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.387765Z"},"links":{"cited_paper":"/paper/2305.14160","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:1dcdd68e1355ec3ffce590f66a26f88f0bc4b5f7a0b7ad6355b4bb7f0d346aa7","observation_id":"1ce54816-f4f9-4630-aa7b-8d46f994fbe2","resolution":{"observed_at":"2026-08-07T15:16:57.387765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.10047","last_updated":"2025-01-13T06:47:21Z","snapshot_observed_at":"2026-07-06T20:06:30.732685Z","submitted_at":"2024-12-13T11:19:56Z","title":"Large Action Models: From Inception to Implementation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10047","snapshot_observed_at":"2026-08-07T15:16:57.441509Z","title":"Large action models: From inception to implementation, 2025 a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.441509Z"},"links":{"cited_paper":"/paper/2412.10047","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:0f1a10c6dc2036b477adadeb378dacd7e1dfbcfafe75e09ea56b70c43823a989","observation_id":"2692954f-9d70-4812-bab0-80dbe18c3b38","resolution":{"observed_at":"2026-08-07T15:16:57.441509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20808","last_updated":"2025-08-01T13:54:16Z","snapshot_observed_at":"2026-08-07T17:40:37.569464Z","submitted_at":"2025-02-28T07:50:36Z","title":"MV-MATH: Evaluating Multimodal Math Reasoning in Multi-Visual Contexts","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20808","snapshot_observed_at":"2026-08-07T15:16:57.541637Z","title":"Mv-math: Evaluating multimodal math reasoning in multi-visual contexts","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.541637Z"},"links":{"cited_paper":"/paper/2502.20808","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:63350a3ac06a9b32d8d848ccc16552af57eba7da010ad121f1c5512aebf094ac","observation_id":"6313a9a0-bfa3-4c41-9dc2-90a4c2c4056c","resolution":{"observed_at":"2026-08-07T15:16:57.541637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07682","last_updated":"2022-10-26T05:06:24Z","snapshot_observed_at":"2026-08-02T15:56:35.249569Z","submitted_at":"2022-06-15T17:32:01Z","title":"Emergent Abilities of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07682","snapshot_observed_at":"2026-08-07T15:16:57.602694Z","title":"Chi, Tatsunori Hashimoto, Oriol Vinyals, Percy Liang, Jeff Dean, and William Fedus","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.602694Z"},"links":{"cited_paper":"/paper/2206.07682","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:81ac2d505e2b66b92ec1f007ba7a8b12bb7af6abe6e443aaddd6b351b2817ddd","observation_id":"0bd0ce87-526f-45a9-a168-a6756be01759","resolution":{"observed_at":"2026-08-07T15:16:57.602694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09954","last_updated":"2025-07-24T11:16:48Z","snapshot_observed_at":"2026-08-01T01:37:02.582985Z","submitted_at":"2023-08-19T09:17:19Z","title":"DocTER: Evaluating Document-based Knowledge Editing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09954","snapshot_observed_at":"2026-08-07T15:16:57.652743Z","title":"Eva-kellm: A new benchmark for evaluating knowledge editing of llms, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.652743Z"},"links":{"cited_paper":"/paper/2308.09954","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:17414dd788ff0b66fb2313fbd59aea81145d97c78442cedeb4da550035ef2685","observation_id":"5ab0b59c-3cf5-4dd5-82e3-e4859904b8d9","resolution":{"observed_at":"2026-08-07T15:16:57.652743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14285","last_updated":"2025-05-17T10:50:48Z","snapshot_observed_at":"2026-08-07T18:02:57.007728Z","submitted_at":"2025-02-20T05:52:10Z","title":"Vulnerability of Text-to-Image Models to Prompt Template Stealing: A Differential Evolution Approach","version":2},"cited_work":{"arxiv_id":"2502.14285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.14285","snapshot_observed_at":"2026-08-07T15:16:58.607623Z","title":"Vulnerability of Text-to-Image Models to Prompt Template Stealing: A Differential Evolution Approach","venue":"cs.CL","work_id":"7aebeb96-68cc-4267-b262-db579801c5a2","year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.693639Z"},"links":{"cited_paper":"/paper/2502.14285","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:f9c3c3d14a2aa7aca1210c8bba3c5336900c6a9ee6c8e1127172de80ec2d81f4","observation_id":"2557e727-8c86-4750-aa2b-cbb4a40c6666","resolution":{"observed_at":"2026-08-07T15:16:58.661373Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11284","last_updated":"2025-01-20T05:44:01Z","snapshot_observed_at":"2026-08-06T13:30:45.600197Z","submitted_at":"2025-01-20T05:44:01Z","title":"RedStar: Does Scaling Long-CoT Data Unlock Better Slow-Reasoning Systems?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11284","snapshot_observed_at":"2026-08-07T15:16:57.734912Z","title":"Redstar: Does scaling long-cot data unlock better slow-reasoning systems? arXiv preprint arXiv:2501.11284, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.734912Z"},"links":{"cited_paper":"/paper/2501.11284","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:349492ec2348bfb6aa5db826e62483d48276d6e08178fd698bcc9d2cdeebc3a8","observation_id":"745326d5-d3df-44cf-8a7b-fc14584ec5d4","resolution":{"observed_at":"2026-08-07T15:16:57.734912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T15:16:57.828522Z","title":"Qwen2.5 technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.828522Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:ac86dbdd690b59b27e869dbf3f02b81f6e4151663ba8488841cfc60935757093","observation_id":"349c0283-1552-4f94-832c-dadb5d441bc5","resolution":{"observed_at":"2026-08-07T15:16:57.828522Z","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:17:00.258125Z","title":"Make pixels dance: High-dynamic video generation","venue":null,"work_id":"724ae279-489a-4c1c-bf00-b79fc91bc6a1","year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.901676Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:ac6cebbcf443120304aa9a874d37c3c70aa55b26a2425d18e4a060fad3312452","observation_id":"a74f186e-0304-43c7-93f0-d1c0e90b6b20","resolution":{"observed_at":"2026-08-07T15:17:00.325172Z","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:17:00.129138Z","title":null,"venue":null,"work_id":"7f484f80-8ffe-41dc-8f10-9125ac8d1bf1","year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.950835Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:a782147bd0c315893f86cca7bff49ba6961733a4216de23651483ad2aaf6fed6","observation_id":"d9db8339-f999-4bc2-9144-494bcc9d353b","resolution":{"observed_at":"2026-08-07T15:17:00.202992Z","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":{"arxiv_id":"2402.10104","last_updated":"2024-05-17T11:42:09Z","snapshot_observed_at":"2026-08-02T04:20:17.705360Z","submitted_at":"2024-02-15T16:59:41Z","title":"GeoEval: Benchmark for Evaluating LLMs and Multi-Modal Models on Geometry Problem-Solving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10104","snapshot_observed_at":"2026-08-07T15:16:57.983725Z","title":"Geoeval: benchmark for evaluating llms and multi-modal models on geometry problem-solving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:57.983725Z"},"links":{"cited_paper":"/paper/2402.10104","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:9b9a2d5afc7a07fc39789c9ba9d68700cde1853400b69074509ded55a250c169","observation_id":"2b655570-8226-4053-8528-253118b0354a","resolution":{"observed_at":"2026-08-07T15:16:57.983725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07327","last_updated":"2024-07-10T02:45:22Z","snapshot_observed_at":"2026-07-06T18:43:59.807904Z","submitted_at":"2024-07-10T02:45:22Z","title":"Fuse, Reason and Verify: Geometry Problem Solving with Parsed Clauses from Diagram","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07327","snapshot_observed_at":"2026-08-07T15:16:58.023434Z","title":"Fuse, reason and verify: Geometry problem solving with parsed clauses from diagram","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:58.023434Z"},"links":{"cited_paper":"/paper/2407.07327","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:6d339a58dc3d137e26f8fbe85f57f971e3d17e9a37c1f0351f138e5eeb39be91","observation_id":"9831e4d2-ae48-47a0-9902-72a05f445a34","resolution":{"observed_at":"2026-08-07T15:16:58.023434Z","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:16:58.083588Z","title":"Character-level convolutional networks for text classification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:58.083588Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:cd5b8177abe1d3cef748206915e7fa9c479bcc977f46a0f54fc725612b1d569d","observation_id":"58260eb3-a5aa-48e6-ae5c-17988f85a9be","resolution":{"observed_at":"2026-08-07T15:16:58.083588Z","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:16:58.115211Z","title":"Distributed rule vectors is a key mechanism in large language models' in-context learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:58.115211Z"},"links":{"citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:59b0fe60f265ff5b9bb615c192f5fa1d4e0c4ca9e909ea421926aa1c156f3b47","observation_id":"8de304f0-333c-429c-8dc2-d762c8d67e0c","resolution":{"observed_at":"2026-08-07T15:16:58.115211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18906","last_updated":"2025-02-26T07:52:02Z","snapshot_observed_at":"2026-08-07T17:47:52.710195Z","submitted_at":"2025-02-26T07:52:02Z","title":"VEM: Environment-Free Exploration for Training GUI Agent with Value Environment Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18906","snapshot_observed_at":"2026-08-07T15:16:58.158791Z","title":"Vem: Environment-free exploration for training gui agent with value environment model","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:58.158791Z"},"links":{"cited_paper":"/paper/2502.18906","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:812fbce6ae061959d2043a5623e97fc9a1f467be807cffbbcde1489b5640072f","observation_id":"1372aead-09ce-45b9-a4b8-73246fe1fc1a","resolution":{"observed_at":"2026-08-07T15:16:58.158791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00879","last_updated":"2025-05-22T22:00:19Z","snapshot_observed_at":"2026-07-06T20:15:31.955797Z","submitted_at":"2025-01-01T15:57:34Z","title":"TrustRAG: Enhancing Robustness and Trustworthiness in Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00879","snapshot_observed_at":"2026-08-07T15:16:58.216555Z","title":"Trustrag: Enhancing robustness and trustworthiness in rag, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-07T15:16:58.216555Z"},"links":{"cited_paper":"/paper/2501.00879","citing_paper":"/paper/2505.15784"},"observation_digest":"sha256:ab53a2475a949329337acbbfd77455740ea7bda8cde862757ff3b1c83b0bc6cf","observation_id":"bb2a710f-6021-4e02-a6d1-55ff4db90a19","resolution":{"observed_at":"2026-08-07T15:16:58.216555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15784","last_updated":"2025-05-21T17:35:08Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T17:38:59.010547Z","submitted_at":"2025-05-21T17:35:08Z","title":"Large Language Models as Computable Approximations to Solomonoff Induction"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":55,"verified_exact":6,"verified_fuzzy":16},"total_outbound_references":77},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 2 inbound Pith citation observations for arXiv:2505.15784."}