{"as_of":"2026-08-16T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24fd643e5e94e49684de940ff0b98edabadca176032012786a257e7c68c18470","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:15:59.355758Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.03781/citation-record","integrity":"/paper/1908.03781/integrity","json":"/paper/1908.03781/citation-record.json","paper":"/paper/1908.03781"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:00.794350Z","title":"A new look at the statistical model identification.Automatica, 19(6):465–471, 1978","venue":null,"work_id":"d01c50b3-5e4c-4313-a4e4-dc59cee1ef3d","year":1978},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.904425Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:012eb5d901cead034e10a43ae1d3ab93c38984df567dfef2507ea179abaf7c41","observation_id":"45002d92-923a-4bd7-a686-2903491a5e7f","resolution":{"observed_at":"2026-08-14T14:16:00.803693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.729034Z","title":null,"venue":null,"work_id":"af96b236-2a9f-4416-af05-2de3261b9c7a","year":1961},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.915219Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:6d72c841c31ae8ae5811b9a2753d8d023c22a1e2a0f1b3ab81b8024afb2bad7f","observation_id":"b7c28416-51ca-47f2-bddb-b76335ee3c62","resolution":{"observed_at":"2026-08-14T14:16:00.751046Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.650970Z","title":"Compression of data streams down to their information content","venue":null,"work_id":"165b7989-92e7-434e-a889-28047e0d6f1d","year":2019},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.943437Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:b77f58b4391837c3f9091c1d16bfcafdf586733a6b6444489a65324102af652b","observation_id":"26f41abb-57d6-4968-95b1-0d2ee4460bdb","resolution":{"observed_at":"2026-08-14T14:16:00.666906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.623674Z","title":"Bishop.Pattern recognition and machine learning","venue":null,"work_id":"f906cf3a-828d-4488-86c4-6284ff59a25f","year":2006},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.956242Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:3514b7e5c89cd00b19b8dcf64abbe294088918a99b6e5c87c4f37aa36e37b33a","observation_id":"ba41c213-907b-4199-9381-f2062c7cf528","resolution":{"observed_at":"2026-08-14T14:16:00.631788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.539929Z","title":"Some theorems on incremental compression","venue":null,"work_id":"e9eea33a-afb1-46c4-9c45-2bdcd827437c","year":2016},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.964127Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:47f0381baa849913b0241977e825d5442c4309badfe5cb31b7118d32ca853008","observation_id":"8c290275-552e-4ad2-8ea5-fff13ed2c533","resolution":{"observed_at":"2026-08-14T14:16:00.555090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.493540Z","title":"Introducing WILLIAM: a system for inductive inference based on the theory of incremental compression","venue":null,"work_id":"c24422f3-4978-433d-902a-f5b89ff21a8b","year":2018},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.977413Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:24f5895432412261e6032e40fda7d209c24f817608b0c79b4e6c476f23f2bf41","observation_id":"a8aa34eb-fcf2-4ac6-b977-7d0cf40c42ee","resolution":{"observed_at":"2026-08-14T14:16:00.508353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.445919Z","title":"WILLIAM: A monolithic approach to AGI","venue":null,"work_id":"307f2728-53cc-4429-9ef3-2ea48157bed7","year":2019},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:58.993017Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:e1e29699b48ce4069378d65ea525850f81bd19457ff8f67a53a57c49b0e2f92c","observation_id":"6d1d844a-b0b4-43cd-a749-1fe9531c25ae","resolution":{"observed_at":"2026-08-14T14:16:00.457590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.389421Z","title":"Hinton and Ruslan R","venue":null,"work_id":"bea5b949-6594-44ea-a90b-c8cf678bb389","year":2006},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.012962Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:559b140bc79a6827d3b54bc88a185b88c4a8e5212a8525b9afdd9024b1534256","observation_id":"ef5a6610-1450-4ce4-9874-7b66effa969d","resolution":{"observed_at":"2026-08-14T14:16:00.401487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.348800Z","title":"Hinton, Simon Osindero, and Yee-Whye Teh","venue":null,"work_id":"780a30c5-17f8-496c-b1b3-bcb3b9059691","year":2006},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.020882Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:aecf7bdfd46e3f97ce113358ea07dc3d61bea6a37be6fea930af7223e297f64e","observation_id":"09e097e5-5282-46b8-8a0f-eeeb5801354b","resolution":{"observed_at":"2026-08-14T14:16:00.360669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.306507Z","title":"The fastest and shortest algorithm for all well-defined problems.International Journal of Foundations of Computer Science, 13(3):431–443, June 2002","venue":null,"work_id":"c78204d7-fa62-4ac0-a0f7-371c5efa0f7e","year":2002},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.029997Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:334314072dd3300807478a28381e14912b9f79b32704c88a87f272aa6117c074","observation_id":"14b701d4-b60c-427a-87df-c5275f37269d","resolution":{"observed_at":"2026-08-14T14:16:00.318913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.044552Z","title":"Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Prob- ability","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.044552Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:a7e169e839905ff400906d954087cc6e2ca169d808f15da7e4b7d50977478750","observation_id":"d58358ef-d0ae-40a1-b0ff-66e7c60a053a","resolution":{"observed_at":"2026-08-14T14:15:59.044552Z","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-14T14:16:00.251775Z","title":"Gauch Jr.Scientific method in practice","venue":null,"work_id":"9e1d806f-6965-40a9-813b-a9f92f30122d","year":2003},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.066417Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:74760c1e36d5d8fc4ef8c53e35c1e9b7dadb54a417922c82f052d37664476723","observation_id":"66a1369d-a179-4d8f-a926-ab0038dc1da9","resolution":{"observed_at":"2026-08-14T14:16:00.276898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.218667Z","title":"Kinship categories across languages reflect general communicative principles","venue":null,"work_id":"c2bb7bcf-d00f-4d59-a1f2-1a0d8c931e98","year":2012},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.081019Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:d970668662809f16b712d424347313ec4f57bee99e88a71f6b2565d04125a778","observation_id":"f225bf10-a042-41fa-9dfe-1a53a5e899a0","resolution":{"observed_at":"2026-08-14T14:16:00.228027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.164424Z","title":"Knill and Whitman Richards.Perception as Bayesian inference","venue":null,"work_id":"3b51211e-c138-4903-bb31-e977022da147","year":1996},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.091692Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:960436e80512eea9e061b55b3c5cd2f9e58ef2c235191ee34d2111638db8945c","observation_id":"a36b07bb-dc7b-4bb8-bb15-305d27988cf5","resolution":{"observed_at":"2026-08-14T14:16:00.179115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:16:00.135753Z","title":"quantity of information","venue":null,"work_id":"652d21f1-19d1-4a86-89a0-afe0ad0052b6","year":1965},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.098505Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:1ef1ee036a5ab16c21ecac848a90167ef3b5fa99f685e758750b17af4808dd13","observation_id":"40fd1c6e-b195-4907-b64e-28284b706724","resolution":{"observed_at":"2026-08-14T14:16:00.145596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.108328Z","title":"Universal intelligence: A definition of machine intelligence","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.108328Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:5f80b9cc5a62a485dfd02afd9c6a4d86a989a78eb59f7cdaf0e945d72fdf7e07","observation_id":"5f797f57-23d0-4dd9-9645-37a2f2b0ec7e","resolution":{"observed_at":"2026-08-14T14:15:59.108328Z","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-14T14:16:00.048543Z","title":"Universal sequential search problems.Problemy Peredachi Informatsii, 9(3):115–116, 1973","venue":null,"work_id":"c3d795bc-b5be-47dd-a752-3d59e63487c9","year":1973},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.117616Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:39d90f74c980c6241370dc0811ccfd803aeace6e6fd54600a63eaac9c81d3c64","observation_id":"2baef16b-fc34-4918-ad1c-24fc041a6b76","resolution":{"observed_at":"2026-08-14T14:16:00.066602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.991185Z","title":"Springer, 2009","venue":null,"work_id":"246761b7-19d9-45b6-889f-9c179662bab6","year":2009},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.129505Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:c267365fa8e02ef970b252f5cff7c74057eb8f2fea926fae85142704f49559e3","observation_id":"347d14ff-9011-47cb-8c6f-6addbf94edec","resolution":{"observed_at":"2026-08-14T14:16:00.017915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.950335Z","title":null,"venue":null,"work_id":"502e9feb-097e-4fd9-bcc9-48b51bbf4cbc","year":2003},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.163732Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:c9c6eaf839228fae1c22cb33bd386e3f15e44b0fdf9e8c689c3652972be817ac","observation_id":"dd70d0bc-f05d-4083-ae7b-5b6da959e8ec","resolution":{"observed_at":"2026-08-14T14:15:59.959860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.913426Z","title":"Olshausen and David J","venue":null,"work_id":"7adf097c-25fe-4d94-8fa4-95522bfca74b","year":1996},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.182931Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:685331a2bdf5a112b01808a4e9f2862a37d97eacea8a90750a3acc0056f74915","observation_id":"37316e11-385f-4e39-b127-2181697e865b","resolution":{"observed_at":"2026-08-14T14:15:59.921915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.873713Z","title":"Making universal induction efficient by specialization","venue":null,"work_id":"682833cb-7522-410b-bef4-28eb94a7fa47","year":2014},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.199747Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:c2c5641c6baf46153918743054dcc26b9ca066e0916d2bf54e97a220f5b7d162","observation_id":"06e9cdba-b245-4182-a607-b91bb5d1cd19","resolution":{"observed_at":"2026-08-14T14:15:59.880003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.213180Z","title":"Modeling by shortest data description.Automatica, 14(5):465–471, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.213180Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:4a54bde8654914413cb30354f818ab44f8b4e4d2ed9f7dc0eea604b4acc3a481","observation_id":"d177d607-09b8-45d6-bb54-5f1265b6ce30","resolution":{"observed_at":"2026-08-14T14:15:59.213180Z","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-14T14:15:59.775307Z","title":"Optimal ordered problem solver.Machine Learning, 54(3):211–254, 2004","venue":null,"work_id":"8bea7275-b245-443a-8587-83eeaeb972bb","year":2004},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.226220Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:61b550f9f85b38ba9f5c483ee6fa51a3aedc1c4eff77a001b168560d60046784","observation_id":"cb9115c3-9864-4e54-ab91-27dd313a3d5b","resolution":{"observed_at":"2026-08-14T14:15:59.795902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.744885Z","title":"Shifting inductive bias with success-story algorithm, adaptive levin search, and incremental self-improvement.Machine Learning, 28(1):105–130, 1997","venue":null,"work_id":"5bdb838e-7d19-4d2d-8e27-9e51abd0bcbc","year":1997},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.239190Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:3fbb697f8777b536c3c4d3bd0d28b7e55c5d4c8a2231c3a3e99a4c72902aa5d2","observation_id":"8faee54d-afcf-423d-8e61-917af239d95b","resolution":{"observed_at":"2026-08-14T14:15:59.754091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.261869Z","title":"Estimating the dimension of a model.The Annals of Statistics, 6(2):461–464, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.261869Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:c5b037d12bfac212da76c3337f21bf942e19417e22d2d6f20f2e5832eb8242da","observation_id":"fd02dcbe-ed88-44e3-b02c-bcfbba634a50","resolution":{"observed_at":"2026-08-14T14:15:59.261869Z","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-14T14:15:59.645182Z","title":"Uspensky, and Nikolay Vereshchagin.Kolmogorov complexity and algorithmic randomness, volume 220","venue":null,"work_id":"082420e6-32ea-415f-9217-969b51955efe","year":2017},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.272869Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:140eef34227caefb83b72047b17057da06c45760ab278b35d4fb70b100b1dec9","observation_id":"cb7f1097-f7b3-4d84-9b8d-0a9a9c22af63","resolution":{"observed_at":"2026-08-14T14:15:59.659613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.598166Z","title":"Solomonoff","venue":null,"work_id":"1db27749-552b-4a29-87ba-3aad3a520bd3","year":1964},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.289415Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:a721aab26258e3ac674d5784a8f9dc33b6ab1eb13796fa28b024a1bec49d8f6b","observation_id":"ee83ed9d-bd16-4ae0-8d15-977eb43d8bcd","resolution":{"observed_at":"2026-08-14T14:15:59.609809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.560199Z","title":"Solomonoff","venue":null,"work_id":"9719790f-4f10-42cc-9ad8-e58415eecf11","year":1964},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.308925Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:4e51ed0a0ee443c392d1abb9a56c2ab49e6cc1f56dd8c9052f98d5e06d945bf0","observation_id":"1c48ffe5-34fd-420b-83fa-76fcedbece1d","resolution":{"observed_at":"2026-08-14T14:15:59.572907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.533685Z","title":"Solomonoff","venue":null,"work_id":"1cf0a467-6cb4-43b3-91bf-8feb70a8c45b","year":1978},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.323382Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:54ca4cb21a7f7dd43c0e1530cf697467ec82d926f7e763c76bab30595009cc33","observation_id":"faefeda5-1d81-4d73-84f8-ba36613875ca","resolution":{"observed_at":"2026-08-14T14:15:59.541416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:15:59.477945Z","title":"A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity.Entropy, 20(8):605, 2018","venue":null,"work_id":"2899d2e8-c203-4b06-9228-2ef6634362dc","year":2018},"citing_paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:59.355758Z"},"links":{"citing_paper":"/paper/1908.03781"},"observation_digest":"sha256:39c8ecfd08f2273091a4293da551f5ae71b5711e36a4128deedcc22e0df72ba4","observation_id":"abf7503e-7999-4e26-9c4a-110167e501e4","resolution":{"observed_at":"2026-08-14T14:15:59.490497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03781","last_updated":"2020-09-14T12:11:05Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T04:46:06.697289Z","submitted_at":"2019-08-10T16:55:42Z","title":"A theory of incremental compression"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":24},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.03781."}