{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ICYQ7Y6BPLCUW3YJU6ZHULYCBR","short_pith_number":"pith:ICYQ7Y6B","canonical_record":{"source":{"id":"1008.5078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-30T13:21:49Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"dca754fd8b59c341be0e0e5ade996c06a8ef82e474229603724c89b86e27cc6a","abstract_canon_sha256":"de28d32baf093564c1b68370267a87a0ba9102a716fbcfb29890fffdc3f47ded"},"schema_version":"1.0"},"canonical_sha256":"40b10fe3c17ac54b6f09a7b27a2f020c465f1d746b0134dfd409d979908833e8","source":{"kind":"arxiv","id":"1008.5078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5078","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5078v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5078","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"ICYQ7Y6BPLCU","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ICYQ7Y6BPLCUW3YJ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ICYQ7Y6B","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ICYQ7Y6BPLCUW3YJU6ZHULYCBR","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-30T13:21:49Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"dca754fd8b59c341be0e0e5ade996c06a8ef82e474229603724c89b86e27cc6a","abstract_canon_sha256":"de28d32baf093564c1b68370267a87a0ba9102a716fbcfb29890fffdc3f47ded"},"schema_version":"1.0"},"canonical_sha256":"40b10fe3c17ac54b6f09a7b27a2f020c465f1d746b0134dfd409d979908833e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:37.180587Z","signature_b64":"Nb6u4kZg7eCVp8/XEOUgYnIiOjIv6bxxLSVyBs/aZ8fh8EXHJzRclIYwZDxlJG+MCJoaStXkoFtMCcCzNrXTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40b10fe3c17ac54b6f09a7b27a2f020c465f1d746b0134dfd409d979908833e8","last_reissued_at":"2026-05-18T04:41:37.180154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:37.180154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5078","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ENDauu3hoj/aIW4y7hn8B5Kd3WBs6eIyWXMXrzTtszTcYUzkx8c4CC3SdYmLWScin6jaSJMczai3TMvQI0NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:54:59.336647Z"},"content_sha256":"d7dc2ba33d83da449cb1985a4bad3a0b9e5d2972878058df86aabcf8fd5bfe03","schema_version":"1.0","event_id":"sha256:d7dc2ba33d83da449cb1985a4bad3a0b9e5d2972878058df86aabcf8fd5bfe03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ICYQ7Y6BPLCUW3YJU6ZHULYCBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prediction by Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Joel Ratsaby","submitted_at":"2010-08-30T13:21:49Z","abstract_excerpt":"It is well known that text compression can be achieved by predicting the next symbol in the stream of text data based on the history seen up to the current symbol. The better the prediction the more skewed the conditional probability distribution of the next symbol and the shorter the codeword that needs to be assigned to represent this next symbol. What about the opposite direction ? suppose we have a black box that can compress text stream. Can it be used to predict the next symbol in the stream ? We introduce a criterion based on the length of the compressed data and use it to predict the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5078","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnlcwY/Pi6UkQmxEHVR9XosdJQZjdgz1WAHr/mzcSu79VDyTqgwPkX0uA2jYGxaJ5Oe1P6aBAIF6FuhD5R0CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:54:59.337000Z"},"content_sha256":"2d953db3453adc97ee18815510aad195a01c1292125761a6c2ac1d8033e9a33b","schema_version":"1.0","event_id":"sha256:2d953db3453adc97ee18815510aad195a01c1292125761a6c2ac1d8033e9a33b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/bundle.json","state_url":"https://pith.science/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/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-02T11:54:59Z","links":{"resolver":"https://pith.science/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR","bundle":"https://pith.science/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/bundle.json","state":"https://pith.science/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICYQ7Y6BPLCUW3YJU6ZHULYCBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ICYQ7Y6BPLCUW3YJU6ZHULYCBR","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":"de28d32baf093564c1b68370267a87a0ba9102a716fbcfb29890fffdc3f47ded","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-30T13:21:49Z","title_canon_sha256":"dca754fd8b59c341be0e0e5ade996c06a8ef82e474229603724c89b86e27cc6a"},"schema_version":"1.0","source":{"id":"1008.5078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5078","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5078v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5078","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"ICYQ7Y6BPLCU","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ICYQ7Y6BPLCUW3YJ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ICYQ7Y6B","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:2d953db3453adc97ee18815510aad195a01c1292125761a6c2ac1d8033e9a33b","target":"graph","created_at":"2026-05-18T04:41:37Z","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":"It is well known that text compression can be achieved by predicting the next symbol in the stream of text data based on the history seen up to the current symbol. The better the prediction the more skewed the conditional probability distribution of the next symbol and the shorter the codeword that needs to be assigned to represent this next symbol. What about the opposite direction ? suppose we have a black box that can compress text stream. Can it be used to predict the next symbol in the stream ? We introduce a criterion based on the length of the compressed data and use it to predict the n","authors_text":"Joel Ratsaby","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-30T13:21:49Z","title":"Prediction by Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5078","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:d7dc2ba33d83da449cb1985a4bad3a0b9e5d2972878058df86aabcf8fd5bfe03","target":"record","created_at":"2026-05-18T04:41:37Z","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":"de28d32baf093564c1b68370267a87a0ba9102a716fbcfb29890fffdc3f47ded","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-30T13:21:49Z","title_canon_sha256":"dca754fd8b59c341be0e0e5ade996c06a8ef82e474229603724c89b86e27cc6a"},"schema_version":"1.0","source":{"id":"1008.5078","kind":"arxiv","version":1}},"canonical_sha256":"40b10fe3c17ac54b6f09a7b27a2f020c465f1d746b0134dfd409d979908833e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40b10fe3c17ac54b6f09a7b27a2f020c465f1d746b0134dfd409d979908833e8","first_computed_at":"2026-05-18T04:41:37.180154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:37.180154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nb6u4kZg7eCVp8/XEOUgYnIiOjIv6bxxLSVyBs/aZ8fh8EXHJzRclIYwZDxlJG+MCJoaStXkoFtMCcCzNrXTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:37.180587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7dc2ba33d83da449cb1985a4bad3a0b9e5d2972878058df86aabcf8fd5bfe03","sha256:2d953db3453adc97ee18815510aad195a01c1292125761a6c2ac1d8033e9a33b"],"state_sha256":"649bca4386570453f716557fcbf3ce760fecd88e3016ab1eecea886dcefc63bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i11rnNKtLKoejX9s4BIU4D926pkza3RjAYMQ9M7ZJTUsBbBjeJ36bEN0AwZ3N5KfizQwCFOtpL3Iyqnl3qu2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:54:59.339071Z","bundle_sha256":"9a63a45fe1764cafb02d089d95b85dad938fb9669fe55f49a87c8b051a81c43f"}}