{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JJ3LG2K4PBBRL2FYVTW33FHIK6","short_pith_number":"pith:JJ3LG2K4","schema_version":"1.0","canonical_sha256":"4a76b3695c784315e8b8acedbd94e8579cbaa7e9fe8e9a9943a9e43f6b4e4e66","source":{"kind":"arxiv","id":"1408.6824","version":2},"attestation_state":"computed","paper":{"title":"Universal Source Polarization and an Application to a Multi-User Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2014-08-28T19:45:58Z","abstract_excerpt":"We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel."},"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":"1408.6824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-28T19:45:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"97b6ab8e34898bc6dbae95715ad259ef21298b7c2c316370a3a8237cdbe6cfd7","abstract_canon_sha256":"bdbbc00b1c2ebe37e9735070697f48d10b602cb4d3a6f651ce53f9e6a64832fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:41.045860Z","signature_b64":"3kKyLVrsxSeVmY4gu7APErBUaAeUFv4tKZlYYGgTSwPu7UGKeXUM7k521nxQl0huWB9FJJPj53wH3AvTm/jODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a76b3695c784315e8b8acedbd94e8579cbaa7e9fe8e9a9943a9e43f6b4e4e66","last_reissued_at":"2026-05-18T02:41:41.045103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:41.045103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Source Polarization and an Application to a Multi-User Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2014-08-28T19:45:58Z","abstract_excerpt":"We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6824","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":"1408.6824","created_at":"2026-05-18T02:41:41.045230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6824v2","created_at":"2026-05-18T02:41:41.045230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6824","created_at":"2026-05-18T02:41:41.045230+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJ3LG2K4PBBR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJ3LG2K4PBBRL2FY","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJ3LG2K4","created_at":"2026-05-18T12:28:33.132498+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/JJ3LG2K4PBBRL2FYVTW33FHIK6","json":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6.json","graph_json":"https://pith.science/api/pith-number/JJ3LG2K4PBBRL2FYVTW33FHIK6/graph.json","events_json":"https://pith.science/api/pith-number/JJ3LG2K4PBBRL2FYVTW33FHIK6/events.json","paper":"https://pith.science/paper/JJ3LG2K4"},"agent_actions":{"view_html":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6","download_json":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6.json","view_paper":"https://pith.science/paper/JJ3LG2K4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6824&json=true","fetch_graph":"https://pith.science/api/pith-number/JJ3LG2K4PBBRL2FYVTW33FHIK6/graph.json","fetch_events":"https://pith.science/api/pith-number/JJ3LG2K4PBBRL2FYVTW33FHIK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6/action/storage_attestation","attest_author":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6/action/author_attestation","sign_citation":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6/action/citation_signature","submit_replication":"https://pith.science/pith/JJ3LG2K4PBBRL2FYVTW33FHIK6/action/replication_record"}},"created_at":"2026-05-18T02:41:41.045230+00:00","updated_at":"2026-05-18T02:41:41.045230+00:00"}