{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZNYAZEJTTCLMJIXV4GBRGIAR4D","short_pith_number":"pith:ZNYAZEJT","canonical_record":{"source":{"id":"1107.0051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"53f4b63d444c7de42bd4381a80d4890b4b7dec66afcb26287c462ae683d172e0","abstract_canon_sha256":"c144b58985854cb6aa482e18e3a2ab69678d2a5f1b40b1a634a9db239beed6e0"},"schema_version":"1.0"},"canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","source":{"kind":"arxiv","id":"1107.0051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0051","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0051v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0051","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZNYAZEJTTCLM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZNYAZEJTTCLMJIXV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZNYAZEJT","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZNYAZEJTTCLMJIXV4GBRGIAR4D","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"53f4b63d444c7de42bd4381a80d4890b4b7dec66afcb26287c462ae683d172e0","abstract_canon_sha256":"c144b58985854cb6aa482e18e3a2ab69678d2a5f1b40b1a634a9db239beed6e0"},"schema_version":"1.0"},"canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:02.783476Z","signature_b64":"bACq+HM8Pf2CW+ngN05YKJrek0vU/ceKYsuNy3AGkCqBNaxyU/fsFxjIPUzDgpCfqKcGIpImgI/2Q1qxVlCbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","last_reissued_at":"2026-05-18T04:19:02.782930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:02.782930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0051","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvZ85t/XFHUo5NmP3wGCCBELjMnSn89SeUfOatmkXoZ7CpCVgN36eHFI52v2lp9mosZF4+xMX8/DiKNAJtZ4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:48:22.884989Z"},"content_sha256":"efd6d5bb02feed2c4475bfd0ff7dd6bc7d8fb988aa82e1943abb5402686b5cf1","schema_version":"1.0","event_id":"sha256:efd6d5bb02feed2c4475bfd0ff7dd6bc7d8fb988aa82e1943abb5402686b5cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZNYAZEJTTCLMJIXV4GBRGIAR4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Prediction Using Variable Order Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"G. Yona, R. Begleiter, R. El-Yaniv","submitted_at":"2011-06-30T20:43:01Z","abstract_excerpt":"This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM) and Probabilistic Suffix Trees (PSTs). We discuss the properties of these algorithms and compare their performance using real life sequences from three domains: proteins, English text and music pieces. The comparison is made with respect to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0051","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MP1EkmKfQ9/ivaQ8Tez6mqKVPP3hUBw7bG5VBJ4XjcafngchlEkF2QUVKhLZs+cw8pkE4Pw4c5CGTwKgkXcSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:48:22.885359Z"},"content_sha256":"4d6ea21d1d5b96f9c9e33ab27e145b0e23bb8b6ffa9f7ececbb305be8ecf0bae","schema_version":"1.0","event_id":"sha256:4d6ea21d1d5b96f9c9e33ab27e145b0e23bb8b6ffa9f7ececbb305be8ecf0bae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/bundle.json","state_url":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/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-02T09:48:22Z","links":{"resolver":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D","bundle":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/bundle.json","state":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZNYAZEJTTCLMJIXV4GBRGIAR4D","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":"c144b58985854cb6aa482e18e3a2ab69678d2a5f1b40b1a634a9db239beed6e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:43:01Z","title_canon_sha256":"53f4b63d444c7de42bd4381a80d4890b4b7dec66afcb26287c462ae683d172e0"},"schema_version":"1.0","source":{"id":"1107.0051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0051","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0051v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0051","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZNYAZEJTTCLM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZNYAZEJTTCLMJIXV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZNYAZEJT","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:4d6ea21d1d5b96f9c9e33ab27e145b0e23bb8b6ffa9f7ececbb305be8ecf0bae","target":"graph","created_at":"2026-05-18T04:19:02Z","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":"This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM) and Probabilistic Suffix Trees (PSTs). We discuss the properties of these algorithms and compare their performance using real life sequences from three domains: proteins, English text and music pieces. The comparison is made with respect to","authors_text":"G. Yona, R. Begleiter, R. El-Yaniv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:43:01Z","title":"On Prediction Using Variable Order Markov Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0051","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:efd6d5bb02feed2c4475bfd0ff7dd6bc7d8fb988aa82e1943abb5402686b5cf1","target":"record","created_at":"2026-05-18T04:19:02Z","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":"c144b58985854cb6aa482e18e3a2ab69678d2a5f1b40b1a634a9db239beed6e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:43:01Z","title_canon_sha256":"53f4b63d444c7de42bd4381a80d4890b4b7dec66afcb26287c462ae683d172e0"},"schema_version":"1.0","source":{"id":"1107.0051","kind":"arxiv","version":1}},"canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","first_computed_at":"2026-05-18T04:19:02.782930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:02.782930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bACq+HM8Pf2CW+ngN05YKJrek0vU/ceKYsuNy3AGkCqBNaxyU/fsFxjIPUzDgpCfqKcGIpImgI/2Q1qxVlCbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:02.783476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd6d5bb02feed2c4475bfd0ff7dd6bc7d8fb988aa82e1943abb5402686b5cf1","sha256:4d6ea21d1d5b96f9c9e33ab27e145b0e23bb8b6ffa9f7ececbb305be8ecf0bae"],"state_sha256":"3b4a580e429c7ce42804aa2aca9dafeff04108076ed3d72595f5a10853fac0db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95ahSzdFPMOKRLI9ptOe9zAIKoNzcOin3cdvZvn5woxkQSPgcOq27mzTtMHNX4iDb+vcIjmlv9T1sk5CdhaBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:48:22.887382Z","bundle_sha256":"65015b53d519729fc90726f9e4b08e2a6a8a214c15976e31bd2380e203c2787d"}}