{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZKOGWOHZK3WC4TMH6OJXSW3YMX","short_pith_number":"pith:ZKOGWOHZ","canonical_record":{"source":{"id":"2012.00077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-30T20:01:58Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"2277650c82bdaf4e34f26a0c3bb73ddfd149d7f7077cdc1e88c43001db31193b","abstract_canon_sha256":"ff8f36770b886ec49c16032c1ed9877801e12f36ba6c3c89d5a2516b6dc5c042"},"schema_version":"1.0"},"canonical_sha256":"ca9c6b38f956ec2e4d87f393795b7865c5bbb435086ce9fa23fbfdc0c13a6606","source":{"kind":"arxiv","id":"2012.00077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00077","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00077v1","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00077","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZKOGWOHZK3WC","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_16","alias_value":"ZKOGWOHZK3WC4TMH","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_8","alias_value":"ZKOGWOHZ","created_at":"2026-07-05T01:55:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZKOGWOHZK3WC4TMH6OJXSW3YMX","target":"record","payload":{"canonical_record":{"source":{"id":"2012.00077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-30T20:01:58Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"2277650c82bdaf4e34f26a0c3bb73ddfd149d7f7077cdc1e88c43001db31193b","abstract_canon_sha256":"ff8f36770b886ec49c16032c1ed9877801e12f36ba6c3c89d5a2516b6dc5c042"},"schema_version":"1.0"},"canonical_sha256":"ca9c6b38f956ec2e4d87f393795b7865c5bbb435086ce9fa23fbfdc0c13a6606","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:32.125913Z","signature_b64":"h/c/Wo157XETzvs/D32cXPoQYS7kXfwr3PAbIrm2Y+U2lro52W9iqpVnxTl3qeDE2T9EhBV4+bQHD/8L4B8oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca9c6b38f956ec2e4d87f393795b7865c5bbb435086ce9fa23fbfdc0c13a6606","last_reissued_at":"2026-07-05T01:55:32.125533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:32.125533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.00077","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-07-05T01:55:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQi7OJKMDPcVQc8Aks9JkUAiIyj6SKdFYw4ytKxsqrGLeam9NpxJycckcGegkAMbmSSmhRYme4mbjPVAPHByBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:05:38.179730Z"},"content_sha256":"9f7f5ddd845102d8698b2e63ff71273aed0fb6dcfa28741dc12e548e35f4dbd3","schema_version":"1.0","event_id":"sha256:9f7f5ddd845102d8698b2e63ff71273aed0fb6dcfa28741dc12e548e35f4dbd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZKOGWOHZK3WC4TMH6OJXSW3YMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Error Exponents of Almost-Fixed-Length Channel Codes and Hypothesis Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Anusha Lalitha, Tara Javidi","submitted_at":"2020-11-30T20:01:58Z","abstract_excerpt":"We examine a new class of channel coding strategies, and hypothesis tests referred to as almost-fixed-length strategies that have little flexibility in the stopping time over fixed-length strategies. The stopping time of these strategies is allowed to be slightly large only on a rare set of sample paths with an exponentially small probability. We show that almost-fixed-length channel coding strategies can achieve Burnashev's optimal error exponent. Similarly, almost-fixed length hypothesis tests are shown to bridge the gap between hypothesis testing with fixed sample size and sequential hypoth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00077","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.00077/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:55:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4KIfSjZW0kdbFeYfioP4ZzIME65e3oFSM4/2wAObxy6krqHYYTr10+iZThD4qKydQardLQnySqlkEHsEDbwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:05:38.180269Z"},"content_sha256":"1227e8fba321dc9aeba311d61f649300c8491bbe3df2641052910cfb7fb430e5","schema_version":"1.0","event_id":"sha256:1227e8fba321dc9aeba311d61f649300c8491bbe3df2641052910cfb7fb430e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/bundle.json","state_url":"https://pith.science/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/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-08-11T21:05:38Z","links":{"resolver":"https://pith.science/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX","bundle":"https://pith.science/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/bundle.json","state":"https://pith.science/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKOGWOHZK3WC4TMH6OJXSW3YMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZKOGWOHZK3WC4TMH6OJXSW3YMX","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":"ff8f36770b886ec49c16032c1ed9877801e12f36ba6c3c89d5a2516b6dc5c042","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-30T20:01:58Z","title_canon_sha256":"2277650c82bdaf4e34f26a0c3bb73ddfd149d7f7077cdc1e88c43001db31193b"},"schema_version":"1.0","source":{"id":"2012.00077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00077","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00077v1","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00077","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZKOGWOHZK3WC","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_16","alias_value":"ZKOGWOHZK3WC4TMH","created_at":"2026-07-05T01:55:32Z"},{"alias_kind":"pith_short_8","alias_value":"ZKOGWOHZ","created_at":"2026-07-05T01:55:32Z"}],"graph_snapshots":[{"event_id":"sha256:1227e8fba321dc9aeba311d61f649300c8491bbe3df2641052910cfb7fb430e5","target":"graph","created_at":"2026-07-05T01:55: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.00077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We examine a new class of channel coding strategies, and hypothesis tests referred to as almost-fixed-length strategies that have little flexibility in the stopping time over fixed-length strategies. The stopping time of these strategies is allowed to be slightly large only on a rare set of sample paths with an exponentially small probability. We show that almost-fixed-length channel coding strategies can achieve Burnashev's optimal error exponent. Similarly, almost-fixed length hypothesis tests are shown to bridge the gap between hypothesis testing with fixed sample size and sequential hypoth","authors_text":"Anusha Lalitha, Tara Javidi","cross_cats":["math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-30T20:01:58Z","title":"On Error Exponents of Almost-Fixed-Length Channel Codes and Hypothesis Tests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00077","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:9f7f5ddd845102d8698b2e63ff71273aed0fb6dcfa28741dc12e548e35f4dbd3","target":"record","created_at":"2026-07-05T01:55: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":"ff8f36770b886ec49c16032c1ed9877801e12f36ba6c3c89d5a2516b6dc5c042","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-30T20:01:58Z","title_canon_sha256":"2277650c82bdaf4e34f26a0c3bb73ddfd149d7f7077cdc1e88c43001db31193b"},"schema_version":"1.0","source":{"id":"2012.00077","kind":"arxiv","version":1}},"canonical_sha256":"ca9c6b38f956ec2e4d87f393795b7865c5bbb435086ce9fa23fbfdc0c13a6606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca9c6b38f956ec2e4d87f393795b7865c5bbb435086ce9fa23fbfdc0c13a6606","first_computed_at":"2026-07-05T01:55:32.125533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:55:32.125533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/c/Wo157XETzvs/D32cXPoQYS7kXfwr3PAbIrm2Y+U2lro52W9iqpVnxTl3qeDE2T9EhBV4+bQHD/8L4B8oAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:55:32.125913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.00077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f7f5ddd845102d8698b2e63ff71273aed0fb6dcfa28741dc12e548e35f4dbd3","sha256:1227e8fba321dc9aeba311d61f649300c8491bbe3df2641052910cfb7fb430e5"],"state_sha256":"782c3771a53fe96ed4a178c3d5f91eb80b19db3f1c62307eb24d9dc89b7a17ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCN+uCJpID6TLm7Rv7IAKZUwpejtVh55Xx4BtcFOPzzO73jN7rXQokxxaTvNUkCIieniWIl4W2sViY+kaVnTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:05:38.184351Z","bundle_sha256":"92009b35046345985de6ea297193751158f8a35131da657063e6b25a65ec5867"}}