{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O42KYVKL4CQH2FRKUGMMO6YSHT","short_pith_number":"pith:O42KYVKL","canonical_record":{"source":{"id":"1303.3656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T01:26:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88770ac6239b85362c84bcdf17ddafaedf1dd3d714d55d4183ee57ff4fc02a57","abstract_canon_sha256":"59059e804acb85cf690722b58f5f688b33070a53987de855fc54f072754986a7"},"schema_version":"1.0"},"canonical_sha256":"7734ac554be0a07d162aa198c77b123ce959ed4633a8ec848d1aaab91c1bad28","source":{"kind":"arxiv","id":"1303.3656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3656","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3656v1","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3656","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"O42KYVKL4CQH","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O42KYVKL4CQH2FRK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O42KYVKL","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O42KYVKL4CQH2FRKUGMMO6YSHT","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T01:26:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88770ac6239b85362c84bcdf17ddafaedf1dd3d714d55d4183ee57ff4fc02a57","abstract_canon_sha256":"59059e804acb85cf690722b58f5f688b33070a53987de855fc54f072754986a7"},"schema_version":"1.0"},"canonical_sha256":"7734ac554be0a07d162aa198c77b123ce959ed4633a8ec848d1aaab91c1bad28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:52.751229Z","signature_b64":"VrcBv89wq8upodjMquoH1zjZXyB/1EL9adYmyY8DADeOPZyoSKEVVTuj6hJxM+07IkU8fGsETn5ndIPvQzYHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7734ac554be0a07d162aa198c77b123ce959ed4633a8ec848d1aaab91c1bad28","last_reissued_at":"2026-05-18T03:30:52.750310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:52.750310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3656","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-18T03:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1bg0+Qq5lv4wSFxe575gqLaneE7dGHz2y1iQijc2aKUlXautBs7Ml9pIT0wOwzkDiR+IWWH/Sf+85yWhFe2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:39:27.517985Z"},"content_sha256":"2947d1e14bab38e94492f48a5a8200674df813ef915cf40df8a29381d18ebab7","schema_version":"1.0","event_id":"sha256:2947d1e14bab38e94492f48a5a8200674df813ef915cf40df8a29381d18ebab7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O42KYVKL4CQH2FRKUGMMO6YSHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Randomized Approach to the Capacity of Finite-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangyue Han","submitted_at":"2013-03-15T01:26:21Z","abstract_excerpt":"Inspired by the ideas from the field of stochastic approximation, we propose a randomized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with respect to the chosen parameterization, we show that the proposed algorithm will almost surely converge to the capacity of the channel and derive the rate of convergence. We also discuss the convergence behavior of the algorithm without the concavity assumption."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3656","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-18T03:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPP6+tdqcC0EUHWlKbVWzEmamDfbC+c9oxde2zGW8JE/vYmRWe4AuL4pYM2evv48Mfwlugy9p1tcdfhkvwAlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:39:27.518347Z"},"content_sha256":"fbe61ad4d15fceaf35fca65b3176ecefc648761a2b2d35ef94362bd42bf238de","schema_version":"1.0","event_id":"sha256:fbe61ad4d15fceaf35fca65b3176ecefc648761a2b2d35ef94362bd42bf238de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/bundle.json","state_url":"https://pith.science/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/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-23T04:39:27Z","links":{"resolver":"https://pith.science/pith/O42KYVKL4CQH2FRKUGMMO6YSHT","bundle":"https://pith.science/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/bundle.json","state":"https://pith.science/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O42KYVKL4CQH2FRKUGMMO6YSHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O42KYVKL4CQH2FRKUGMMO6YSHT","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":"59059e804acb85cf690722b58f5f688b33070a53987de855fc54f072754986a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T01:26:21Z","title_canon_sha256":"88770ac6239b85362c84bcdf17ddafaedf1dd3d714d55d4183ee57ff4fc02a57"},"schema_version":"1.0","source":{"id":"1303.3656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3656","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3656v1","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3656","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"O42KYVKL4CQH","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O42KYVKL4CQH2FRK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O42KYVKL","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:fbe61ad4d15fceaf35fca65b3176ecefc648761a2b2d35ef94362bd42bf238de","target":"graph","created_at":"2026-05-18T03:30:52Z","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":"Inspired by the ideas from the field of stochastic approximation, we propose a randomized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with respect to the chosen parameterization, we show that the proposed algorithm will almost surely converge to the capacity of the channel and derive the rate of convergence. We also discuss the convergence behavior of the algorithm without the concavity assumption.","authors_text":"Guangyue Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T01:26:21Z","title":"A Randomized Approach to the Capacity of Finite-State Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3656","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:2947d1e14bab38e94492f48a5a8200674df813ef915cf40df8a29381d18ebab7","target":"record","created_at":"2026-05-18T03:30:52Z","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":"59059e804acb85cf690722b58f5f688b33070a53987de855fc54f072754986a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T01:26:21Z","title_canon_sha256":"88770ac6239b85362c84bcdf17ddafaedf1dd3d714d55d4183ee57ff4fc02a57"},"schema_version":"1.0","source":{"id":"1303.3656","kind":"arxiv","version":1}},"canonical_sha256":"7734ac554be0a07d162aa198c77b123ce959ed4633a8ec848d1aaab91c1bad28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7734ac554be0a07d162aa198c77b123ce959ed4633a8ec848d1aaab91c1bad28","first_computed_at":"2026-05-18T03:30:52.750310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:52.750310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VrcBv89wq8upodjMquoH1zjZXyB/1EL9adYmyY8DADeOPZyoSKEVVTuj6hJxM+07IkU8fGsETn5ndIPvQzYHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:52.751229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2947d1e14bab38e94492f48a5a8200674df813ef915cf40df8a29381d18ebab7","sha256:fbe61ad4d15fceaf35fca65b3176ecefc648761a2b2d35ef94362bd42bf238de"],"state_sha256":"58be2e52eaa0719c2dcb0ed938705a0365ef19bb00448b6124f4ef83311c1813"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWmPt4Bpuzv94+DQQ+nZz37UYL5aAGN08G9gNiBL66xTmlar6IpQblcL3VqFM3mMfn0X6WCLzxCkDSbITjLRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:39:27.520254Z","bundle_sha256":"864dd758a454c447cd0df245df25b8b00f47262a7c08eb6285fefd5b9dc5d3b5"}}