{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IK4QGLH6Q5K7AZMLZSYIDOSRYF","short_pith_number":"pith:IK4QGLH6","schema_version":"1.0","canonical_sha256":"42b9032cfe8755f0658bccb081ba51c159782e5fcda94a7cb64d37a7415d0e65","source":{"kind":"arxiv","id":"2606.04834","version":1},"attestation_state":"computed","paper":{"title":"Prediction Under Imperfect Compression: A Theory of Approximate MDL","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guangxu Yang, Qian Li, Shang-Hua Teng, Xinyu Mao","submitted_at":"2026-06-03T13:03:56Z","abstract_excerpt":"Minimum Description Length (MDL) formalizes the principle of Occam's razor by optimizing the total description length: $L(\\mathrm{model})+L(\\mathrm{data} \\ | \\ \\mathrm{model})$. For sequential prediction, the MDL method repeatedly selects a model with a minimum objective score of the observed prefix for the next step prediction. Classical MDL prediction theory shows that exact optimization of the MDL objective indeed provides a strong compression guarantee that supports reliable prediction. However, practical machine learning usually can only find models by approximately optimizing the objecti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.04834","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-03T13:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"17dbfe65ddb374dffe1a23a14ecbc96f25133d4d9098d3e39d9744e3941644df","abstract_canon_sha256":"581184addb465e5290e7a066164a54c1e505d0b38f141b1423d321f2ebe2797a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:31.633652Z","signature_b64":"oz9VAk4adWfehxGZSMx64RZIG4FQm7YuqHyK4D6k0RZaCPZD+P/nzXwRjHRCOXOKMEGvqYOpDpYCaWgDc9MrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b9032cfe8755f0658bccb081ba51c159782e5fcda94a7cb64d37a7415d0e65","last_reissued_at":"2026-06-04T01:09:31.633023Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:31.633023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prediction Under Imperfect Compression: A Theory of Approximate MDL","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guangxu Yang, Qian Li, Shang-Hua Teng, Xinyu Mao","submitted_at":"2026-06-03T13:03:56Z","abstract_excerpt":"Minimum Description Length (MDL) formalizes the principle of Occam's razor by optimizing the total description length: $L(\\mathrm{model})+L(\\mathrm{data} \\ | \\ \\mathrm{model})$. For sequential prediction, the MDL method repeatedly selects a model with a minimum objective score of the observed prefix for the next step prediction. Classical MDL prediction theory shows that exact optimization of the MDL objective indeed provides a strong compression guarantee that supports reliable prediction. However, practical machine learning usually can only find models by approximately optimizing the objecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04834","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.04834/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.04834","created_at":"2026-06-04T01:09:31.633111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04834v1","created_at":"2026-06-04T01:09:31.633111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04834","created_at":"2026-06-04T01:09:31.633111+00:00"},{"alias_kind":"pith_short_12","alias_value":"IK4QGLH6Q5K7","created_at":"2026-06-04T01:09:31.633111+00:00"},{"alias_kind":"pith_short_16","alias_value":"IK4QGLH6Q5K7AZML","created_at":"2026-06-04T01:09:31.633111+00:00"},{"alias_kind":"pith_short_8","alias_value":"IK4QGLH6","created_at":"2026-06-04T01:09:31.633111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF","json":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF.json","graph_json":"https://pith.science/api/pith-number/IK4QGLH6Q5K7AZMLZSYIDOSRYF/graph.json","events_json":"https://pith.science/api/pith-number/IK4QGLH6Q5K7AZMLZSYIDOSRYF/events.json","paper":"https://pith.science/paper/IK4QGLH6"},"agent_actions":{"view_html":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF","download_json":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF.json","view_paper":"https://pith.science/paper/IK4QGLH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04834&json=true","fetch_graph":"https://pith.science/api/pith-number/IK4QGLH6Q5K7AZMLZSYIDOSRYF/graph.json","fetch_events":"https://pith.science/api/pith-number/IK4QGLH6Q5K7AZMLZSYIDOSRYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF/action/storage_attestation","attest_author":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF/action/author_attestation","sign_citation":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF/action/citation_signature","submit_replication":"https://pith.science/pith/IK4QGLH6Q5K7AZMLZSYIDOSRYF/action/replication_record"}},"created_at":"2026-06-04T01:09:31.633111+00:00","updated_at":"2026-06-04T01:09:31.633111+00:00"}