{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AOWPIA2RWUVVUSHQ22UKLQZZHB","short_pith_number":"pith:AOWPIA2R","schema_version":"1.0","canonical_sha256":"03acf40351b52b5a48f0d6a8a5c3393843dc6d3c4b7fc4b21a47852207050f0d","source":{"kind":"arxiv","id":"1401.4575","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.4575","created_at":"2026-05-18T03:00:00.204127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4575v2","created_at":"2026-05-18T03:00:00.204127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4575","created_at":"2026-05-18T03:00:00.204127+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOWPIA2RWUVV","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOWPIA2RWUVVUSHQ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOWPIA2R","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB","json":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB.json","graph_json":"https://pith.science/api/pith-number/AOWPIA2RWUVVUSHQ22UKLQZZHB/graph.json","events_json":"https://pith.science/api/pith-number/AOWPIA2RWUVVUSHQ22UKLQZZHB/events.json","paper":"https://pith.science/paper/AOWPIA2R"},"agent_actions":{"view_html":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB","download_json":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB.json","view_paper":"https://pith.science/paper/AOWPIA2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4575&json=true","fetch_graph":"https://pith.science/api/pith-number/AOWPIA2RWUVVUSHQ22UKLQZZHB/graph.json","fetch_events":"https://pith.science/api/pith-number/AOWPIA2RWUVVUSHQ22UKLQZZHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/action/storage_attestation","attest_author":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/action/author_attestation","sign_citation":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/action/citation_signature","submit_replication":"https://pith.science/pith/AOWPIA2RWUVVUSHQ22UKLQZZHB/action/replication_record"}},"created_at":"2026-05-18T03:00:00.204127+00:00","updated_at":"2026-05-18T03:00:00.204127+00:00"}