{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AOWPIA2RWUVVUSHQ22UKLQZZHB","short_pith_number":"pith:AOWPIA2R","canonical_record":{"source":{"id":"1401.4575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-18T18:16:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2770b5ba1ab513d73575646596e257003275d5892efc793b4f0851f3c47ff217","abstract_canon_sha256":"ebbfb7b7534adcf67613faf7aa3379bb59a3ab6a73d4b4823e2a30efa24feb49"},"schema_version":"1.0"},"canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","source":{"kind":"arxiv","id":"1401.4575","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4575","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4575v2","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4575","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"AOWPIA2RWUVV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOWPIA2RWUVVUSHQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOWPIA2R","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AOWPIA2RWUVVUSHQ22UKLQZZHB","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-18T18:16:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2770b5ba1ab513d73575646596e257003275d5892efc793b4f0851f3c47ff217","abstract_canon_sha256":"ebbfb7b7534adcf67613faf7aa3379bb59a3ab6a73d4b4823e2a30efa24feb49"},"schema_version":"1.0"},"canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:00.204859Z","signature_b64":"gYO/FvT9knO+pFyh1VMzGCtGXhuJKQ9qdkdjFdj7KZjnDDcQ1nPRiy6FTxd+Qf1SsI9hnkHlcaXS0VcQHMQVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","last_reissued_at":"2026-05-18T03:00:00.203987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:00.203987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4575","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-18T03:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efgNBlRaJfZ4Qr5/1sFmG9VIrZD5ZWNbTVVmuEDP/Fkrgk0KLVlps5bSS3Q8KhsmeOXJtdO+i2i5sDvhyecxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:47:51.769069Z"},"content_sha256":"12862ee997cbd411fdd3c3c30a9a775907b68ef87310a0937d25eeb94317f54b","schema_version":"1.0","event_id":"sha256:12862ee997cbd411fdd3c3c30a9a775907b68ef87310a0937d25eeb94317f54b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AOWPIA2RWUVVUSHQ22UKLQZZHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Various Views on the Trapdoor Channel and an Upper Bound on its Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tobias Lutz","submitted_at":"2014-01-18T18:16:19Z","abstract_excerpt":"Two novel views are presented on the trapdoor channel. First, by deriving the underlying iterated function system (IFS), it is shown that the trapdoor channel with input blocks of length $n$ can be regarded as the $n$th element of a sequence of shapes approximating a fractal. Second, an algorithm is presented that fully characterizes the trapdoor channel and resembles the recursion of generating all permutations of a given string. Subsequently, the problem of maximizing a $n$-letter mutual information is considered. It is shown that $\\frac{1}{2}\\log_2\\left(\\frac{5}{2}\\right)\\approx 0.6610$ bit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4575","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-18T03:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6teOT7hGK0AwSpqSrZ+VDRtPxIsFP3IxXxlMbVpjePi247r/IqnNSt/VcrFTTA7XdzKsjoBD81JAd+/e5TkFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:47:51.769457Z"},"content_sha256":"2238379468d2e41663f0f25e90b248cab1de6e40be8721c3ac9f986bff1e7900","schema_version":"1.0","event_id":"sha256:2238379468d2e41663f0f25e90b248cab1de6e40be8721c3ac9f986bff1e7900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/bundle.json","state_url":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/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-02T19:47:51Z","links":{"resolver":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB","bundle":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/bundle.json","state":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AOWPIA2RWUVVUSHQ22UKLQZZHB","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":"ebbfb7b7534adcf67613faf7aa3379bb59a3ab6a73d4b4823e2a30efa24feb49","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-18T18:16:19Z","title_canon_sha256":"2770b5ba1ab513d73575646596e257003275d5892efc793b4f0851f3c47ff217"},"schema_version":"1.0","source":{"id":"1401.4575","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4575","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4575v2","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4575","created_at":"2026-05-18T03:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"AOWPIA2RWUVV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOWPIA2RWUVVUSHQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOWPIA2R","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:2238379468d2e41663f0f25e90b248cab1de6e40be8721c3ac9f986bff1e7900","target":"graph","created_at":"2026-05-18T03:00:00Z","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":"Two novel views are presented on the trapdoor channel. First, by deriving the underlying iterated function system (IFS), it is shown that the trapdoor channel with input blocks of length $n$ can be regarded as the $n$th element of a sequence of shapes approximating a fractal. Second, an algorithm is presented that fully characterizes the trapdoor channel and resembles the recursion of generating all permutations of a given string. Subsequently, the problem of maximizing a $n$-letter mutual information is considered. It is shown that $\\frac{1}{2}\\log_2\\left(\\frac{5}{2}\\right)\\approx 0.6610$ bit","authors_text":"Tobias Lutz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-18T18:16:19Z","title":"Various Views on the Trapdoor Channel and an Upper Bound on its Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4575","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:12862ee997cbd411fdd3c3c30a9a775907b68ef87310a0937d25eeb94317f54b","target":"record","created_at":"2026-05-18T03:00:00Z","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":"ebbfb7b7534adcf67613faf7aa3379bb59a3ab6a73d4b4823e2a30efa24feb49","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-18T18:16:19Z","title_canon_sha256":"2770b5ba1ab513d73575646596e257003275d5892efc793b4f0851f3c47ff217"},"schema_version":"1.0","source":{"id":"1401.4575","kind":"arxiv","version":2}},"canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","first_computed_at":"2026-05-18T03:00:00.203987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:00.203987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYO/FvT9knO+pFyh1VMzGCtGXhuJKQ9qdkdjFdj7KZjnDDcQ1nPRiy6FTxd+Qf1SsI9hnkHlcaXS0VcQHMQVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:00.204859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4575","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12862ee997cbd411fdd3c3c30a9a775907b68ef87310a0937d25eeb94317f54b","sha256:2238379468d2e41663f0f25e90b248cab1de6e40be8721c3ac9f986bff1e7900"],"state_sha256":"e3f26a111e073baad5d27ba5ff8d8f93493a6681b638fdd6bcaa5b39e9c794c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyJNs1LwLwGaxNn7XBlRKQBW0hR5fsIZwThkSr0pjUWwlJsw/u5GHeKc/94LRtWxRTc3OA1P3BfxedERzWd4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:47:51.771667Z","bundle_sha256":"aafa9a0b578249d8796a775468c900e2bc87a04fee9c4e1e40562a581f434101"}}