{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UHP4263E5XBB4WZZVIWG6FWQLQ","short_pith_number":"pith:UHP4263E","canonical_record":{"source":{"id":"1410.3976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T09:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"da905a3662e8782b817aa78142ab02ec3f755cba685d5cef9e89203fd976530e","abstract_canon_sha256":"0b0b204374d00d45c3b7296a98d067892f2140f634a99b9365de4414e7b35542"},"schema_version":"1.0"},"canonical_sha256":"a1dfcd7b64edc21e5b39aa2c6f16d05c19d16c2e5b2af7bb398085ed4cf89766","source":{"kind":"arxiv","id":"1410.3976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3976","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3976v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3976","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"UHP4263E5XBB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UHP4263E5XBB4WZZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UHP4263E","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UHP4263E5XBB4WZZVIWG6FWQLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T09:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"da905a3662e8782b817aa78142ab02ec3f755cba685d5cef9e89203fd976530e","abstract_canon_sha256":"0b0b204374d00d45c3b7296a98d067892f2140f634a99b9365de4414e7b35542"},"schema_version":"1.0"},"canonical_sha256":"a1dfcd7b64edc21e5b39aa2c6f16d05c19d16c2e5b2af7bb398085ed4cf89766","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.582607Z","signature_b64":"TZPjr7LIqOBZy/SXRwLM6FMcXTR8UXvHDivVAAvt2BCVDz9mmNv46LSnLrYfX+fGdT98FWph/LPYpD961JzmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1dfcd7b64edc21e5b39aa2c6f16d05c19d16c2e5b2af7bb398085ed4cf89766","last_reissued_at":"2026-05-18T00:58:36.581904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.581904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3976","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-18T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Wh9fxlrI7Sx8xiab0yVooFo2Rz4kw2f8KUE7KcNfZqdfuMqKlWcGSdIRS/3t2Fo2NkQMATRNg5H4Sf/I6BNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:30:40.770478Z"},"content_sha256":"eeea27019dcbcc168bc219da7a04ee055a96ff000c1ef34817e91a9fa23e7ebd","schema_version":"1.0","event_id":"sha256:eeea27019dcbcc168bc219da7a04ee055a96ff000c1ef34817e91a9fa23e7ebd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UHP4263E5XBB4WZZVIWG6FWQLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of Markov Processes by Lower Dimensional Processes via Total Variation Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Charalambos D. Charalambous, Christoforos N. Hadjicostis, Ioannis Tzortzis, Mikael Johansson, Themistoklis Charalambous","submitted_at":"2014-10-15T09:03:31Z","abstract_excerpt":"The aim of this paper is to approximate a finite-state Markov process by another process with fewer states, called herein the approximating process. The approximation problem is formulated using two different methods.\n  The first method, utilizes the total variation distance to discriminate the transition probabilities of a high dimensional Markov process and a reduced order Markov process. The approximation is obtained by optimizing a linear functional defined in terms of transition probabilities of the reduced order Markov process over a total variation distance constraint. The transition pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3976","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-18T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpFL7j48tL3HTTIv3Qt/w6RuNxL9KBo9dRWaYP2Xg0AsygbO95xrgB8m3nuOxO2SUDQ0HkMUZeYOOWCkyk35BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:30:40.771094Z"},"content_sha256":"15efcf3bc70c5178f6429c8fa458baba15f30357a6ea13ab2d725fc578928bc1","schema_version":"1.0","event_id":"sha256:15efcf3bc70c5178f6429c8fa458baba15f30357a6ea13ab2d725fc578928bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/bundle.json","state_url":"https://pith.science/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/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-02T12:30:40Z","links":{"resolver":"https://pith.science/pith/UHP4263E5XBB4WZZVIWG6FWQLQ","bundle":"https://pith.science/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/bundle.json","state":"https://pith.science/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHP4263E5XBB4WZZVIWG6FWQLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UHP4263E5XBB4WZZVIWG6FWQLQ","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":"0b0b204374d00d45c3b7296a98d067892f2140f634a99b9365de4414e7b35542","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T09:03:31Z","title_canon_sha256":"da905a3662e8782b817aa78142ab02ec3f755cba685d5cef9e89203fd976530e"},"schema_version":"1.0","source":{"id":"1410.3976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3976","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3976v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3976","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"UHP4263E5XBB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UHP4263E5XBB4WZZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UHP4263E","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:15efcf3bc70c5178f6429c8fa458baba15f30357a6ea13ab2d725fc578928bc1","target":"graph","created_at":"2026-05-18T00:58:36Z","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":"The aim of this paper is to approximate a finite-state Markov process by another process with fewer states, called herein the approximating process. The approximation problem is formulated using two different methods.\n  The first method, utilizes the total variation distance to discriminate the transition probabilities of a high dimensional Markov process and a reduced order Markov process. The approximation is obtained by optimizing a linear functional defined in terms of transition probabilities of the reduced order Markov process over a total variation distance constraint. The transition pr","authors_text":"Charalambos D. Charalambous, Christoforos N. Hadjicostis, Ioannis Tzortzis, Mikael Johansson, Themistoklis Charalambous","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T09:03:31Z","title":"Approximation of Markov Processes by Lower Dimensional Processes via Total Variation Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3976","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:eeea27019dcbcc168bc219da7a04ee055a96ff000c1ef34817e91a9fa23e7ebd","target":"record","created_at":"2026-05-18T00:58:36Z","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":"0b0b204374d00d45c3b7296a98d067892f2140f634a99b9365de4414e7b35542","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T09:03:31Z","title_canon_sha256":"da905a3662e8782b817aa78142ab02ec3f755cba685d5cef9e89203fd976530e"},"schema_version":"1.0","source":{"id":"1410.3976","kind":"arxiv","version":1}},"canonical_sha256":"a1dfcd7b64edc21e5b39aa2c6f16d05c19d16c2e5b2af7bb398085ed4cf89766","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1dfcd7b64edc21e5b39aa2c6f16d05c19d16c2e5b2af7bb398085ed4cf89766","first_computed_at":"2026-05-18T00:58:36.581904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.581904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TZPjr7LIqOBZy/SXRwLM6FMcXTR8UXvHDivVAAvt2BCVDz9mmNv46LSnLrYfX+fGdT98FWph/LPYpD961JzmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.582607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeea27019dcbcc168bc219da7a04ee055a96ff000c1ef34817e91a9fa23e7ebd","sha256:15efcf3bc70c5178f6429c8fa458baba15f30357a6ea13ab2d725fc578928bc1"],"state_sha256":"1817536d8409703ce3b6510b46810f1a085c3d2002497ba7936d55802454dc98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmzAfB9i34MbYnq2U4ILhajck32NZD0Lv/89zjgNFgmXlfjQ1cKS2Bd03QeDQBKb8G62vGQY+Riehnj1cYgjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:30:40.774035Z","bundle_sha256":"da5a9440f01dc4ea9b6b34854ed17d1480bc2797a93919b15c71bc40ca1a129b"}}