{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RDZYLF4YEU6GG7VGCDQXC6F3UC","short_pith_number":"pith:RDZYLF4Y","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"},"canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","source":{"kind":"arxiv","id":"1312.3735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3735","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3735v2","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3735","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"RDZYLF4YEU6G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDZYLF4YEU6GG7VG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDZYLF4Y","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RDZYLF4YEU6GG7VGCDQXC6F3UC","target":"record","payload":{"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"},"canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","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"},"source_kind":"arxiv","source_id":"1312.3735","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-18T02:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjXjTpaEDtqUO3X3+n/sGNLIQMwcGbcOaJeMH7faQg+QKkphzwDz7fDUVI27POMpcmNI4YletrEgs5xxKsyTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:38:23.183296Z"},"content_sha256":"87bdd2c06a8b122682851bd41f52489dea3920c8015c020f413b375a3a122c83","schema_version":"1.0","event_id":"sha256:87bdd2c06a8b122682851bd41f52489dea3920c8015c020f413b375a3a122c83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RDZYLF4YEU6GG7VGCDQXC6F3UC","target":"graph","payload":{"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"},"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-18T02:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qedJ7jY15KygR1pfh7bGBQHqfKkVQrwfpvN98QDvPA8N8kqtRGCqN0Qd9JZPGxStQhJPiBmW6JIHwb7xtVk2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:38:23.184028Z"},"content_sha256":"39b0e618ec4814403115e5be116ed156d3820c3b1e7ef5a2a689397a7f7658f4","schema_version":"1.0","event_id":"sha256:39b0e618ec4814403115e5be116ed156d3820c3b1e7ef5a2a689397a7f7658f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/bundle.json","state_url":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/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-25T19:38:23Z","links":{"resolver":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC","bundle":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/bundle.json","state":"https://pith.science/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDZYLF4YEU6GG7VGCDQXC6F3UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RDZYLF4YEU6GG7VGCDQXC6F3UC","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":"feee12ef12a0788ae1b992b95872bf0a96de754a7a858fad189890d2e1581a16","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-13T09:09:01Z","title_canon_sha256":"be61858fa83dd36fa41deb723c4ef3be75511dcf83535313ed67d4c5fc89d3ce"},"schema_version":"1.0","source":{"id":"1312.3735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3735","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3735v2","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3735","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"RDZYLF4YEU6G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDZYLF4YEU6GG7VG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDZYLF4Y","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:39b0e618ec4814403115e5be116ed156d3820c3b1e7ef5a2a689397a7f7658f4","target":"graph","created_at":"2026-05-18T02:41:08Z","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":"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","authors_text":"Amos Lapidoth, Christoph Bunte","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-13T09:09:01Z","title":"Codes for Tasks and R\\'enyi Entropy Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3735","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:87bdd2c06a8b122682851bd41f52489dea3920c8015c020f413b375a3a122c83","target":"record","created_at":"2026-05-18T02:41:08Z","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":"feee12ef12a0788ae1b992b95872bf0a96de754a7a858fad189890d2e1581a16","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-13T09:09:01Z","title_canon_sha256":"be61858fa83dd36fa41deb723c4ef3be75511dcf83535313ed67d4c5fc89d3ce"},"schema_version":"1.0","source":{"id":"1312.3735","kind":"arxiv","version":2}},"canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88f3859798253c637ea610e17178bba0b2049161ce19dd1a6495602dd223dd2d","first_computed_at":"2026-05-18T02:41:08.792739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:08.792739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ysrYGIxMpEaLBB4gsM5YwmUH5AQ7sXAkh98zOGF5bUAvRMOwIElD+pGsC6srPuZdB+KpCIn7ftTWBXNzlPlmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:08.793157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87bdd2c06a8b122682851bd41f52489dea3920c8015c020f413b375a3a122c83","sha256:39b0e618ec4814403115e5be116ed156d3820c3b1e7ef5a2a689397a7f7658f4"],"state_sha256":"d8354d0a161b0d6373fb4c0fbfb4d90219f3d7574a1cb879c53ab94c9baa35fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziMLxgvX+NanYFZO0LhzLWHCPyi+vTy26iNw+cMd4wc6d+K8DMAD3X3Ln7LeO93Dh6GA+W/WkV7eOxMO3AWODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:38:23.187772Z","bundle_sha256":"eafeb3b94e022c0beec7fa4a3ed9c8b91f3a28e839b8115f6150cabbfc94ea1a"}}