{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QLXQLL6R5TAGNXCVEWDGMVQYQV","short_pith_number":"pith:QLXQLL6R","canonical_record":{"source":{"id":"1509.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:25:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c6606304c51c5941377b4919e0413b1c2c6077627dc637ad13e15ea7f6912acd","abstract_canon_sha256":"422c21a5ed7aca0550d4b03c9c6afd0d02df01a555020269152155fef284fb68"},"schema_version":"1.0"},"canonical_sha256":"82ef05afd1ecc066dc5525866656188552ec58a2226e0ebf09b797968b4af6a3","source":{"kind":"arxiv","id":"1509.05473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05473","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05473v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05473","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"QLXQLL6R5TAG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QLXQLL6R5TAGNXCV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QLXQLL6R","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QLXQLL6R5TAGNXCVEWDGMVQYQV","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:25:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c6606304c51c5941377b4919e0413b1c2c6077627dc637ad13e15ea7f6912acd","abstract_canon_sha256":"422c21a5ed7aca0550d4b03c9c6afd0d02df01a555020269152155fef284fb68"},"schema_version":"1.0"},"canonical_sha256":"82ef05afd1ecc066dc5525866656188552ec58a2226e0ebf09b797968b4af6a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.098091Z","signature_b64":"pNLIBAOFq/Cf+EmJ4SjYljnnjPrDIjMUCXueTvTKHUXzGe6dc7NM1pmoLJ14I8MO48bonxPTOKKPwPJp4TMXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82ef05afd1ecc066dc5525866656188552ec58a2226e0ebf09b797968b4af6a3","last_reissued_at":"2026-05-18T01:32:43.097607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.097607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05473","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf65N6rXdBgHVru/rgl3mLpMg5cldCN9D5Jez1KEUQYHjk01SqS8ce3r6BiMNb+hxu46aFyseQ5e3EoJKvJZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:50.473214Z"},"content_sha256":"e0e0857d4c78c7275cfef4d85a0fba9fcdbd016d11bc840c7b8afdb10f2bb234","schema_version":"1.0","event_id":"sha256:e0e0857d4c78c7275cfef4d85a0fba9fcdbd016d11bc840c7b8afdb10f2bb234"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QLXQLL6R5TAGNXCVEWDGMVQYQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic statistics, prediction and machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Alexey Milovanov","submitted_at":"2015-09-17T23:25:00Z","abstract_excerpt":"Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a \"good\" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation. In this paper we extend this framework in two directions.\n  First, the explanations are not only interesting in themselves but also used for prediction: we want to know what kind of data we may reasonably expect in similar situations (repeating the same experiment). We show that some kind of hierarchy can be constructed both in terms of algorithmic statistic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05473","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TYFFdCyO4T95qA3mA52CWz3FiB30X1b4HxhZyLJdFPHan7m8SiJ6E6y7w+18CCRjUdw9NFuw/RBaf/YctYECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:50.473577Z"},"content_sha256":"449845a810fe5d04f46da5dc1a0a61d3599f5892c7aedc430092b14ed93e69e8","schema_version":"1.0","event_id":"sha256:449845a810fe5d04f46da5dc1a0a61d3599f5892c7aedc430092b14ed93e69e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/bundle.json","state_url":"https://pith.science/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T20:32:50Z","links":{"resolver":"https://pith.science/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV","bundle":"https://pith.science/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/bundle.json","state":"https://pith.science/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLXQLL6R5TAGNXCVEWDGMVQYQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QLXQLL6R5TAGNXCVEWDGMVQYQV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"422c21a5ed7aca0550d4b03c9c6afd0d02df01a555020269152155fef284fb68","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:25:00Z","title_canon_sha256":"c6606304c51c5941377b4919e0413b1c2c6077627dc637ad13e15ea7f6912acd"},"schema_version":"1.0","source":{"id":"1509.05473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05473","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05473v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05473","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"QLXQLL6R5TAG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QLXQLL6R5TAGNXCV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QLXQLL6R","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:449845a810fe5d04f46da5dc1a0a61d3599f5892c7aedc430092b14ed93e69e8","target":"graph","created_at":"2026-05-18T01:32:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a \"good\" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation. In this paper we extend this framework in two directions.\n  First, the explanations are not only interesting in themselves but also used for prediction: we want to know what kind of data we may reasonably expect in similar situations (repeating the same experiment). We show that some kind of hierarchy can be constructed both in terms of algorithmic statistic","authors_text":"Alexey Milovanov","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:25:00Z","title":"Algorithmic statistics, prediction and machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05473","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0e0857d4c78c7275cfef4d85a0fba9fcdbd016d11bc840c7b8afdb10f2bb234","target":"record","created_at":"2026-05-18T01:32:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"422c21a5ed7aca0550d4b03c9c6afd0d02df01a555020269152155fef284fb68","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:25:00Z","title_canon_sha256":"c6606304c51c5941377b4919e0413b1c2c6077627dc637ad13e15ea7f6912acd"},"schema_version":"1.0","source":{"id":"1509.05473","kind":"arxiv","version":1}},"canonical_sha256":"82ef05afd1ecc066dc5525866656188552ec58a2226e0ebf09b797968b4af6a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82ef05afd1ecc066dc5525866656188552ec58a2226e0ebf09b797968b4af6a3","first_computed_at":"2026-05-18T01:32:43.097607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:43.097607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNLIBAOFq/Cf+EmJ4SjYljnnjPrDIjMUCXueTvTKHUXzGe6dc7NM1pmoLJ14I8MO48bonxPTOKKPwPJp4TMXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:43.098091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0e0857d4c78c7275cfef4d85a0fba9fcdbd016d11bc840c7b8afdb10f2bb234","sha256:449845a810fe5d04f46da5dc1a0a61d3599f5892c7aedc430092b14ed93e69e8"],"state_sha256":"9d37ccdb8d14cd31fee33f6656839d96e2a1032134d13ca86ef816eb272af76d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LyeA5ZufZsKgP9JWBVQeSwX4mD+nTtwj9HQxgdT4/GiIAte4AYKo7zGumHM5hYAN912gq79ALqvCB2J8458Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:32:50.475556Z","bundle_sha256":"3684da12749fc92adcdf002676338018137a2d2acafc9c158cbcf50c458ce686"}}