{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4ZJOCW6HRVWIUXBYXEB2Y4WR2Y","short_pith_number":"pith:4ZJOCW6H","canonical_record":{"source":{"id":"1401.6338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T13:53:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03f429663461da4af1c316b968aaa2e3b1f854fa1bf1bc7a83a867a4eb5469f5","abstract_canon_sha256":"e89bd3f534d10f29f9fe8e70153b703f713c253457bb28e53cc425fe2d2911fc"},"schema_version":"1.0"},"canonical_sha256":"e652e15bc78d6c8a5c38b903ac72d1d63734e8beeea220a056fd8400bacc8942","source":{"kind":"arxiv","id":"1401.6338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6338","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6338v2","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6338","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"4ZJOCW6HRVWI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4ZJOCW6HRVWIUXBY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4ZJOCW6H","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4ZJOCW6HRVWIUXBYXEB2Y4WR2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T13:53:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03f429663461da4af1c316b968aaa2e3b1f854fa1bf1bc7a83a867a4eb5469f5","abstract_canon_sha256":"e89bd3f534d10f29f9fe8e70153b703f713c253457bb28e53cc425fe2d2911fc"},"schema_version":"1.0"},"canonical_sha256":"e652e15bc78d6c8a5c38b903ac72d1d63734e8beeea220a056fd8400bacc8942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:08.709100Z","signature_b64":"BUP7Vm8CGffCxZ8hrqbkXIJxcA7AibaDTpysDPiZ2lHbvsdMLhlJGvk+qPmTCEfaUt5OwYlV4dCTomc+hd63CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e652e15bc78d6c8a5c38b903ac72d1d63734e8beeea220a056fd8400bacc8942","last_reissued_at":"2026-05-18T02:41:08.708686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:08.708686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6338","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":"RCh+F/qzfx9OxSZ2FPwaK7ibvYufq8hnZ13RQgM/t6e3Ci1tgK4vONTKdw/bpFd4ebo4C2mLhRKWPxNFWLTcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:47.795133Z"},"content_sha256":"bf9313651204fda2b85795fdb4ce10a076ecd08bc8a4646085ffb19d015f0a10","schema_version":"1.0","event_id":"sha256:bf9313651204fda2b85795fdb4ce10a076ecd08bc8a4646085ffb19d015f0a10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4ZJOCW6HRVWIUXBYXEB2Y4WR2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encoding Tasks and R\\'enyi Entropy","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":"2014-01-24T13:53:57Z","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 case where a sequence of tasks is produced by a source and $n$ tasks are jointly described using $nR$ bits is considered. If $R$ is larger than the R\\'enyi entropy rate of the source of order $1/(1+\\rho)$ (provided it exists), then the $\\rho$-th moment of the ratio of performed tasks to $n$ can be driven to one as $n$ tends to infinit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6338","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":"5ARs4UyDLrC4eTwxfHOzH9KlnaDzfgtCM2vNzfzL3Wu1P1xPD/RfZjyup7vhTH0hateVQAjwO4sNCZ9S+YuDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:47.795827Z"},"content_sha256":"3ae66f2917afb4378f51255fced2c173a9c3b742db1766085fcd3ff5c196d655","schema_version":"1.0","event_id":"sha256:3ae66f2917afb4378f51255fced2c173a9c3b742db1766085fcd3ff5c196d655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/bundle.json","state_url":"https://pith.science/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/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-25T15:08:47Z","links":{"resolver":"https://pith.science/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y","bundle":"https://pith.science/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/bundle.json","state":"https://pith.science/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZJOCW6HRVWIUXBYXEB2Y4WR2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4ZJOCW6HRVWIUXBYXEB2Y4WR2Y","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":"e89bd3f534d10f29f9fe8e70153b703f713c253457bb28e53cc425fe2d2911fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T13:53:57Z","title_canon_sha256":"03f429663461da4af1c316b968aaa2e3b1f854fa1bf1bc7a83a867a4eb5469f5"},"schema_version":"1.0","source":{"id":"1401.6338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6338","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6338v2","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6338","created_at":"2026-05-18T02:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"4ZJOCW6HRVWI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4ZJOCW6HRVWIUXBY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4ZJOCW6H","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:3ae66f2917afb4378f51255fced2c173a9c3b742db1766085fcd3ff5c196d655","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 case where a sequence of tasks is produced by a source and $n$ tasks are jointly described using $nR$ bits is considered. If $R$ is larger than the R\\'enyi entropy rate of the source of order $1/(1+\\rho)$ (provided it exists), then the $\\rho$-th moment of the ratio of performed tasks to $n$ can be driven to one as $n$ tends to infinit","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":"2014-01-24T13:53:57Z","title":"Encoding Tasks and R\\'enyi Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6338","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:bf9313651204fda2b85795fdb4ce10a076ecd08bc8a4646085ffb19d015f0a10","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":"e89bd3f534d10f29f9fe8e70153b703f713c253457bb28e53cc425fe2d2911fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T13:53:57Z","title_canon_sha256":"03f429663461da4af1c316b968aaa2e3b1f854fa1bf1bc7a83a867a4eb5469f5"},"schema_version":"1.0","source":{"id":"1401.6338","kind":"arxiv","version":2}},"canonical_sha256":"e652e15bc78d6c8a5c38b903ac72d1d63734e8beeea220a056fd8400bacc8942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e652e15bc78d6c8a5c38b903ac72d1d63734e8beeea220a056fd8400bacc8942","first_computed_at":"2026-05-18T02:41:08.708686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:08.708686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BUP7Vm8CGffCxZ8hrqbkXIJxcA7AibaDTpysDPiZ2lHbvsdMLhlJGvk+qPmTCEfaUt5OwYlV4dCTomc+hd63CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:08.709100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf9313651204fda2b85795fdb4ce10a076ecd08bc8a4646085ffb19d015f0a10","sha256:3ae66f2917afb4378f51255fced2c173a9c3b742db1766085fcd3ff5c196d655"],"state_sha256":"a3911c542f01db63c5b144645736c2eb3c30c61f89dc017be54574cc71526bff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+Mv1njp9vJvrUbx8erCFZrYHQcWRL/ney0Erk1vEIGen5r6fKJIdstfyzgvHqmv1QnEoJaCvSRHnw5WPzdvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:08:47.799417Z","bundle_sha256":"adbee8582fcf88836de18d64bdc0c1506d9fff8a4228954468f10d35245aa424"}}