{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LQUKLY7ACEC2S4RGKQEPMKWYIK","short_pith_number":"pith:LQUKLY7A","canonical_record":{"source":{"id":"2101.08687","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-21T15:58:58Z","cross_cats_sorted":[],"title_canon_sha256":"384ed7709ec3d4ad30d36fda1e56506fd38063b62844e4f5e46471e9420e5ba9","abstract_canon_sha256":"2941388dc0b1871a3206a9124d3ca3c92039efc048ed05ca89d0408a7cd54855"},"schema_version":"1.0"},"canonical_sha256":"5c28a5e3e01105a972265408f62ad8428531be068ce936a97aa1cac33cda19e0","source":{"kind":"arxiv","id":"2101.08687","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.08687","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.08687v2","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08687","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"LQUKLY7ACEC2","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_16","alias_value":"LQUKLY7ACEC2S4RG","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_8","alias_value":"LQUKLY7A","created_at":"2026-07-05T02:44:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LQUKLY7ACEC2S4RGKQEPMKWYIK","target":"record","payload":{"canonical_record":{"source":{"id":"2101.08687","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-21T15:58:58Z","cross_cats_sorted":[],"title_canon_sha256":"384ed7709ec3d4ad30d36fda1e56506fd38063b62844e4f5e46471e9420e5ba9","abstract_canon_sha256":"2941388dc0b1871a3206a9124d3ca3c92039efc048ed05ca89d0408a7cd54855"},"schema_version":"1.0"},"canonical_sha256":"5c28a5e3e01105a972265408f62ad8428531be068ce936a97aa1cac33cda19e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:53.907418Z","signature_b64":"tEURkoNJRHYHZI63RPL7yt9GrlSeAhqNe8TgVB07WLzHc0AUvVYRPsolf5mXtKH7DD92Ab7RaWxiy/wPiaWaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c28a5e3e01105a972265408f62ad8428531be068ce936a97aa1cac33cda19e0","last_reissued_at":"2026-07-05T02:44:53.906918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:53.906918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.08687","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-07-05T02:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yH8x21rosVwMV3HEbtLzrCoKVdl9pDgpVOaVOspWZwLsG75I9R1vYfVlSkIIPRW6sGKlcbAES86hpu36tthvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:44:32.854109Z"},"content_sha256":"94c8605fcac145214296c6deae72ccabeb23cde70fa3abfec5b2279c2d8ba052","schema_version":"1.0","event_id":"sha256:94c8605fcac145214296c6deae72ccabeb23cde70fa3abfec5b2279c2d8ba052"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LQUKLY7ACEC2S4RGKQEPMKWYIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overfitting for Fun and Profit: Instance-Adaptive Data Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Iris A.M. Huijben, Taco S. Cohen, Ties van Rozendaal","submitted_at":"2021-01-21T15:58:58Z","abstract_excerpt":"Neural data compression has been shown to outperform classical methods in terms of $RD$ performance, with results still improving rapidly. At a high level, neural compression is based on an autoencoder that tries to reconstruct the input instance from a (quantized) latent representation, coupled with a prior that is used to losslessly compress these latents. Due to limitations on model capacity and imperfect optimization and generalization, such models will suboptimally compress test data in general. However, one of the great strengths of learned compression is that if the test-time data distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08687","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.08687/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"},"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-07-05T02:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqexmksRP0rS/Nu9TSTb/sPPAzbbzGqNBpJZHtEWE6dOWMjwQJALqQ/AyV1/CFfIQnm3xsjLtlOZwg7buJqEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:44:32.855094Z"},"content_sha256":"5a8b339d7ee6540b60fbbe12a40a5b41fc6e69d12f964439b28dcd2e7c14c018","schema_version":"1.0","event_id":"sha256:5a8b339d7ee6540b60fbbe12a40a5b41fc6e69d12f964439b28dcd2e7c14c018"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/bundle.json","state_url":"https://pith.science/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/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-08-14T15:44:32Z","links":{"resolver":"https://pith.science/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK","bundle":"https://pith.science/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/bundle.json","state":"https://pith.science/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQUKLY7ACEC2S4RGKQEPMKWYIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LQUKLY7ACEC2S4RGKQEPMKWYIK","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":"2941388dc0b1871a3206a9124d3ca3c92039efc048ed05ca89d0408a7cd54855","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-21T15:58:58Z","title_canon_sha256":"384ed7709ec3d4ad30d36fda1e56506fd38063b62844e4f5e46471e9420e5ba9"},"schema_version":"1.0","source":{"id":"2101.08687","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.08687","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.08687v2","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08687","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"LQUKLY7ACEC2","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_16","alias_value":"LQUKLY7ACEC2S4RG","created_at":"2026-07-05T02:44:53Z"},{"alias_kind":"pith_short_8","alias_value":"LQUKLY7A","created_at":"2026-07-05T02:44:53Z"}],"graph_snapshots":[{"event_id":"sha256:5a8b339d7ee6540b60fbbe12a40a5b41fc6e69d12f964439b28dcd2e7c14c018","target":"graph","created_at":"2026-07-05T02:44:53Z","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/2101.08687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural data compression has been shown to outperform classical methods in terms of $RD$ performance, with results still improving rapidly. At a high level, neural compression is based on an autoencoder that tries to reconstruct the input instance from a (quantized) latent representation, coupled with a prior that is used to losslessly compress these latents. Due to limitations on model capacity and imperfect optimization and generalization, such models will suboptimally compress test data in general. However, one of the great strengths of learned compression is that if the test-time data distr","authors_text":"Iris A.M. Huijben, Taco S. Cohen, Ties van Rozendaal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-21T15:58:58Z","title":"Overfitting for Fun and Profit: Instance-Adaptive Data Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08687","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:94c8605fcac145214296c6deae72ccabeb23cde70fa3abfec5b2279c2d8ba052","target":"record","created_at":"2026-07-05T02:44:53Z","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":"2941388dc0b1871a3206a9124d3ca3c92039efc048ed05ca89d0408a7cd54855","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-21T15:58:58Z","title_canon_sha256":"384ed7709ec3d4ad30d36fda1e56506fd38063b62844e4f5e46471e9420e5ba9"},"schema_version":"1.0","source":{"id":"2101.08687","kind":"arxiv","version":2}},"canonical_sha256":"5c28a5e3e01105a972265408f62ad8428531be068ce936a97aa1cac33cda19e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c28a5e3e01105a972265408f62ad8428531be068ce936a97aa1cac33cda19e0","first_computed_at":"2026-07-05T02:44:53.906918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:44:53.906918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tEURkoNJRHYHZI63RPL7yt9GrlSeAhqNe8TgVB07WLzHc0AUvVYRPsolf5mXtKH7DD92Ab7RaWxiy/wPiaWaCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:44:53.907418Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.08687","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94c8605fcac145214296c6deae72ccabeb23cde70fa3abfec5b2279c2d8ba052","sha256:5a8b339d7ee6540b60fbbe12a40a5b41fc6e69d12f964439b28dcd2e7c14c018"],"state_sha256":"cec3b76c93f1599514c010ec5a3848c4197a08bde0f5da98742e5d0579182e33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIdoqoDrs1fGgSSa5AkMaqDrZgrcIaHn9K0jgH0ebjj5lkN7qOK/CvoXTtwRnPJTUJEwEcLArkLu6ihRTKCwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:44:32.861606Z","bundle_sha256":"db5fc0f6d48ced5a1ffab773f65807d2ece28cfbfbbb55df35665d80184c338b"}}