{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EBB5M4GJWJ6WMTLUIHJ5TQL73O","short_pith_number":"pith:EBB5M4GJ","canonical_record":{"source":{"id":"2001.11442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-30T16:42:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c8373df067eb74daae0b7d47f1eea1db6404d2811ba93ccc5ee0fbffc6718c7","abstract_canon_sha256":"44145d330fe42db3c62ff2e148d13902a7901233fb6c62b358b2de2a9eb85c8d"},"schema_version":"1.0"},"canonical_sha256":"2043d670c9b27d664d7441d3d9c17fdbae600b5f0feffeba56b7f4209342cde2","source":{"kind":"arxiv","id":"2001.11442","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11442","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11442v3","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11442","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"EBB5M4GJWJ6W","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"EBB5M4GJWJ6WMTLU","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"EBB5M4GJ","created_at":"2026-07-05T01:37:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EBB5M4GJWJ6WMTLUIHJ5TQL73O","target":"record","payload":{"canonical_record":{"source":{"id":"2001.11442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-30T16:42:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c8373df067eb74daae0b7d47f1eea1db6404d2811ba93ccc5ee0fbffc6718c7","abstract_canon_sha256":"44145d330fe42db3c62ff2e148d13902a7901233fb6c62b358b2de2a9eb85c8d"},"schema_version":"1.0"},"canonical_sha256":"2043d670c9b27d664d7441d3d9c17fdbae600b5f0feffeba56b7f4209342cde2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:33.935910Z","signature_b64":"G84clDcJRYr2ZTviGC8zKE/LSyR1a8f5N+oPIIEq8w21q0bikJZb6jKpexI9OhhoyPGs/o/Ne/3nUHZ+BhLEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2043d670c9b27d664d7441d3d9c17fdbae600b5f0feffeba56b7f4209342cde2","last_reissued_at":"2026-07-05T01:37:33.935487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:33.935487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.11442","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-07-05T01:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0u22KhOpgBP3MLZWUBFmeAHEoCFxUf12jSY6iBugc0KrSH24KVXy7tdTTGn8lkijKaAnsZM5dmuQ7xylj1NQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:19:50.938488Z"},"content_sha256":"3bf4a485f65db27dfc38383e7bbcd49493fbd73c598680239eacdd0866ba1c83","schema_version":"1.0","event_id":"sha256:3bf4a485f65db27dfc38383e7bbcd49493fbd73c598680239eacdd0866ba1c83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EBB5M4GJWJ6WMTLUIHJ5TQL73O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computability of the Zero-Error capacity with Kolmogorov Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche","submitted_at":"2020-01-30T16:42:55Z","abstract_excerpt":"The zero-error capacity of a discrete classical channel was first defined by Shannon as the least upper bound of rates for which one transmits information with zero probability of error. The problem of finding the zero-error capacity $C_0$, which assigns a capacity to each channel as a function, was reformulated in terms of graph theory as a function $\\Theta$, which assigns a value to each simple graph. This paper studies the computability of the zero-error capacity. For the computability, the concept of a Turing machine and a Kolmogorov oracle is used. It is unknown if the zero-error capacity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11442","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.11442/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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/U37z1zqebyb1yVDL5Zk8jtybfPi6kPKKkF+g6cLsvBnjH3VKuNu72N2SNDLj8EjhNUd78BYzn8i8YEHWNsODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:19:50.938965Z"},"content_sha256":"0b9d3160865d837f97b89ffb2194e96381e8bec0d7724cf721c340443cec1df5","schema_version":"1.0","event_id":"sha256:0b9d3160865d837f97b89ffb2194e96381e8bec0d7724cf721c340443cec1df5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/bundle.json","state_url":"https://pith.science/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/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-07T01:19:50Z","links":{"resolver":"https://pith.science/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O","bundle":"https://pith.science/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/bundle.json","state":"https://pith.science/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBB5M4GJWJ6WMTLUIHJ5TQL73O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EBB5M4GJWJ6WMTLUIHJ5TQL73O","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":"44145d330fe42db3c62ff2e148d13902a7901233fb6c62b358b2de2a9eb85c8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-30T16:42:55Z","title_canon_sha256":"6c8373df067eb74daae0b7d47f1eea1db6404d2811ba93ccc5ee0fbffc6718c7"},"schema_version":"1.0","source":{"id":"2001.11442","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11442","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11442v3","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11442","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"EBB5M4GJWJ6W","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"EBB5M4GJWJ6WMTLU","created_at":"2026-07-05T01:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"EBB5M4GJ","created_at":"2026-07-05T01:37:33Z"}],"graph_snapshots":[{"event_id":"sha256:0b9d3160865d837f97b89ffb2194e96381e8bec0d7724cf721c340443cec1df5","target":"graph","created_at":"2026-07-05T01:37:33Z","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/2001.11442/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The zero-error capacity of a discrete classical channel was first defined by Shannon as the least upper bound of rates for which one transmits information with zero probability of error. The problem of finding the zero-error capacity $C_0$, which assigns a capacity to each channel as a function, was reformulated in terms of graph theory as a function $\\Theta$, which assigns a value to each simple graph. This paper studies the computability of the zero-error capacity. For the computability, the concept of a Turing machine and a Kolmogorov oracle is used. It is unknown if the zero-error capacity","authors_text":"Christian Deppe, Holger Boche","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-30T16:42:55Z","title":"Computability of the Zero-Error capacity with Kolmogorov Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11442","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:3bf4a485f65db27dfc38383e7bbcd49493fbd73c598680239eacdd0866ba1c83","target":"record","created_at":"2026-07-05T01:37:33Z","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":"44145d330fe42db3c62ff2e148d13902a7901233fb6c62b358b2de2a9eb85c8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-30T16:42:55Z","title_canon_sha256":"6c8373df067eb74daae0b7d47f1eea1db6404d2811ba93ccc5ee0fbffc6718c7"},"schema_version":"1.0","source":{"id":"2001.11442","kind":"arxiv","version":3}},"canonical_sha256":"2043d670c9b27d664d7441d3d9c17fdbae600b5f0feffeba56b7f4209342cde2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2043d670c9b27d664d7441d3d9c17fdbae600b5f0feffeba56b7f4209342cde2","first_computed_at":"2026-07-05T01:37:33.935487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:33.935487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G84clDcJRYr2ZTviGC8zKE/LSyR1a8f5N+oPIIEq8w21q0bikJZb6jKpexI9OhhoyPGs/o/Ne/3nUHZ+BhLEBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:33.935910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.11442","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf4a485f65db27dfc38383e7bbcd49493fbd73c598680239eacdd0866ba1c83","sha256:0b9d3160865d837f97b89ffb2194e96381e8bec0d7724cf721c340443cec1df5"],"state_sha256":"0e6871b005f5b5d691b1a7fa2a9ce5fa53f538007d9e50ececa5e3e16daf5fe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZtptRQVN/fU8gwAlCd6TTsQVUrmmDozBC9mQ8+WGWCQnij6vWGczpsjvcS6jqSJKzhVvfi5IFtX5fHnTzm4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:19:50.942516Z","bundle_sha256":"fbe6a8c173c58a030217bc3d4dece64a4a77dc3d2799c1c771fff7e28e255656"}}