{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KTABHGVKBN4KF56J6LD45NFUIA","short_pith_number":"pith:KTABHGVK","canonical_record":{"source":{"id":"1801.03594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T00:16:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53d5604acbe8f1793a8a974d976b03175d3418d84aa0c1f4dc932a0701ff3b9f","abstract_canon_sha256":"3af67a23414127098fe6660c2af33d37fa6bd0b913cc90e255fa36e7fccbe348"},"schema_version":"1.0"},"canonical_sha256":"54c0139aaa0b78a2f7c9f2c7ceb4b4403bdd6a70644d40642d73ae556b987005","source":{"kind":"arxiv","id":"1801.03594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03594","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03594v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03594","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"KTABHGVKBN4K","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTABHGVKBN4KF56J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTABHGVK","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KTABHGVKBN4KF56J6LD45NFUIA","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T00:16:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53d5604acbe8f1793a8a974d976b03175d3418d84aa0c1f4dc932a0701ff3b9f","abstract_canon_sha256":"3af67a23414127098fe6660c2af33d37fa6bd0b913cc90e255fa36e7fccbe348"},"schema_version":"1.0"},"canonical_sha256":"54c0139aaa0b78a2f7c9f2c7ceb4b4403bdd6a70644d40642d73ae556b987005","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.853393Z","signature_b64":"kMPdhWEJFtWyr0J+IbESTf5Ora6ESpM+QRh9zQqC1TTyFloVS5L4W9zWgNatn0ULOCxjuz4iR1/o9qEUdW8IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c0139aaa0b78a2f7c9f2c7ceb4b4403bdd6a70644d40642d73ae556b987005","last_reissued_at":"2026-05-18T00:26:13.852621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.852621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03594","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIjfdaCMdlhZm007ux9yy/JSeF4St3Kyik9zPO3an4p1IQjO6siM7TIbYNREksZhSXhoEGQI4+O5ScnNwYz/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:06:08.714490Z"},"content_sha256":"c947fe3fa41794aef9650da5e8d2b55799a79833371b328138740aa35db66998","schema_version":"1.0","event_id":"sha256:c947fe3fa41794aef9650da5e8d2b55799a79833371b328138740aa35db66998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KTABHGVKBN4KF56J6LD45NFUIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Blocklength and Dispersion Bounds for the Arbitrarily-Varying Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Oliver Kosut","submitted_at":"2018-01-11T00:16:58Z","abstract_excerpt":"Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03594","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFnbRttmGC1RDCh4GM1BfA7HbpNKhh0WWFz8cvcmu57nPLNgRbKcEU/rdf99ah65MJVm0nH3g3ij4qP1JkhICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:06:08.714856Z"},"content_sha256":"4e89fd682b7e7c54152c652d4f9285abbe347bc7693223f95b21ecf075aeb273","schema_version":"1.0","event_id":"sha256:4e89fd682b7e7c54152c652d4f9285abbe347bc7693223f95b21ecf075aeb273"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTABHGVKBN4KF56J6LD45NFUIA/bundle.json","state_url":"https://pith.science/pith/KTABHGVKBN4KF56J6LD45NFUIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTABHGVKBN4KF56J6LD45NFUIA/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-28T20:06:08Z","links":{"resolver":"https://pith.science/pith/KTABHGVKBN4KF56J6LD45NFUIA","bundle":"https://pith.science/pith/KTABHGVKBN4KF56J6LD45NFUIA/bundle.json","state":"https://pith.science/pith/KTABHGVKBN4KF56J6LD45NFUIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTABHGVKBN4KF56J6LD45NFUIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KTABHGVKBN4KF56J6LD45NFUIA","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":"3af67a23414127098fe6660c2af33d37fa6bd0b913cc90e255fa36e7fccbe348","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T00:16:58Z","title_canon_sha256":"53d5604acbe8f1793a8a974d976b03175d3418d84aa0c1f4dc932a0701ff3b9f"},"schema_version":"1.0","source":{"id":"1801.03594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03594","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03594v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03594","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"KTABHGVKBN4K","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTABHGVKBN4KF56J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTABHGVK","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:4e89fd682b7e7c54152c652d4f9285abbe347bc7693223f95b21ecf075aeb273","target":"graph","created_at":"2026-05-18T00:26:13Z","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":"Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channe","authors_text":"Joerg Kliewer, Oliver Kosut","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T00:16:58Z","title":"Finite Blocklength and Dispersion Bounds for the Arbitrarily-Varying Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03594","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:c947fe3fa41794aef9650da5e8d2b55799a79833371b328138740aa35db66998","target":"record","created_at":"2026-05-18T00:26:13Z","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":"3af67a23414127098fe6660c2af33d37fa6bd0b913cc90e255fa36e7fccbe348","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T00:16:58Z","title_canon_sha256":"53d5604acbe8f1793a8a974d976b03175d3418d84aa0c1f4dc932a0701ff3b9f"},"schema_version":"1.0","source":{"id":"1801.03594","kind":"arxiv","version":1}},"canonical_sha256":"54c0139aaa0b78a2f7c9f2c7ceb4b4403bdd6a70644d40642d73ae556b987005","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54c0139aaa0b78a2f7c9f2c7ceb4b4403bdd6a70644d40642d73ae556b987005","first_computed_at":"2026-05-18T00:26:13.852621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.852621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMPdhWEJFtWyr0J+IbESTf5Ora6ESpM+QRh9zQqC1TTyFloVS5L4W9zWgNatn0ULOCxjuz4iR1/o9qEUdW8IAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.853393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c947fe3fa41794aef9650da5e8d2b55799a79833371b328138740aa35db66998","sha256:4e89fd682b7e7c54152c652d4f9285abbe347bc7693223f95b21ecf075aeb273"],"state_sha256":"7dab7da4da77fc9268fdca29b98dca255c858da1ddf6837ca76ef8666ae6166d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75OntOyTwPY/Ov8y6wj8crpx8pSZhCh8lFb90itvuIiwG8X7q5io2fN3fU3V7PI9leUYWsZtDzn+xl6BQO8+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:06:08.716981Z","bundle_sha256":"0aba6e1d76852e219a56a222ca07bfe48509b485c846b39c0ff4f92a9e2e936b"}}