{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EAE5HWSHXQYI35OAJDT4BC7R5L","short_pith_number":"pith:EAE5HWSH","schema_version":"1.0","canonical_sha256":"2009d3da47bc308df5c048e7c08bf1eaedfafabba3a2695d70da35928fcf6ec4","source":{"kind":"arxiv","id":"1908.08961","version":2},"attestation_state":"computed","paper":{"title":"Pareto-optimal data compression for binary classification tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Max Tegmark (MIT), Tailin Wu (MIT)","submitted_at":"2019-08-23T18:00:40Z","abstract_excerpt":"The goal of lossy data compression is to reduce the storage cost of a data set $X$ while retaining as much information as possible about something ($Y$) that you care about. For example, what aspects of an image $X$ contain the most information about whether it depicts a cat? Mathematically, this corresponds to finding a mapping $X\\to Z\\equiv f(X)$ that maximizes the mutual information $I(Z,Y)$ while the entropy $H(Z)$ is kept below some fixed threshold. We present a method for mapping out the Pareto frontier for classification tasks, reflecting the tradeoff between retained entropy and class "},"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":"1908.08961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-23T18:00:40Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"2e62a7d3f384a63dcc14db171fcffcb21de38e717b63597dcf682857f6dc99a1","abstract_canon_sha256":"38be84a57066f2fdeb1596d2445ae5f1f214e2320839c34ea0d5bf557e56ec3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:35.342837Z","signature_b64":"xEzlIpRUrzDV+bOdcAgQkP1L0ZK8kuIqHudXpu2+/Wwv7k7Der9e9ytxz5gIo18gArWZ1C6U1jeON7FOTTp6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2009d3da47bc308df5c048e7c08bf1eaedfafabba3a2695d70da35928fcf6ec4","last_reissued_at":"2026-07-05T00:33:35.342447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:35.342447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto-optimal data compression for binary classification tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Max Tegmark (MIT), Tailin Wu (MIT)","submitted_at":"2019-08-23T18:00:40Z","abstract_excerpt":"The goal of lossy data compression is to reduce the storage cost of a data set $X$ while retaining as much information as possible about something ($Y$) that you care about. For example, what aspects of an image $X$ contain the most information about whether it depicts a cat? Mathematically, this corresponds to finding a mapping $X\\to Z\\equiv f(X)$ that maximizes the mutual information $I(Z,Y)$ while the entropy $H(Z)$ is kept below some fixed threshold. We present a method for mapping out the Pareto frontier for classification tasks, reflecting the tradeoff between retained entropy and class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08961","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/1908.08961/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":"1908.08961","created_at":"2026-07-05T00:33:35.342510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08961v2","created_at":"2026-07-05T00:33:35.342510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08961","created_at":"2026-07-05T00:33:35.342510+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAE5HWSHXQYI","created_at":"2026-07-05T00:33:35.342510+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAE5HWSHXQYI35OA","created_at":"2026-07-05T00:33:35.342510+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAE5HWSH","created_at":"2026-07-05T00:33:35.342510+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/EAE5HWSHXQYI35OAJDT4BC7R5L","json":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L.json","graph_json":"https://pith.science/api/pith-number/EAE5HWSHXQYI35OAJDT4BC7R5L/graph.json","events_json":"https://pith.science/api/pith-number/EAE5HWSHXQYI35OAJDT4BC7R5L/events.json","paper":"https://pith.science/paper/EAE5HWSH"},"agent_actions":{"view_html":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L","download_json":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L.json","view_paper":"https://pith.science/paper/EAE5HWSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08961&json=true","fetch_graph":"https://pith.science/api/pith-number/EAE5HWSHXQYI35OAJDT4BC7R5L/graph.json","fetch_events":"https://pith.science/api/pith-number/EAE5HWSHXQYI35OAJDT4BC7R5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L/action/storage_attestation","attest_author":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L/action/author_attestation","sign_citation":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L/action/citation_signature","submit_replication":"https://pith.science/pith/EAE5HWSHXQYI35OAJDT4BC7R5L/action/replication_record"}},"created_at":"2026-07-05T00:33:35.342510+00:00","updated_at":"2026-07-05T00:33:35.342510+00:00"}