{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JD4GDLEFLBQMKJZRKU3UBFM3BH","short_pith_number":"pith:JD4GDLEF","schema_version":"1.0","canonical_sha256":"48f861ac855860c52731553740959b09c4e1248e968f6c833113b5e578e578fa","source":{"kind":"arxiv","id":"1701.02900","version":1},"attestation_state":"computed","paper":{"title":"Optimal Compression for Two-Field Entries in Fixed-Width Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ori Rottenstreich, Yuval Cassuto","submitted_at":"2017-01-11T09:32:14Z","abstract_excerpt":"Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper. In the problem we consider we have two sources with known discrete distributions, and we wish to find codes that maximize the success probability that the two source outputs are represented in $L$ bits or less. A good practical use for this problem is a table with two-field entries that is stored in a memory of a fixed width $L$. Such tables of very large siz"},"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":"1701.02900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T09:32:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"244efc7d867e93ee2bb3c870e9ed38af5f9feaf73506598e70f5490160ccbf5b","abstract_canon_sha256":"84157054d3736e0c85cb01411facf8443de7dff96653068088e7a9e7b26057f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.871463Z","signature_b64":"WAA183zWbvPFb++lrovplpx/KJ5MumD58tuS4eBKLCCYpLBxTjHj0r3X9y/Rw3j2NQ0SQGscWi9lWjQn890VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48f861ac855860c52731553740959b09c4e1248e968f6c833113b5e578e578fa","last_reissued_at":"2026-05-18T00:52:59.871004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.871004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Compression for Two-Field Entries in Fixed-Width Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ori Rottenstreich, Yuval Cassuto","submitted_at":"2017-01-11T09:32:14Z","abstract_excerpt":"Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper. In the problem we consider we have two sources with known discrete distributions, and we wish to find codes that maximize the success probability that the two source outputs are represented in $L$ bits or less. A good practical use for this problem is a table with two-field entries that is stored in a memory of a fixed width $L$. Such tables of very large siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02900","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":""},"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":"1701.02900","created_at":"2026-05-18T00:52:59.871076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02900v1","created_at":"2026-05-18T00:52:59.871076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02900","created_at":"2026-05-18T00:52:59.871076+00:00"},{"alias_kind":"pith_short_12","alias_value":"JD4GDLEFLBQM","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JD4GDLEFLBQMKJZR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JD4GDLEF","created_at":"2026-05-18T12:31:21.493067+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/JD4GDLEFLBQMKJZRKU3UBFM3BH","json":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH.json","graph_json":"https://pith.science/api/pith-number/JD4GDLEFLBQMKJZRKU3UBFM3BH/graph.json","events_json":"https://pith.science/api/pith-number/JD4GDLEFLBQMKJZRKU3UBFM3BH/events.json","paper":"https://pith.science/paper/JD4GDLEF"},"agent_actions":{"view_html":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH","download_json":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH.json","view_paper":"https://pith.science/paper/JD4GDLEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02900&json=true","fetch_graph":"https://pith.science/api/pith-number/JD4GDLEFLBQMKJZRKU3UBFM3BH/graph.json","fetch_events":"https://pith.science/api/pith-number/JD4GDLEFLBQMKJZRKU3UBFM3BH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH/action/storage_attestation","attest_author":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH/action/author_attestation","sign_citation":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH/action/citation_signature","submit_replication":"https://pith.science/pith/JD4GDLEFLBQMKJZRKU3UBFM3BH/action/replication_record"}},"created_at":"2026-05-18T00:52:59.871076+00:00","updated_at":"2026-05-18T00:52:59.871076+00:00"}