{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3UF5DJIHLNOXPEVSUAX7BLSS7N","short_pith_number":"pith:3UF5DJIH","schema_version":"1.0","canonical_sha256":"dd0bd1a5075b5d7792b2a02ff0ae52fb51872611ff774e9bc7f541f4feadc42b","source":{"kind":"arxiv","id":"2406.10036","version":1},"attestation_state":"computed","paper":{"title":"Information Compression in the AI Era: Recent Advances and Future Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Ayfer Ozgur, Chao Tian, Jun Chen, Nir Shlezinger, Yong Fang","submitted_at":"2024-06-14T13:43:59Z","abstract_excerpt":"This survey articles focuses on emerging connections between the fields of machine learning and data compression. While fundamental limits of classical (lossy) data compression are established using rate-distortion theory, the connections to machine learning have resulted in new theoretical analysis and application areas. We survey recent works on task-based and goal-oriented compression, the rate-distortion-perception theory and compression for estimation and inference. Deep learning based approaches also provide natural data-driven algorithmic approaches to compression. We survey recent work"},"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":"2406.10036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-14T13:43:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8dbfe8ba496c76935f8c2c7fb3530de2e32cbfb982f6ef84bd4f42bbbffe5f8e","abstract_canon_sha256":"0e0bda7b6597051a91d91dd76211fecf7766c7c38e31518c36a4b90dfd474d83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:03.606119Z","signature_b64":"DPnSoPrfXTzXgmG9AvOVZ1c237Rrb8yGDIaP4z4T+N/jFixiKtqCPBrtsFFpf19mA6y8BkCFwQzP4A/gI+WTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd0bd1a5075b5d7792b2a02ff0ae52fb51872611ff774e9bc7f541f4feadc42b","last_reissued_at":"2026-07-05T08:32:03.605635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:03.605635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Compression in the AI Era: Recent Advances and Future Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Ayfer Ozgur, Chao Tian, Jun Chen, Nir Shlezinger, Yong Fang","submitted_at":"2024-06-14T13:43:59Z","abstract_excerpt":"This survey articles focuses on emerging connections between the fields of machine learning and data compression. While fundamental limits of classical (lossy) data compression are established using rate-distortion theory, the connections to machine learning have resulted in new theoretical analysis and application areas. We survey recent works on task-based and goal-oriented compression, the rate-distortion-perception theory and compression for estimation and inference. Deep learning based approaches also provide natural data-driven algorithmic approaches to compression. We survey recent work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10036","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/2406.10036/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":"2406.10036","created_at":"2026-07-05T08:32:03.605688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10036v1","created_at":"2026-07-05T08:32:03.605688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10036","created_at":"2026-07-05T08:32:03.605688+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UF5DJIHLNOX","created_at":"2026-07-05T08:32:03.605688+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UF5DJIHLNOXPEVS","created_at":"2026-07-05T08:32:03.605688+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UF5DJIH","created_at":"2026-07-05T08:32:03.605688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07016","citing_title":"Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N","json":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N.json","graph_json":"https://pith.science/api/pith-number/3UF5DJIHLNOXPEVSUAX7BLSS7N/graph.json","events_json":"https://pith.science/api/pith-number/3UF5DJIHLNOXPEVSUAX7BLSS7N/events.json","paper":"https://pith.science/paper/3UF5DJIH"},"agent_actions":{"view_html":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N","download_json":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N.json","view_paper":"https://pith.science/paper/3UF5DJIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10036&json=true","fetch_graph":"https://pith.science/api/pith-number/3UF5DJIHLNOXPEVSUAX7BLSS7N/graph.json","fetch_events":"https://pith.science/api/pith-number/3UF5DJIHLNOXPEVSUAX7BLSS7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N/action/storage_attestation","attest_author":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N/action/author_attestation","sign_citation":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N/action/citation_signature","submit_replication":"https://pith.science/pith/3UF5DJIHLNOXPEVSUAX7BLSS7N/action/replication_record"}},"created_at":"2026-07-05T08:32:03.605688+00:00","updated_at":"2026-07-05T08:32:03.605688+00:00"}