{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2YL6TLGKYD6XYPFD4HWCP2EQM5","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":"f7f67b0d1901c35ce64ada3d90adf2628c541a93ee9c362ea150020b49822479","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-18T00:07:02Z","title_canon_sha256":"3eeaec5701bc1652e57e04cc953daea90cd276d2397a1ec688b11db77d95bba1"},"schema_version":"1.0","source":{"id":"2009.08562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.08562","created_at":"2026-07-05T01:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"2009.08562v1","created_at":"2026-07-05T01:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08562","created_at":"2026-07-05T01:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"2YL6TLGKYD6X","created_at":"2026-07-05T01:36:19Z"},{"alias_kind":"pith_short_16","alias_value":"2YL6TLGKYD6XYPFD","created_at":"2026-07-05T01:36:19Z"},{"alias_kind":"pith_short_8","alias_value":"2YL6TLGK","created_at":"2026-07-05T01:36:19Z"}],"graph_snapshots":[{"event_id":"sha256:673e2dd717d095d19e02accca8975726e818bdadf75dfe703d6daac415806470","target":"graph","created_at":"2026-07-05T01:36:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.08562/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Anders Host-Madsen","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-18T00:07:02Z","title":"Bounds for Learning Lossless Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08562","kind":"arxiv","version":1},"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:eb3202fdffecbb4b67e831f7b1edca214e3ad4ada6999fc9a43d53d715ca13aa","target":"record","created_at":"2026-07-05T01:36:19Z","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":"f7f67b0d1901c35ce64ada3d90adf2628c541a93ee9c362ea150020b49822479","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-18T00:07:02Z","title_canon_sha256":"3eeaec5701bc1652e57e04cc953daea90cd276d2397a1ec688b11db77d95bba1"},"schema_version":"1.0","source":{"id":"2009.08562","kind":"arxiv","version":1}},"canonical_sha256":"d617e9accac0fd7c3ca3e1ec27e8906775a9049b9b9741fe24c0b44220d4a09b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d617e9accac0fd7c3ca3e1ec27e8906775a9049b9b9741fe24c0b44220d4a09b","first_computed_at":"2026-07-05T01:36:19.923378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:36:19.923378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A4zTXTW9pm+Yh0mlIhPE4nDLp1I+4j6etaks2aHV8ZcaMIxGn+K5PLwo1TU/LxhypXca8IBunuF7/nUIdik/Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:36:19.923714Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.08562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb3202fdffecbb4b67e831f7b1edca214e3ad4ada6999fc9a43d53d715ca13aa","sha256:673e2dd717d095d19e02accca8975726e818bdadf75dfe703d6daac415806470"],"state_sha256":"084e6b2b7db338642b55f96466475a3f1d709bb9dfdcdef404ccf75fd71a02c5"}