{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVRCC5RDFKRQ54OR4FUWX7OND6","short_pith_number":"pith:JVRCC5RD","schema_version":"1.0","canonical_sha256":"4d622176232aa30ef1d1e1696bfdcd1f99be0459af4beda99698f82e047b473b","source":{"kind":"arxiv","id":"1304.6603","version":3},"attestation_state":"computed","paper":{"title":"Optimal Kullback-Leibler Aggregation via Information Bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Bernhard C. Geiger, Gernot Kubin, Heinz Koeppl, Tatjana Petrov","submitted_at":"2013-04-24T14:40:45Z","abstract_excerpt":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approa"},"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":"1304.6603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-24T14:40:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d7ca8fa275edb658904c733a99d08edfb28d127e224149029fda027b501fb342","abstract_canon_sha256":"49dc64cabfc6422d5546bc8c2cd1bc4275ca97c8376524b46a5c4fe8a044f5de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:01.970717Z","signature_b64":"17evbIyFm2Qbn3OR/PoLZmdZ5sQmKKWsRhyRYGcHRsT9Tgiz3k4zvH9uTBs8SGHctdunEa/k8dosjMSQIkdFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d622176232aa30ef1d1e1696bfdcd1f99be0459af4beda99698f82e047b473b","last_reissued_at":"2026-05-18T00:45:01.970281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:01.970281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Kullback-Leibler Aggregation via Information Bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Bernhard C. Geiger, Gernot Kubin, Heinz Koeppl, Tatjana Petrov","submitted_at":"2013-04-24T14:40:45Z","abstract_excerpt":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6603","kind":"arxiv","version":3},"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":"1304.6603","created_at":"2026-05-18T00:45:01.970343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6603v3","created_at":"2026-05-18T00:45:01.970343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6603","created_at":"2026-05-18T00:45:01.970343+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVRCC5RDFKRQ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVRCC5RDFKRQ54OR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVRCC5RD","created_at":"2026-05-18T12:27:49.015174+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/JVRCC5RDFKRQ54OR4FUWX7OND6","json":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6.json","graph_json":"https://pith.science/api/pith-number/JVRCC5RDFKRQ54OR4FUWX7OND6/graph.json","events_json":"https://pith.science/api/pith-number/JVRCC5RDFKRQ54OR4FUWX7OND6/events.json","paper":"https://pith.science/paper/JVRCC5RD"},"agent_actions":{"view_html":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6","download_json":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6.json","view_paper":"https://pith.science/paper/JVRCC5RD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6603&json=true","fetch_graph":"https://pith.science/api/pith-number/JVRCC5RDFKRQ54OR4FUWX7OND6/graph.json","fetch_events":"https://pith.science/api/pith-number/JVRCC5RDFKRQ54OR4FUWX7OND6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6/action/storage_attestation","attest_author":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6/action/author_attestation","sign_citation":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6/action/citation_signature","submit_replication":"https://pith.science/pith/JVRCC5RDFKRQ54OR4FUWX7OND6/action/replication_record"}},"created_at":"2026-05-18T00:45:01.970343+00:00","updated_at":"2026-05-18T00:45:01.970343+00:00"}