{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EMBWAJHVHF7M36PL5GX3N4P4NX","short_pith_number":"pith:EMBWAJHV","schema_version":"1.0","canonical_sha256":"23036024f5397ecdf9ebe9afb6f1fc6dee02a62bbe7c74751dcf24bfdbc1e3fb","source":{"kind":"arxiv","id":"1703.07764","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of conditional probability for high-order symbolic Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.DS"],"primary_cat":"physics.data-an","authors_text":"O.V. Usatenko, S.S. Melnik","submitted_at":"2017-03-22T17:39:12Z","abstract_excerpt":"The main goal of the paper is to develop an estimate for the conditional probability function of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We elaborate a decomposition procedure for the conditional probability function of sequences considered as the high-order Markov chains. We represent the conditional probability function as the sum of multi-linear memory function monomials of different orders (from zero up to the chain order). This allows us to construct artificial sequences by method of successive iterations taking into account at each step "},"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":"1703.07764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-03-22T17:39:12Z","cross_cats_sorted":["cond-mat.dis-nn","math.DS"],"title_canon_sha256":"49c2797fb1c2678a05a1fc507813b200874da7a5bd6559cbf84171c6282f83e1","abstract_canon_sha256":"6a240ca8bda3f21c8ccbc17c7dfb5b562aa5afb5356c6dc6eabd1772514ab472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:27.989969Z","signature_b64":"ZZDtMXGJZ7VIcacJo6icPn3jkAEDJ5p7dY2s37E8xYKY0Ep/NWTPxO7kdqFypAludiMn7083BFl3tn7BwkRECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23036024f5397ecdf9ebe9afb6f1fc6dee02a62bbe7c74751dcf24bfdbc1e3fb","last_reissued_at":"2026-05-18T00:38:27.989401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:27.989401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of conditional probability for high-order symbolic Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.DS"],"primary_cat":"physics.data-an","authors_text":"O.V. Usatenko, S.S. Melnik","submitted_at":"2017-03-22T17:39:12Z","abstract_excerpt":"The main goal of the paper is to develop an estimate for the conditional probability function of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We elaborate a decomposition procedure for the conditional probability function of sequences considered as the high-order Markov chains. We represent the conditional probability function as the sum of multi-linear memory function monomials of different orders (from zero up to the chain order). This allows us to construct artificial sequences by method of successive iterations taking into account at each step "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07764","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":"1703.07764","created_at":"2026-05-18T00:38:27.989482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07764v1","created_at":"2026-05-18T00:38:27.989482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07764","created_at":"2026-05-18T00:38:27.989482+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMBWAJHVHF7M","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMBWAJHVHF7M36PL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMBWAJHV","created_at":"2026-05-18T12:31:12.930513+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/EMBWAJHVHF7M36PL5GX3N4P4NX","json":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX.json","graph_json":"https://pith.science/api/pith-number/EMBWAJHVHF7M36PL5GX3N4P4NX/graph.json","events_json":"https://pith.science/api/pith-number/EMBWAJHVHF7M36PL5GX3N4P4NX/events.json","paper":"https://pith.science/paper/EMBWAJHV"},"agent_actions":{"view_html":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX","download_json":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX.json","view_paper":"https://pith.science/paper/EMBWAJHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07764&json=true","fetch_graph":"https://pith.science/api/pith-number/EMBWAJHVHF7M36PL5GX3N4P4NX/graph.json","fetch_events":"https://pith.science/api/pith-number/EMBWAJHVHF7M36PL5GX3N4P4NX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX/action/storage_attestation","attest_author":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX/action/author_attestation","sign_citation":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX/action/citation_signature","submit_replication":"https://pith.science/pith/EMBWAJHVHF7M36PL5GX3N4P4NX/action/replication_record"}},"created_at":"2026-05-18T00:38:27.989482+00:00","updated_at":"2026-05-18T00:38:27.989482+00:00"}