{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6AS4RSUFG27NKWQSGQ455IRN2D","short_pith_number":"pith:6AS4RSUF","canonical_record":{"source":{"id":"1501.05887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T17:49:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f59a640f1fce4c2d0027efc9abf4e3aff29b3dcef2595fb7193838c0c8c078fb","abstract_canon_sha256":"82e7133e0578324425a0a756cdce6f48d2626b512b946b94e98ffe5a908e138d"},"schema_version":"1.0"},"canonical_sha256":"f025c8ca8536bed55a123439dea22dd0f6a1bf69879beb96f0f223e97e4ae300","source":{"kind":"arxiv","id":"1501.05887","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05887","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05887v3","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05887","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"6AS4RSUFG27N","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6AS4RSUFG27NKWQS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6AS4RSUF","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6AS4RSUFG27NKWQSGQ455IRN2D","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T17:49:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f59a640f1fce4c2d0027efc9abf4e3aff29b3dcef2595fb7193838c0c8c078fb","abstract_canon_sha256":"82e7133e0578324425a0a756cdce6f48d2626b512b946b94e98ffe5a908e138d"},"schema_version":"1.0"},"canonical_sha256":"f025c8ca8536bed55a123439dea22dd0f6a1bf69879beb96f0f223e97e4ae300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:32.670059Z","signature_b64":"4L3HrrE0Ci/9LM9EtcZZuq/uVnHxkEqmUQIDcL63NTz8Yz2lNTkkijTnDVhb54bbNUfDUbk93SaXKJ9fxO91AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f025c8ca8536bed55a123439dea22dd0f6a1bf69879beb96f0f223e97e4ae300","last_reissued_at":"2026-05-18T01:15:32.669400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:32.669400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05887","source_version":3,"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8KJ0qFAuz01thsbfn4XrdYFI34zYb5yqTSlLa9sVfSsvyx+GLBex/+UNiL/EhYVtVIaS1q7X8kZQfrTHlEyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:48:56.137723Z"},"content_sha256":"85abe308d222d0ee5c9cf6ef0b31e567502ba46a7df0b66aa0b1d3c14d746e37","schema_version":"1.0","event_id":"sha256:85abe308d222d0ee5c9cf6ef0b31e567502ba46a7df0b66aa0b1d3c14d746e37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6AS4RSUFG27NKWQSGQ455IRN2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hideki Yagi, Ryo Nomura, Te Sun Han","submitted_at":"2015-01-23T17:49:09Z","abstract_excerpt":"This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed {channels} whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as {mixed memoryless channels with general mixture} and include the class of mixed memoryless channels of finitely or countably memoryless channels as a special case. For mixed memoryless channels with general mixture, the first-order coding theorem which gives a formula for the $\\varepsilon$-capacit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05887","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"},"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtYIVKT7PnDr0nBK9YpXiu5BOjBmrTmoyUNElLGeWY/qb6TGghN+pI21a6OCKmouzcrEliltup4KRbUxN5NtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:48:56.138210Z"},"content_sha256":"fd2bdbb85cea878d59ae1538467c0b3bd055a109bc9b4c97f40c1ae7f48828e4","schema_version":"1.0","event_id":"sha256:fd2bdbb85cea878d59ae1538467c0b3bd055a109bc9b4c97f40c1ae7f48828e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AS4RSUFG27NKWQSGQ455IRN2D/bundle.json","state_url":"https://pith.science/pith/6AS4RSUFG27NKWQSGQ455IRN2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AS4RSUFG27NKWQSGQ455IRN2D/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-26T04:48:56Z","links":{"resolver":"https://pith.science/pith/6AS4RSUFG27NKWQSGQ455IRN2D","bundle":"https://pith.science/pith/6AS4RSUFG27NKWQSGQ455IRN2D/bundle.json","state":"https://pith.science/pith/6AS4RSUFG27NKWQSGQ455IRN2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AS4RSUFG27NKWQSGQ455IRN2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6AS4RSUFG27NKWQSGQ455IRN2D","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":"82e7133e0578324425a0a756cdce6f48d2626b512b946b94e98ffe5a908e138d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T17:49:09Z","title_canon_sha256":"f59a640f1fce4c2d0027efc9abf4e3aff29b3dcef2595fb7193838c0c8c078fb"},"schema_version":"1.0","source":{"id":"1501.05887","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05887","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05887v3","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05887","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"6AS4RSUFG27N","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6AS4RSUFG27NKWQS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6AS4RSUF","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:fd2bdbb85cea878d59ae1538467c0b3bd055a109bc9b4c97f40c1ae7f48828e4","target":"graph","created_at":"2026-05-18T01:15:32Z","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":"This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed {channels} whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as {mixed memoryless channels with general mixture} and include the class of mixed memoryless channels of finitely or countably memoryless channels as a special case. For mixed memoryless channels with general mixture, the first-order coding theorem which gives a formula for the $\\varepsilon$-capacit","authors_text":"Hideki Yagi, Ryo Nomura, Te Sun Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T17:49:09Z","title":"First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05887","kind":"arxiv","version":3},"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:85abe308d222d0ee5c9cf6ef0b31e567502ba46a7df0b66aa0b1d3c14d746e37","target":"record","created_at":"2026-05-18T01:15:32Z","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":"82e7133e0578324425a0a756cdce6f48d2626b512b946b94e98ffe5a908e138d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T17:49:09Z","title_canon_sha256":"f59a640f1fce4c2d0027efc9abf4e3aff29b3dcef2595fb7193838c0c8c078fb"},"schema_version":"1.0","source":{"id":"1501.05887","kind":"arxiv","version":3}},"canonical_sha256":"f025c8ca8536bed55a123439dea22dd0f6a1bf69879beb96f0f223e97e4ae300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f025c8ca8536bed55a123439dea22dd0f6a1bf69879beb96f0f223e97e4ae300","first_computed_at":"2026-05-18T01:15:32.669400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:32.669400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4L3HrrE0Ci/9LM9EtcZZuq/uVnHxkEqmUQIDcL63NTz8Yz2lNTkkijTnDVhb54bbNUfDUbk93SaXKJ9fxO91AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:32.670059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05887","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85abe308d222d0ee5c9cf6ef0b31e567502ba46a7df0b66aa0b1d3c14d746e37","sha256:fd2bdbb85cea878d59ae1538467c0b3bd055a109bc9b4c97f40c1ae7f48828e4"],"state_sha256":"47ce8b56276ded28afe9591d37c9632e859201bf48d3278c5ac585b134289c49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZLsCz37KaR6PbPmKTlKsjPtUulS3y8jAmV7Hk+clRfPsi4Ie+oKC2tBMTTEdXLLDdVejdVAdNUeREUXmbbmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:48:56.142160Z","bundle_sha256":"19416ecb2f302b7cea7cf7e3a79622f129a501d56d2ca7d64c930c0275d672e7"}}