{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T6Y36QCUS7FKAWOS2IIQUFBMZC","short_pith_number":"pith:T6Y36QCU","canonical_record":{"source":{"id":"1509.06580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-22T12:58:52Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"c7ad10732228608dd8230a8d749c3015e8ab18db00ffee5fe521a194371b4bcc","abstract_canon_sha256":"51b36ed52f3eeb9d8a68d4314a09aca45fc7ab1e385bc62bb7aed745f3335c42"},"schema_version":"1.0"},"canonical_sha256":"9fb1bf405497caa059d2d2110a142cc88d93eb00357c6021e217b9ea73cf1c01","source":{"kind":"arxiv","id":"1509.06580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06580","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06580v2","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06580","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"T6Y36QCUS7FK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6Y36QCUS7FKAWOS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6Y36QCU","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T6Y36QCUS7FKAWOS2IIQUFBMZC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-22T12:58:52Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"c7ad10732228608dd8230a8d749c3015e8ab18db00ffee5fe521a194371b4bcc","abstract_canon_sha256":"51b36ed52f3eeb9d8a68d4314a09aca45fc7ab1e385bc62bb7aed745f3335c42"},"schema_version":"1.0"},"canonical_sha256":"9fb1bf405497caa059d2d2110a142cc88d93eb00357c6021e217b9ea73cf1c01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:35.708436Z","signature_b64":"buK3ANzbLgLYFZh9YLDmr9d3HU+qpmyVUiY3tUglRsBBqNslV5Yppxx1r9fyGdypZyQ2URKxHJPmj0l8d8mEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb1bf405497caa059d2d2110a142cc88d93eb00357c6021e217b9ea73cf1c01","last_reissued_at":"2026-05-18T01:08:35.707906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:35.707906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06580","source_version":2,"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-18T01:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2HXobcAgH4majq/Vxx4wpbOB+Lgbi4omPSi5z7h1DnZTvj1yEwy/UYrdvsB6kXFkIqdmCggp3dIo1YQnA0TCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:55:40.951245Z"},"content_sha256":"20699a859c8c614e0480aadd502c4dc555dbbeb6a7b19dde7027ae22a2c58af1","schema_version":"1.0","event_id":"sha256:20699a859c8c614e0480aadd502c4dc555dbbeb6a7b19dde7027ae22a2c58af1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T6Y36QCUS7FKAWOS2IIQUFBMZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Based Lossless Markov Lumpings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Bernhard C. Geiger, Christoph Hofer-Temmel","submitted_at":"2015-09-22T12:58:52Z","abstract_excerpt":"We use results from zero-error information theory to determine the set of non-injective functions through which a Markov chain can be projected without losing information. These lumping functions can be found by clique partitioning of a graph related to the Markov chain. Lossless lumping is made possible by exploiting the (sufficiently sparse) temporal structure of the Markov chain. Eliminating edges in the transition graph of the Markov chain trades the required output alphabet size versus information loss, for which we present bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06580","kind":"arxiv","version":2},"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-18T01:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clfSKmBo8ULpK8nZc2MvZGEdJx18in2Y5AJ+/YxBmjjTY2PwaLUyvCZiJLGHXJ8uoztFQo+o5yzazh1SF+0dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:55:40.951601Z"},"content_sha256":"2ab11ff3e06cd385203fd69425ef310c71ab6f089f39ab07ad8dcab6de34cf21","schema_version":"1.0","event_id":"sha256:2ab11ff3e06cd385203fd69425ef310c71ab6f089f39ab07ad8dcab6de34cf21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/bundle.json","state_url":"https://pith.science/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/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-24T08:55:40Z","links":{"resolver":"https://pith.science/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC","bundle":"https://pith.science/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/bundle.json","state":"https://pith.science/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6Y36QCUS7FKAWOS2IIQUFBMZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T6Y36QCUS7FKAWOS2IIQUFBMZC","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":"51b36ed52f3eeb9d8a68d4314a09aca45fc7ab1e385bc62bb7aed745f3335c42","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-22T12:58:52Z","title_canon_sha256":"c7ad10732228608dd8230a8d749c3015e8ab18db00ffee5fe521a194371b4bcc"},"schema_version":"1.0","source":{"id":"1509.06580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06580","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06580v2","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06580","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"T6Y36QCUS7FK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6Y36QCUS7FKAWOS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6Y36QCU","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:2ab11ff3e06cd385203fd69425ef310c71ab6f089f39ab07ad8dcab6de34cf21","target":"graph","created_at":"2026-05-18T01:08:35Z","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":"We use results from zero-error information theory to determine the set of non-injective functions through which a Markov chain can be projected without losing information. These lumping functions can be found by clique partitioning of a graph related to the Markov chain. Lossless lumping is made possible by exploiting the (sufficiently sparse) temporal structure of the Markov chain. Eliminating edges in the transition graph of the Markov chain trades the required output alphabet size versus information loss, for which we present bounds.","authors_text":"Bernhard C. Geiger, Christoph Hofer-Temmel","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-22T12:58:52Z","title":"Graph-Based Lossless Markov Lumpings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06580","kind":"arxiv","version":2},"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:20699a859c8c614e0480aadd502c4dc555dbbeb6a7b19dde7027ae22a2c58af1","target":"record","created_at":"2026-05-18T01:08:35Z","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":"51b36ed52f3eeb9d8a68d4314a09aca45fc7ab1e385bc62bb7aed745f3335c42","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-22T12:58:52Z","title_canon_sha256":"c7ad10732228608dd8230a8d749c3015e8ab18db00ffee5fe521a194371b4bcc"},"schema_version":"1.0","source":{"id":"1509.06580","kind":"arxiv","version":2}},"canonical_sha256":"9fb1bf405497caa059d2d2110a142cc88d93eb00357c6021e217b9ea73cf1c01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb1bf405497caa059d2d2110a142cc88d93eb00357c6021e217b9ea73cf1c01","first_computed_at":"2026-05-18T01:08:35.707906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:35.707906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"buK3ANzbLgLYFZh9YLDmr9d3HU+qpmyVUiY3tUglRsBBqNslV5Yppxx1r9fyGdypZyQ2URKxHJPmj0l8d8mEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:35.708436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20699a859c8c614e0480aadd502c4dc555dbbeb6a7b19dde7027ae22a2c58af1","sha256:2ab11ff3e06cd385203fd69425ef310c71ab6f089f39ab07ad8dcab6de34cf21"],"state_sha256":"824593ca17348d34b3b223eec84c22839b14682d2a54c5951120ae5a4f8b779c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CfgXf2UdAntWdRDMcAuauS9RnaeZPSlb1Da0nlDLSQYmGwmzVDRmW/BFZq75tPnD8SLQ2QVX3hGz25eosXyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:55:40.953500Z","bundle_sha256":"79bd7ec29870388637a8349c7202edd623450cd15ea083f9c85fc853fd5be1f5"}}