{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SDLTSK34J2FXGUJQJPCADUMQCC","short_pith_number":"pith:SDLTSK34","schema_version":"1.0","canonical_sha256":"90d7392b7c4e8b7351304bc401d190108e36c6c339e90d4d7d4c43c2c4a3505c","source":{"kind":"arxiv","id":"2601.11919","version":2},"attestation_state":"computed","paper":{"title":"Rate-Distortion-Classification Representation Theory for Bernoulli Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bella Bose, Nam Nguyen, Thinh Nguyen","submitted_at":"2026-01-17T05:42:32Z","abstract_excerpt":"We study task-oriented lossy compression through the lens of rate-distortion-classification (RDC) representations. The source is Bernoulli, the distortion measure is Hamming, and the binary classification variable is coupled to the source via a binary symmetric model. Building on the one-shot common-randomness formulation, we first derive closed-form characterizations of the one-shot RDC and the dual distortion-rate-classification (DRC) tradeoffs. We then use a representation-based viewpoint and characterize the achievable distortion-classification (DC) region induced by a fixed representation"},"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":"2601.11919","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-17T05:42:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b68073cf16dc2f96c316747fc14f83c3b648069eb1078442245a0d621482215","abstract_canon_sha256":"1d1232520bd2dc098b6686f7c9bfc2da9fc6051d2b34a518f881b6805af1e055"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:08.499392Z","signature_b64":"G3K+JtFNjWl5HKU9YSuABPdIpUl1t2/ElHjaMDJiP9IocWzrVSy4fKBDOWXQ8Dsb7SR50dt+ct3C10DaHMTZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d7392b7c4e8b7351304bc401d190108e36c6c339e90d4d7d4c43c2c4a3505c","last_reissued_at":"2026-05-20T00:02:08.498502Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:08.498502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Distortion-Classification Representation Theory for Bernoulli Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bella Bose, Nam Nguyen, Thinh Nguyen","submitted_at":"2026-01-17T05:42:32Z","abstract_excerpt":"We study task-oriented lossy compression through the lens of rate-distortion-classification (RDC) representations. The source is Bernoulli, the distortion measure is Hamming, and the binary classification variable is coupled to the source via a binary symmetric model. Building on the one-shot common-randomness formulation, we first derive closed-form characterizations of the one-shot RDC and the dual distortion-rate-classification (DRC) tradeoffs. We then use a representation-based viewpoint and characterize the achievable distortion-classification (DC) region induced by a fixed representation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.11919","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/2601.11919/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":"2601.11919","created_at":"2026-05-20T00:02:08.498662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.11919v2","created_at":"2026-05-20T00:02:08.498662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.11919","created_at":"2026-05-20T00:02:08.498662+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDLTSK34J2FX","created_at":"2026-05-20T00:02:08.498662+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDLTSK34J2FXGUJQ","created_at":"2026-05-20T00:02:08.498662+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDLTSK34","created_at":"2026-05-20T00:02:08.498662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.09833","citing_title":"Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC","json":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC.json","graph_json":"https://pith.science/api/pith-number/SDLTSK34J2FXGUJQJPCADUMQCC/graph.json","events_json":"https://pith.science/api/pith-number/SDLTSK34J2FXGUJQJPCADUMQCC/events.json","paper":"https://pith.science/paper/SDLTSK34"},"agent_actions":{"view_html":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC","download_json":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC.json","view_paper":"https://pith.science/paper/SDLTSK34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.11919&json=true","fetch_graph":"https://pith.science/api/pith-number/SDLTSK34J2FXGUJQJPCADUMQCC/graph.json","fetch_events":"https://pith.science/api/pith-number/SDLTSK34J2FXGUJQJPCADUMQCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC/action/storage_attestation","attest_author":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC/action/author_attestation","sign_citation":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC/action/citation_signature","submit_replication":"https://pith.science/pith/SDLTSK34J2FXGUJQJPCADUMQCC/action/replication_record"}},"created_at":"2026-05-20T00:02:08.498662+00:00","updated_at":"2026-05-20T00:02:08.498662+00:00"}