{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2YL6TLGKYD6XYPFD4HWCP2EQM5","short_pith_number":"pith:2YL6TLGK","schema_version":"1.0","canonical_sha256":"d617e9accac0fd7c3ca3e1ec27e8906775a9049b9b9741fe24c0b44220d4a09b","source":{"kind":"arxiv","id":"2009.08562","version":1},"attestation_state":"computed","paper":{"title":"Bounds for Learning Lossless Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Host-Madsen","submitted_at":"2020-09-18T00:07:02Z","abstract_excerpt":"This paper asks a basic question: how much training is required to beat a universal source coder? Traditionally, there have been two types of source coders: fixed, optimum coders such as Huffman coders; and universal source coders, such as Lempel-Ziv The paper considers a third type of source coders: learned coders. These are coders that are trained on data of a particular type, and then used to encode new data of that type. This is a type of coder that has recently become very popular for (lossy) image and video coding.\n  The paper consider two criteria for performance of learned coders: the "},"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":"2009.08562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-18T00:07:02Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"3eeaec5701bc1652e57e04cc953daea90cd276d2397a1ec688b11db77d95bba1","abstract_canon_sha256":"f7f67b0d1901c35ce64ada3d90adf2628c541a93ee9c362ea150020b49822479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:19.923714Z","signature_b64":"A4zTXTW9pm+Yh0mlIhPE4nDLp1I+4j6etaks2aHV8ZcaMIxGn+K5PLwo1TU/LxhypXca8IBunuF7/nUIdik/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d617e9accac0fd7c3ca3e1ec27e8906775a9049b9b9741fe24c0b44220d4a09b","last_reissued_at":"2026-07-05T01:36:19.923378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:19.923378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for Learning Lossless Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Host-Madsen","submitted_at":"2020-09-18T00:07:02Z","abstract_excerpt":"This paper asks a basic question: how much training is required to beat a universal source coder? Traditionally, there have been two types of source coders: fixed, optimum coders such as Huffman coders; and universal source coders, such as Lempel-Ziv The paper considers a third type of source coders: learned coders. These are coders that are trained on data of a particular type, and then used to encode new data of that type. This is a type of coder that has recently become very popular for (lossy) image and video coding.\n  The paper consider two criteria for performance of learned coders: the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08562","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.08562/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.08562","created_at":"2026-07-05T01:36:19.923435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.08562v1","created_at":"2026-07-05T01:36:19.923435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08562","created_at":"2026-07-05T01:36:19.923435+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YL6TLGKYD6X","created_at":"2026-07-05T01:36:19.923435+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YL6TLGKYD6XYPFD","created_at":"2026-07-05T01:36:19.923435+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YL6TLGK","created_at":"2026-07-05T01:36:19.923435+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/2YL6TLGKYD6XYPFD4HWCP2EQM5","json":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5.json","graph_json":"https://pith.science/api/pith-number/2YL6TLGKYD6XYPFD4HWCP2EQM5/graph.json","events_json":"https://pith.science/api/pith-number/2YL6TLGKYD6XYPFD4HWCP2EQM5/events.json","paper":"https://pith.science/paper/2YL6TLGK"},"agent_actions":{"view_html":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5","download_json":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5.json","view_paper":"https://pith.science/paper/2YL6TLGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.08562&json=true","fetch_graph":"https://pith.science/api/pith-number/2YL6TLGKYD6XYPFD4HWCP2EQM5/graph.json","fetch_events":"https://pith.science/api/pith-number/2YL6TLGKYD6XYPFD4HWCP2EQM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5/action/storage_attestation","attest_author":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5/action/author_attestation","sign_citation":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5/action/citation_signature","submit_replication":"https://pith.science/pith/2YL6TLGKYD6XYPFD4HWCP2EQM5/action/replication_record"}},"created_at":"2026-07-05T01:36:19.923435+00:00","updated_at":"2026-07-05T01:36:19.923435+00:00"}