{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZNYAZEJTTCLMJIXV4GBRGIAR4D","short_pith_number":"pith:ZNYAZEJT","schema_version":"1.0","canonical_sha256":"cb700c91339896c4a2f5e183132011e0e9de3a5022fdc83dc02e464df952b9f0","source":{"kind":"arxiv","id":"1107.0051","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.0051","created_at":"2026-05-18T04:19:02.783014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0051v1","created_at":"2026-05-18T04:19:02.783014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0051","created_at":"2026-05-18T04:19:02.783014+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNYAZEJTTCLM","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNYAZEJTTCLMJIXV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNYAZEJT","created_at":"2026-05-18T12:26:50.516681+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/ZNYAZEJTTCLMJIXV4GBRGIAR4D","json":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D.json","graph_json":"https://pith.science/api/pith-number/ZNYAZEJTTCLMJIXV4GBRGIAR4D/graph.json","events_json":"https://pith.science/api/pith-number/ZNYAZEJTTCLMJIXV4GBRGIAR4D/events.json","paper":"https://pith.science/paper/ZNYAZEJT"},"agent_actions":{"view_html":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D","download_json":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D.json","view_paper":"https://pith.science/paper/ZNYAZEJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0051&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNYAZEJTTCLMJIXV4GBRGIAR4D/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNYAZEJTTCLMJIXV4GBRGIAR4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/action/storage_attestation","attest_author":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/action/author_attestation","sign_citation":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/action/citation_signature","submit_replication":"https://pith.science/pith/ZNYAZEJTTCLMJIXV4GBRGIAR4D/action/replication_record"}},"created_at":"2026-05-18T04:19:02.783014+00:00","updated_at":"2026-05-18T04:19:02.783014+00:00"}