{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RJ35STUWXEMMKNUY5KEJJKMQVZ","short_pith_number":"pith:RJ35STUW","canonical_record":{"source":{"id":"1611.07214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-22T09:36:26Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"fba22623bbfc710975cecaf19a16b607dbe94a6968b1110f1d4d838059d5c799","abstract_canon_sha256":"f0d282e59487d59440615e03b202fc20724f1c2d1448872d4c501c6ae1589300"},"schema_version":"1.0"},"canonical_sha256":"8a77d94e96b918c53698ea8894a990ae6e449477ef8d4f0200c031797f43e2e6","source":{"kind":"arxiv","id":"1611.07214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07214","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07214v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07214","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"RJ35STUWXEMM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJ35STUWXEMMKNUY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJ35STUW","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RJ35STUWXEMMKNUY5KEJJKMQVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-22T09:36:26Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"fba22623bbfc710975cecaf19a16b607dbe94a6968b1110f1d4d838059d5c799","abstract_canon_sha256":"f0d282e59487d59440615e03b202fc20724f1c2d1448872d4c501c6ae1589300"},"schema_version":"1.0"},"canonical_sha256":"8a77d94e96b918c53698ea8894a990ae6e449477ef8d4f0200c031797f43e2e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.254278Z","signature_b64":"87bDfaUCm1tt9Sen6dnnhgBN9yS+IJ+QxK3KT3dXDq7OP8IRGfVk5qI5KczhRSiDLhKF+vgLmcUtUbNY0mk+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a77d94e96b918c53698ea8894a990ae6e449477ef8d4f0200c031797f43e2e6","last_reissued_at":"2026-05-18T00:46:04.253847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.253847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07214","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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMgysElBJ/S7+cGogMo3oKEKEQJLviILuhh9k2JE8kV1L5860NmWQEmSoX5LQCGms7B/x8Cxkjs9sQZYXr2WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:56.639194Z"},"content_sha256":"05fe6a839f30e00c4c2be8af2486107cd00d6750d44071003e8cc94e08262bde","schema_version":"1.0","event_id":"sha256:05fe6a839f30e00c4c2be8af2486107cd00d6750d44071003e8cc94e08262bde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RJ35STUWXEMMKNUY5KEJJKMQVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparing entropy rates on finite and infinite rooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Thomas Hirschler, Wolfgang Woess","submitted_at":"2016-11-22T09:36:26Z","abstract_excerpt":"We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a perturbation of the former. The processes are described by probability measures on the boundary of the given tree, and by corresponding forward transition probabilities at the inner nodes. The comparison is in terms of Kullback-Leibler divergence. We elaborate and extend ideas and results of B\\\"ocherer and Amjad. Our extensions involve length functions on the edges "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07214","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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCqt608eBgiOHv4MUUuG42HGMplPYOzaMLkVMSMnfozEQBDZouM8y5BIaeAPlJmYrc00yo6eJ5KSSz+BXvNNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:56.639893Z"},"content_sha256":"12e830f122dbbd155154eb8e65b0299f88c77309fa6f3e3503a8608bd3887c1e","schema_version":"1.0","event_id":"sha256:12e830f122dbbd155154eb8e65b0299f88c77309fa6f3e3503a8608bd3887c1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/bundle.json","state_url":"https://pith.science/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/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-05-27T14:40:56Z","links":{"resolver":"https://pith.science/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ","bundle":"https://pith.science/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/bundle.json","state":"https://pith.science/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJ35STUWXEMMKNUY5KEJJKMQVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RJ35STUWXEMMKNUY5KEJJKMQVZ","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":"f0d282e59487d59440615e03b202fc20724f1c2d1448872d4c501c6ae1589300","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-22T09:36:26Z","title_canon_sha256":"fba22623bbfc710975cecaf19a16b607dbe94a6968b1110f1d4d838059d5c799"},"schema_version":"1.0","source":{"id":"1611.07214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07214","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07214v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07214","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"RJ35STUWXEMM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJ35STUWXEMMKNUY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJ35STUW","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:12e830f122dbbd155154eb8e65b0299f88c77309fa6f3e3503a8608bd3887c1e","target":"graph","created_at":"2026-05-18T00:46:04Z","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 consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a perturbation of the former. The processes are described by probability measures on the boundary of the given tree, and by corresponding forward transition probabilities at the inner nodes. The comparison is in terms of Kullback-Leibler divergence. We elaborate and extend ideas and results of B\\\"ocherer and Amjad. Our extensions involve length functions on the edges ","authors_text":"Thomas Hirschler, Wolfgang Woess","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-22T09:36:26Z","title":"Comparing entropy rates on finite and infinite rooted trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07214","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:05fe6a839f30e00c4c2be8af2486107cd00d6750d44071003e8cc94e08262bde","target":"record","created_at":"2026-05-18T00:46:04Z","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":"f0d282e59487d59440615e03b202fc20724f1c2d1448872d4c501c6ae1589300","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-22T09:36:26Z","title_canon_sha256":"fba22623bbfc710975cecaf19a16b607dbe94a6968b1110f1d4d838059d5c799"},"schema_version":"1.0","source":{"id":"1611.07214","kind":"arxiv","version":2}},"canonical_sha256":"8a77d94e96b918c53698ea8894a990ae6e449477ef8d4f0200c031797f43e2e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a77d94e96b918c53698ea8894a990ae6e449477ef8d4f0200c031797f43e2e6","first_computed_at":"2026-05-18T00:46:04.253847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:04.253847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"87bDfaUCm1tt9Sen6dnnhgBN9yS+IJ+QxK3KT3dXDq7OP8IRGfVk5qI5KczhRSiDLhKF+vgLmcUtUbNY0mk+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:04.254278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05fe6a839f30e00c4c2be8af2486107cd00d6750d44071003e8cc94e08262bde","sha256:12e830f122dbbd155154eb8e65b0299f88c77309fa6f3e3503a8608bd3887c1e"],"state_sha256":"6a617069c176b97d804357a824506bf5192c918fddd8203c5e72b290fe4d2197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7C+U56oXWx3bjgZJpZNvM5jt0ZBMxbcvD//TFP76O2Um2sMEuimc5VAf49GGyC8Tk9uf1WBAGX/644qIOmrLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:40:56.643657Z","bundle_sha256":"867053e76514d0d560f7ca693e434a097249ca66bacc6cd136caa8ad97a6a242"}}