{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3Q7XP7BYVLZ4GKYBJR4WSZTWTL","short_pith_number":"pith:3Q7XP7BY","schema_version":"1.0","canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","source":{"kind":"arxiv","id":"1903.09266","version":1},"attestation_state":"computed","paper":{"title":"Reduction of Markov Chains using a Value-of-Information-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isaac J. Sledge, Jose C. Principe","submitted_at":"2019-03-21T23:00:48Z","abstract_excerpt":"In this paper, we propose an approach to obtain reduced-order models of Markov chains. Our approach is composed of two information-theoretic processes. The first is a means of comparing pairs of stationary chains on different state spaces, which is done via the negative Kullback-Leibler divergence defined on a model joint space. Model reduction is achieved by solving a value-of-information criterion with respect to this divergence. Optimizing the criterion leads to a probabilistic partitioning of the states in the high-order Markov chain. A single free parameter that emerges through the optimi"},"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":"1903.09266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-21T23:00:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"871b7783da966b4eb242b2dd272f983cef39b813313c40a81f7cf37871aef03f","abstract_canon_sha256":"656ab75ffdc8d128932d1285f2744e363fa08339daaccccfe5d74e6c5738216a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:25.101922Z","signature_b64":"XSIrafdbMf47stwzEEPwP3nxRlIK6mb2Hdmv15lNCQzfaVdQ0Kq4O9fx76fXFBUt6RhmWuwynUfRgQw1IfjNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","last_reissued_at":"2026-05-17T23:47:25.101296Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:25.101296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduction of Markov Chains using a Value-of-Information-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isaac J. Sledge, Jose C. Principe","submitted_at":"2019-03-21T23:00:48Z","abstract_excerpt":"In this paper, we propose an approach to obtain reduced-order models of Markov chains. Our approach is composed of two information-theoretic processes. The first is a means of comparing pairs of stationary chains on different state spaces, which is done via the negative Kullback-Leibler divergence defined on a model joint space. Model reduction is achieved by solving a value-of-information criterion with respect to this divergence. Optimizing the criterion leads to a probabilistic partitioning of the states in the high-order Markov chain. A single free parameter that emerges through the optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09266","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":"1903.09266","created_at":"2026-05-17T23:47:25.101401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09266v1","created_at":"2026-05-17T23:47:25.101401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09266","created_at":"2026-05-17T23:47:25.101401+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Q7XP7BYVLZ4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Q7XP7BYVLZ4GKYB","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Q7XP7BY","created_at":"2026-05-18T12:33:07.085635+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/3Q7XP7BYVLZ4GKYBJR4WSZTWTL","json":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL.json","graph_json":"https://pith.science/api/pith-number/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/graph.json","events_json":"https://pith.science/api/pith-number/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/events.json","paper":"https://pith.science/paper/3Q7XP7BY"},"agent_actions":{"view_html":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL","download_json":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL.json","view_paper":"https://pith.science/paper/3Q7XP7BY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09266&json=true","fetch_graph":"https://pith.science/api/pith-number/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/graph.json","fetch_events":"https://pith.science/api/pith-number/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/action/storage_attestation","attest_author":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/action/author_attestation","sign_citation":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/action/citation_signature","submit_replication":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/action/replication_record"}},"created_at":"2026-05-17T23:47:25.101401+00:00","updated_at":"2026-05-17T23:47:25.101401+00:00"}