{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RDZYLF4YEU6GG7VGCDQXC6F3UC","short_pith_number":"pith:RDZYLF4Y","schema_version":"1.0","canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","source":{"kind":"arxiv","id":"1312.3735","version":2},"attestation_state":"computed","paper":{"title":"Codes for Tasks and R\\'enyi Entropy Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amos Lapidoth, Christoph Bunte","submitted_at":"2013-12-13T09:09:01Z","abstract_excerpt":"A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $\\rho$-th moment of the number of performed tasks are derived. The key is an analog of the Kraft Inequality for partitions of finite sets. When a sequence of tasks is produced by a source of a given R\\'enyi entropy rate of order $1/(1+\\rho)$ and $n$ tasks are jointly described using $nR$ bits, it is shown that for $R$ larger than the R\\'enyi entropy rate, the $\\rho$-th moment of the ratio of performe"},"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":"1312.3735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-13T09:09:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be61858fa83dd36fa41deb723c4ef3be75511dcf83535313ed67d4c5fc89d3ce","abstract_canon_sha256":"feee12ef12a0788ae1b992b95872bf0a96de754a7a858fad189890d2e1581a16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:08.793157Z","signature_b64":"ysrYGIxMpEaLBB4gsM5YwmUH5AQ7sXAkh98zOGF5bUAvRMOwIElD+pGsC6srPuZdB+KpCIn7ftTWBXNzlPlmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","last_reissued_at":"2026-05-18T02:41:08.792739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:08.792739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes for Tasks and R\\'enyi Entropy Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amos Lapidoth, Christoph Bunte","submitted_at":"2013-12-13T09:09:01Z","abstract_excerpt":"A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $\\rho$-th moment of the number of performed tasks are derived. The key is an analog of the Kraft Inequality for partitions of finite sets. When a sequence of tasks is produced by a source of a given R\\'enyi entropy rate of order $1/(1+\\rho)$ and $n$ tasks are jointly described using $nR$ bits, it is shown that for $R$ larger than the R\\'enyi entropy rate, the $\\rho$-th moment of the ratio of performe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3735","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":"1312.3735","created_at":"2026-05-18T02:41:08.792800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3735v2","created_at":"2026-05-18T02:41:08.792800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3735","created_at":"2026-05-18T02:41:08.792800+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDZYLF4YEU6G","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDZYLF4YEU6GG7VG","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDZYLF4Y","created_at":"2026-05-18T12:27:57.521954+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/RDZYLF4YEU6GG7VGCDQXC6F3UC","json":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC.json","graph_json":"https://pith.science/api/pith-number/RDZYLF4YEU6GG7VGCDQXC6F3UC/graph.json","events_json":"https://pith.science/api/pith-number/RDZYLF4YEU6GG7VGCDQXC6F3UC/events.json","paper":"https://pith.science/paper/RDZYLF4Y"},"agent_actions":{"view_html":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC","download_json":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC.json","view_paper":"https://pith.science/paper/RDZYLF4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3735&json=true","fetch_graph":"https://pith.science/api/pith-number/RDZYLF4YEU6GG7VGCDQXC6F3UC/graph.json","fetch_events":"https://pith.science/api/pith-number/RDZYLF4YEU6GG7VGCDQXC6F3UC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/action/storage_attestation","attest_author":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/action/author_attestation","sign_citation":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/action/citation_signature","submit_replication":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/action/replication_record"}},"created_at":"2026-05-18T02:41:08.792800+00:00","updated_at":"2026-05-18T02:41:08.792800+00:00"}