{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UETH7B3NSQWB53EYGQURKI23K2","short_pith_number":"pith:UETH7B3N","schema_version":"1.0","canonical_sha256":"a1267f876d942c1eec98342915235b568240259e147b3b2ffb9e690c753632fe","source":{"kind":"arxiv","id":"1705.02247","version":1},"attestation_state":"computed","paper":{"title":"Distributed Task Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amos Lapidoth, Annina Bracher, Christoph Pfister","submitted_at":"2017-05-05T15:05:39Z","abstract_excerpt":"The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the $\\rho$-th moment of the list size, which is derived using the relative $\\alpha$-entropy."},"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":"1705.02247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T15:05:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4ab46b5cb55c95da3b9170e1166fe6bbfdac66a75f2bc95017664b5e2f6812e","abstract_canon_sha256":"9a3fdb79aac13a010b25d6b560137571780c502c23bc1d3898bd8e1bb6635479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.321127Z","signature_b64":"OXioIW0ZbV+3OLAbu24DSVCrcQwlWhiDMTQMOVb6T1cZ8ZbqjCDJkDYyqyPX2qX0476TkTJpy02r0nlEQ0bUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1267f876d942c1eec98342915235b568240259e147b3b2ffb9e690c753632fe","last_reissued_at":"2026-05-18T00:45:00.320736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.320736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Task Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amos Lapidoth, Annina Bracher, Christoph Pfister","submitted_at":"2017-05-05T15:05:39Z","abstract_excerpt":"The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the $\\rho$-th moment of the list size, which is derived using the relative $\\alpha$-entropy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02247","kind":"arxiv","version":1},"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":"1705.02247","created_at":"2026-05-18T00:45:00.320797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02247v1","created_at":"2026-05-18T00:45:00.320797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02247","created_at":"2026-05-18T00:45:00.320797+00:00"},{"alias_kind":"pith_short_12","alias_value":"UETH7B3NSQWB","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UETH7B3NSQWB53EY","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UETH7B3N","created_at":"2026-05-18T12:31:46.661854+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/UETH7B3NSQWB53EYGQURKI23K2","json":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2.json","graph_json":"https://pith.science/api/pith-number/UETH7B3NSQWB53EYGQURKI23K2/graph.json","events_json":"https://pith.science/api/pith-number/UETH7B3NSQWB53EYGQURKI23K2/events.json","paper":"https://pith.science/paper/UETH7B3N"},"agent_actions":{"view_html":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2","download_json":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2.json","view_paper":"https://pith.science/paper/UETH7B3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02247&json=true","fetch_graph":"https://pith.science/api/pith-number/UETH7B3NSQWB53EYGQURKI23K2/graph.json","fetch_events":"https://pith.science/api/pith-number/UETH7B3NSQWB53EYGQURKI23K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2/action/storage_attestation","attest_author":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2/action/author_attestation","sign_citation":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2/action/citation_signature","submit_replication":"https://pith.science/pith/UETH7B3NSQWB53EYGQURKI23K2/action/replication_record"}},"created_at":"2026-05-18T00:45:00.320797+00:00","updated_at":"2026-05-18T00:45:00.320797+00:00"}