{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GCLH6QDUQSFEPUWKCPSF7FZXUW","short_pith_number":"pith:GCLH6QDU","schema_version":"1.0","canonical_sha256":"30967f4074848a47d2ca13e45f9737a5bea6c58b10377f77ef93f483cbcb4b6a","source":{"kind":"arxiv","id":"1610.08910","version":1},"attestation_state":"computed","paper":{"title":"Perfect Memory Context Trees in time series modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Tong Zhang","submitted_at":"2016-10-17T19:29:17Z","abstract_excerpt":"The Stochastic Context Tree (SCOT) is a useful tool for studying infinite random sequences generated by an m-Markov Chain (m-MC). It captures the phenomenon that the probability distribution of the next state sometimes depends on less than m of the preceding states. This allows compressing the information needed to describe an m-MC. The SCOT construction has been earlier used under various names: VLMC, VOMC, PST, CTW. In this paper we study the possibility of reducing the m-MC to a 1-MC on the leaves of the SCOT. Such context trees are called perfect-memory. We give various combinatorial chara"},"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":"1610.08910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-17T19:29:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"74623fa7224b3927b80d3949d95153d1d8ada7aebe50e8d8d0ecbcfe4d2cc00f","abstract_canon_sha256":"bab83fa3a94f9aa43be1f18bf15b30b584cdb826d2e1290ffd14c6fbc7de7f23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:06.947095Z","signature_b64":"R80XojT5LcYd9PacRYSG+TbnirIEIzRKG9OmYPToQQOy0lxWEKerMc/Uymhf5xZPK4VZNcB0EIKfIxjBUWEaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30967f4074848a47d2ca13e45f9737a5bea6c58b10377f77ef93f483cbcb4b6a","last_reissued_at":"2026-05-18T01:01:06.946469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:06.946469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Memory Context Trees in time series modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Tong Zhang","submitted_at":"2016-10-17T19:29:17Z","abstract_excerpt":"The Stochastic Context Tree (SCOT) is a useful tool for studying infinite random sequences generated by an m-Markov Chain (m-MC). It captures the phenomenon that the probability distribution of the next state sometimes depends on less than m of the preceding states. This allows compressing the information needed to describe an m-MC. The SCOT construction has been earlier used under various names: VLMC, VOMC, PST, CTW. In this paper we study the possibility of reducing the m-MC to a 1-MC on the leaves of the SCOT. Such context trees are called perfect-memory. We give various combinatorial chara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08910","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":"1610.08910","created_at":"2026-05-18T01:01:06.946569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08910v1","created_at":"2026-05-18T01:01:06.946569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08910","created_at":"2026-05-18T01:01:06.946569+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCLH6QDUQSFE","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCLH6QDUQSFEPUWK","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCLH6QDU","created_at":"2026-05-18T12:30:19.053100+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/GCLH6QDUQSFEPUWKCPSF7FZXUW","json":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW.json","graph_json":"https://pith.science/api/pith-number/GCLH6QDUQSFEPUWKCPSF7FZXUW/graph.json","events_json":"https://pith.science/api/pith-number/GCLH6QDUQSFEPUWKCPSF7FZXUW/events.json","paper":"https://pith.science/paper/GCLH6QDU"},"agent_actions":{"view_html":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW","download_json":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW.json","view_paper":"https://pith.science/paper/GCLH6QDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08910&json=true","fetch_graph":"https://pith.science/api/pith-number/GCLH6QDUQSFEPUWKCPSF7FZXUW/graph.json","fetch_events":"https://pith.science/api/pith-number/GCLH6QDUQSFEPUWKCPSF7FZXUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW/action/storage_attestation","attest_author":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW/action/author_attestation","sign_citation":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW/action/citation_signature","submit_replication":"https://pith.science/pith/GCLH6QDUQSFEPUWKCPSF7FZXUW/action/replication_record"}},"created_at":"2026-05-18T01:01:06.946569+00:00","updated_at":"2026-05-18T01:01:06.946569+00:00"}