{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HDR553IUMQHV32OWXWDEAJVACO","short_pith_number":"pith:HDR553IU","canonical_record":{"source":{"id":"1609.00189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T11:29:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"442d5bcb60f614d5b4f12fb96a0dc53ed6c42aaa4c2efba3057f5ea0bbf805ce","abstract_canon_sha256":"0997819bead345b59dc6a3127be247d867aa923002949f164e21b02447a9277c"},"schema_version":"1.0"},"canonical_sha256":"38e3deed14640f5de9d6bd864026a013a0243bfadb23220840d19ad5a84fe983","source":{"kind":"arxiv","id":"1609.00189","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00189","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00189v2","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00189","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"pith_short_12","alias_value":"HDR553IUMQHV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDR553IUMQHV32OW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDR553IU","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HDR553IUMQHV32OWXWDEAJVACO","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T11:29:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"442d5bcb60f614d5b4f12fb96a0dc53ed6c42aaa4c2efba3057f5ea0bbf805ce","abstract_canon_sha256":"0997819bead345b59dc6a3127be247d867aa923002949f164e21b02447a9277c"},"schema_version":"1.0"},"canonical_sha256":"38e3deed14640f5de9d6bd864026a013a0243bfadb23220840d19ad5a84fe983","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:28.435826Z","signature_b64":"FtJnujH3Bs+20rHhUoTB4mOGf1yXz9sx9zh6z7kdPBFbH+Ec8RnCkyhK5yGJaeMN7i9qxWPUm8+U1j44XNEmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e3deed14640f5de9d6bd864026a013a0243bfadb23220840d19ad5a84fe983","last_reissued_at":"2026-05-18T00:58:28.435166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:28.435166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00189","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:58:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBbXQ3WLQRpsPWTKKrN5mEtEPEZ9kQBzpnV9iQT0NBS3a+KhCDFArQdtMOcvtW/wJ++5l2a/+BodRZtbAAAXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:25:10.656461Z"},"content_sha256":"926321369fe8643c59c5acf037f9838b775d860f127cb893ab6d9d5768bd5dd1","schema_version":"1.0","event_id":"sha256:926321369fe8643c59c5acf037f9838b775d860f127cb893ab6d9d5768bd5dd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HDR553IUMQHV32OWXWDEAJVACO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj","submitted_at":"2016-09-01T11:29:38Z","abstract_excerpt":"Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions satisfying the Karush-Kuhn-Tucker (KKT) conditions for the capacity-achieving output distribution. Simplified algebraic characterizations of the bounds are presented for the binary erasure channel (BEC) and the binary symmetric channel (BSC). These upper bounds are very close to achievable rates, and improve upon previously known feedback-based bounds for a large ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00189","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:58:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buFb6IIuc3XxMHZNATLolKMhgCvs5hpBKtzBMrKJ4CroSJj2Qt2ex069JRsA9jdniPrzCG1DKm/i6Hs+wdgxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:25:10.657173Z"},"content_sha256":"116ea2aaad38f0567f0de2aac8d1ef2d1aaf52cf68b8bb849f36efe2686b2ec5","schema_version":"1.0","event_id":"sha256:116ea2aaad38f0567f0de2aac8d1ef2d1aaf52cf68b8bb849f36efe2686b2ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDR553IUMQHV32OWXWDEAJVACO/bundle.json","state_url":"https://pith.science/pith/HDR553IUMQHV32OWXWDEAJVACO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDR553IUMQHV32OWXWDEAJVACO/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-08T21:25:10Z","links":{"resolver":"https://pith.science/pith/HDR553IUMQHV32OWXWDEAJVACO","bundle":"https://pith.science/pith/HDR553IUMQHV32OWXWDEAJVACO/bundle.json","state":"https://pith.science/pith/HDR553IUMQHV32OWXWDEAJVACO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDR553IUMQHV32OWXWDEAJVACO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HDR553IUMQHV32OWXWDEAJVACO","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":"0997819bead345b59dc6a3127be247d867aa923002949f164e21b02447a9277c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T11:29:38Z","title_canon_sha256":"442d5bcb60f614d5b4f12fb96a0dc53ed6c42aaa4c2efba3057f5ea0bbf805ce"},"schema_version":"1.0","source":{"id":"1609.00189","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00189","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00189v2","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00189","created_at":"2026-05-18T00:58:28Z"},{"alias_kind":"pith_short_12","alias_value":"HDR553IUMQHV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDR553IUMQHV32OW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDR553IU","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:116ea2aaad38f0567f0de2aac8d1ef2d1aaf52cf68b8bb849f36efe2686b2ec5","target":"graph","created_at":"2026-05-18T00:58:28Z","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":"Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions satisfying the Karush-Kuhn-Tucker (KKT) conditions for the capacity-achieving output distribution. Simplified algebraic characterizations of the bounds are presented for the binary erasure channel (BEC) and the binary symmetric channel (BSC). These upper bounds are very close to achievable rates, and improve upon previously known feedback-based bounds for a large ra","authors_text":"Andrew Thangaraj","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T11:29:38Z","title":"Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00189","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:926321369fe8643c59c5acf037f9838b775d860f127cb893ab6d9d5768bd5dd1","target":"record","created_at":"2026-05-18T00:58:28Z","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":"0997819bead345b59dc6a3127be247d867aa923002949f164e21b02447a9277c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T11:29:38Z","title_canon_sha256":"442d5bcb60f614d5b4f12fb96a0dc53ed6c42aaa4c2efba3057f5ea0bbf805ce"},"schema_version":"1.0","source":{"id":"1609.00189","kind":"arxiv","version":2}},"canonical_sha256":"38e3deed14640f5de9d6bd864026a013a0243bfadb23220840d19ad5a84fe983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38e3deed14640f5de9d6bd864026a013a0243bfadb23220840d19ad5a84fe983","first_computed_at":"2026-05-18T00:58:28.435166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:28.435166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FtJnujH3Bs+20rHhUoTB4mOGf1yXz9sx9zh6z7kdPBFbH+Ec8RnCkyhK5yGJaeMN7i9qxWPUm8+U1j44XNEmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:28.435826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00189","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:926321369fe8643c59c5acf037f9838b775d860f127cb893ab6d9d5768bd5dd1","sha256:116ea2aaad38f0567f0de2aac8d1ef2d1aaf52cf68b8bb849f36efe2686b2ec5"],"state_sha256":"cc36a5896152ef5f432b8e763e3944b9c3868fffb37304b34e3bbcdc0c0a214b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkmAgQuMwvsePu4x9TlNB342BGjyZka6f3lnoXBDc0lKTGWDS6i8aJ42iBu330W3cQkL1KATtQTSst0s9OJwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:25:10.663301Z","bundle_sha256":"03acdb5bb6e8158ea393db6bdf1712dceb56536ffe143139aaccab9bd3d4b775"}}