{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3Q7XP7BYVLZ4GKYBJR4WSZTWTL","short_pith_number":"pith:3Q7XP7BY","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"},"canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","source":{"kind":"arxiv","id":"1903.09266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09266","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09266v1","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09266","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"3Q7XP7BYVLZ4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3Q7XP7BYVLZ4GKYB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3Q7XP7BY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3Q7XP7BYVLZ4GKYBJR4WSZTWTL","target":"record","payload":{"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"},"canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","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"},"source_kind":"arxiv","source_id":"1903.09266","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-17T23:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRnNjZGYlRnkC0/b50CS1SQSaq9Fi0vrNHhtUZyhVimak61MjmMFRRTTLBnX9mdx8GpG54QVPzjuF45i5QkmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:51:06.366385Z"},"content_sha256":"08e0df3a8295ec11b0cba96b3ebce699b5d5e3a5ec42c5873ef7c32718166ff6","schema_version":"1.0","event_id":"sha256:08e0df3a8295ec11b0cba96b3ebce699b5d5e3a5ec42c5873ef7c32718166ff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3Q7XP7BYVLZ4GKYBJR4WSZTWTL","target":"graph","payload":{"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"},"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-17T23:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLDakcsxEX/qGNoHQuLhlGXAD01hnS4gS+iGEyze8zMWZOP872I3YJBd93lACWxLhmmMwoDezLey1b9VHxMODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:51:06.366736Z"},"content_sha256":"7caa6e3903cc34c433018836c0b5d4b432fc04300656a3bd56867a49f114b655","schema_version":"1.0","event_id":"sha256:7caa6e3903cc34c433018836c0b5d4b432fc04300656a3bd56867a49f114b655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/bundle.json","state_url":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/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-03T09:51:06Z","links":{"resolver":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL","bundle":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/bundle.json","state":"https://pith.science/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Q7XP7BYVLZ4GKYBJR4WSZTWTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3Q7XP7BYVLZ4GKYBJR4WSZTWTL","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":"656ab75ffdc8d128932d1285f2744e363fa08339daaccccfe5d74e6c5738216a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-21T23:00:48Z","title_canon_sha256":"871b7783da966b4eb242b2dd272f983cef39b813313c40a81f7cf37871aef03f"},"schema_version":"1.0","source":{"id":"1903.09266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09266","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09266v1","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09266","created_at":"2026-05-17T23:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"3Q7XP7BYVLZ4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3Q7XP7BYVLZ4GKYB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3Q7XP7BY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:7caa6e3903cc34c433018836c0b5d4b432fc04300656a3bd56867a49f114b655","target":"graph","created_at":"2026-05-17T23:47:25Z","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":"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","authors_text":"Isaac J. Sledge, Jose C. Principe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-21T23:00:48Z","title":"Reduction of Markov Chains using a Value-of-Information-Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09266","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:08e0df3a8295ec11b0cba96b3ebce699b5d5e3a5ec42c5873ef7c32718166ff6","target":"record","created_at":"2026-05-17T23:47:25Z","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":"656ab75ffdc8d128932d1285f2744e363fa08339daaccccfe5d74e6c5738216a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-21T23:00:48Z","title_canon_sha256":"871b7783da966b4eb242b2dd272f983cef39b813313c40a81f7cf37871aef03f"},"schema_version":"1.0","source":{"id":"1903.09266","kind":"arxiv","version":1}},"canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc3f77fc38aaf3c32b014c796966769aeff635fe57161bfbd5be43cb951d5508","first_computed_at":"2026-05-17T23:47:25.101296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:25.101296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSIrafdbMf47stwzEEPwP3nxRlIK6mb2Hdmv15lNCQzfaVdQ0Kq4O9fx76fXFBUt6RhmWuwynUfRgQw1IfjNCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:25.101922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08e0df3a8295ec11b0cba96b3ebce699b5d5e3a5ec42c5873ef7c32718166ff6","sha256:7caa6e3903cc34c433018836c0b5d4b432fc04300656a3bd56867a49f114b655"],"state_sha256":"a8fa581b4246d039bb5a021b71ced99fcb5d863f999634936a80fcbe4e999ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ugyGQ7e8zTxGtVB9VFlh7yN1aYU3gltuL+Z+JzpdYIRrPwLh4lNtqpcS/bVWTcw1z4G9Z8pFj4coj98zpBIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:51:06.368844Z","bundle_sha256":"1f538d27c03409e53a9002a4c5af245ffa71cae6e6a8d3946738785cf58c39c2"}}