{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QWYC2QRPM43BTA67OSCEZ2OGWR","short_pith_number":"pith:QWYC2QRP","canonical_record":{"source":{"id":"1601.06101","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T19:05:23Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT","quant-ph"],"title_canon_sha256":"63c9dc9aece71ead6bad2fd9d951e6be78d3f0b164dd3ce0c8204a5cf519929d","abstract_canon_sha256":"4fe3d3777d037f30526b8e17cf27bdea4716041f346ede283109596ed88c4090"},"schema_version":"1.0"},"canonical_sha256":"85b02d422f67361983df74844ce9c6b44136a8ce2b5ddc583b6be3900c4d6869","source":{"kind":"arxiv","id":"1601.06101","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06101","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06101v3","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06101","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"QWYC2QRPM43B","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWYC2QRPM43BTA67","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWYC2QRP","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QWYC2QRPM43BTA67OSCEZ2OGWR","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06101","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T19:05:23Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT","quant-ph"],"title_canon_sha256":"63c9dc9aece71ead6bad2fd9d951e6be78d3f0b164dd3ce0c8204a5cf519929d","abstract_canon_sha256":"4fe3d3777d037f30526b8e17cf27bdea4716041f346ede283109596ed88c4090"},"schema_version":"1.0"},"canonical_sha256":"85b02d422f67361983df74844ce9c6b44136a8ce2b5ddc583b6be3900c4d6869","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:40.251792Z","signature_b64":"Te/8bmpHqXYeprr4bs6LNCHILRWmJ7tX98cOljggETnSHr24FOkbBgtcSVLqjKK1a0EFx54NljVrt8oT61sqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b02d422f67361983df74844ce9c6b44136a8ce2b5ddc583b6be3900c4d6869","last_reissued_at":"2026-05-18T00:20:40.251104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:40.251104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06101","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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AgpqRE4cVKhZTT0dyzrH4d93g4Wbn8tHBHJdxnc+oZ2asy7O984LXpLReOdJbkptjGedO7A638vgDMYFczpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:41:12.048692Z"},"content_sha256":"bb1102b42f8e2975a42bf1422f58866b835a01c09e2b3c3d2964899efd68df06","schema_version":"1.0","event_id":"sha256:bb1102b42f8e2975a42bf1422f58866b835a01c09e2b3c3d2964899efd68df06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QWYC2QRPM43BTA67OSCEZ2OGWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory effects can make the transmission capability of a communication channel uncomputable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"David Elkouss, David P\\'erez-Garc\\'ia","submitted_at":"2016-01-22T19:05:23Z","abstract_excerpt":"Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted through the channel is as large as possible. The maximum rate at which reliable transmission is possible is called the capacity. If the channel does not keep memory of its past, the capacity is given by a simple optimization problem and can be efficiently computed. The situation of channels with memory is less clear. Here we show that for channels with memory t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06101","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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIXxsrungzqLzWWvMXlb6drOlo8hV9SXjazVlAhMb2dRc4CU/oc2QsKygCqAt8NUMGdprg31gAkV3z3prTYzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:41:12.049362Z"},"content_sha256":"fe6b1f3d730d4cc1f40318114fd3184316a875c564a2fe86ef6167c83b483e46","schema_version":"1.0","event_id":"sha256:fe6b1f3d730d4cc1f40318114fd3184316a875c564a2fe86ef6167c83b483e46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/bundle.json","state_url":"https://pith.science/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/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-22T21:41:12Z","links":{"resolver":"https://pith.science/pith/QWYC2QRPM43BTA67OSCEZ2OGWR","bundle":"https://pith.science/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/bundle.json","state":"https://pith.science/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWYC2QRPM43BTA67OSCEZ2OGWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QWYC2QRPM43BTA67OSCEZ2OGWR","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":"4fe3d3777d037f30526b8e17cf27bdea4716041f346ede283109596ed88c4090","cross_cats_sorted":["cs.CC","cs.FL","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T19:05:23Z","title_canon_sha256":"63c9dc9aece71ead6bad2fd9d951e6be78d3f0b164dd3ce0c8204a5cf519929d"},"schema_version":"1.0","source":{"id":"1601.06101","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06101","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06101v3","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06101","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"QWYC2QRPM43B","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWYC2QRPM43BTA67","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWYC2QRP","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fe6b1f3d730d4cc1f40318114fd3184316a875c564a2fe86ef6167c83b483e46","target":"graph","created_at":"2026-05-18T00:20:40Z","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":"Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted through the channel is as large as possible. The maximum rate at which reliable transmission is possible is called the capacity. If the channel does not keep memory of its past, the capacity is given by a simple optimization problem and can be efficiently computed. The situation of channels with memory is less clear. Here we show that for channels with memory t","authors_text":"David Elkouss, David P\\'erez-Garc\\'ia","cross_cats":["cs.CC","cs.FL","math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T19:05:23Z","title":"Memory effects can make the transmission capability of a communication channel uncomputable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06101","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:bb1102b42f8e2975a42bf1422f58866b835a01c09e2b3c3d2964899efd68df06","target":"record","created_at":"2026-05-18T00:20:40Z","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":"4fe3d3777d037f30526b8e17cf27bdea4716041f346ede283109596ed88c4090","cross_cats_sorted":["cs.CC","cs.FL","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T19:05:23Z","title_canon_sha256":"63c9dc9aece71ead6bad2fd9d951e6be78d3f0b164dd3ce0c8204a5cf519929d"},"schema_version":"1.0","source":{"id":"1601.06101","kind":"arxiv","version":3}},"canonical_sha256":"85b02d422f67361983df74844ce9c6b44136a8ce2b5ddc583b6be3900c4d6869","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85b02d422f67361983df74844ce9c6b44136a8ce2b5ddc583b6be3900c4d6869","first_computed_at":"2026-05-18T00:20:40.251104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:40.251104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Te/8bmpHqXYeprr4bs6LNCHILRWmJ7tX98cOljggETnSHr24FOkbBgtcSVLqjKK1a0EFx54NljVrt8oT61sqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:40.251792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06101","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb1102b42f8e2975a42bf1422f58866b835a01c09e2b3c3d2964899efd68df06","sha256:fe6b1f3d730d4cc1f40318114fd3184316a875c564a2fe86ef6167c83b483e46"],"state_sha256":"ca2f355e728b9ffe3d1574f1d3f80886c4ab2f87e5516a9df8322bd98df982f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOPTIOvmg/q6/lEL5HUm8NlJN68TK9mApe7vEpv9DxvwyikFgNsi59wJ3ztC5gRsWP2fU+JpZ2FIDI5hTrxPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:41:12.052672Z","bundle_sha256":"a3bb2672a66bca3b8f627441c0c1d1495f0c9fb4de7e26b485e51d8e9bfff336"}}