{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TP4PLGA2SLBIEIWN7S7MUEKNGA","short_pith_number":"pith:TP4PLGA2","schema_version":"1.0","canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","source":{"kind":"arxiv","id":"1607.07003","version":1},"attestation_state":"computed","paper":{"title":"Large Alphabet Source Coding using Independent Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","submitted_at":"2016-07-24T06:06:13Z","abstract_excerpt":"Large alphabet source coding is a basic and well-studied problem in data compression. It has many applications such as compression of natural language text, speech and images. The classic perception of most commonly used methods is that a source is best described over an alphabet which is at least as large as the observed alphabet. In this work we challenge this approach and introduce a conceptual framework in which a large alphabet source is decomposed into \"as statistically independent as possible\" components. This decomposition allows us to apply entropy encoding to each component separatel"},"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":"1607.07003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-24T06:06:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4fd47ac77eb3be1ccf42c9c18c3cf62bce12a14752e5e6861c5500e2bcc506a1","abstract_canon_sha256":"8f9defe09ce00aa22e85f0d18da35b148d2afeeb9af744bb6d43743c24c1f569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:35.168090Z","signature_b64":"G6Nne85c/x+tnHFSjki71LVxhsiy9vhj550jF4Cw+L0zoCSIrxEo2aHq/zE207MgqiLOJJqxmCi+dJyJA6dADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","last_reissued_at":"2026-05-18T01:10:35.167479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:35.167479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Alphabet Source Coding using Independent Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","submitted_at":"2016-07-24T06:06:13Z","abstract_excerpt":"Large alphabet source coding is a basic and well-studied problem in data compression. It has many applications such as compression of natural language text, speech and images. The classic perception of most commonly used methods is that a source is best described over an alphabet which is at least as large as the observed alphabet. In this work we challenge this approach and introduce a conceptual framework in which a large alphabet source is decomposed into \"as statistically independent as possible\" components. This decomposition allows us to apply entropy encoding to each component separatel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07003","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":"1607.07003","created_at":"2026-05-18T01:10:35.167582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07003v1","created_at":"2026-05-18T01:10:35.167582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07003","created_at":"2026-05-18T01:10:35.167582+00:00"},{"alias_kind":"pith_short_12","alias_value":"TP4PLGA2SLBI","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TP4PLGA2SLBIEIWN","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TP4PLGA2","created_at":"2026-05-18T12:30:46.583412+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/TP4PLGA2SLBIEIWN7S7MUEKNGA","json":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA.json","graph_json":"https://pith.science/api/pith-number/TP4PLGA2SLBIEIWN7S7MUEKNGA/graph.json","events_json":"https://pith.science/api/pith-number/TP4PLGA2SLBIEIWN7S7MUEKNGA/events.json","paper":"https://pith.science/paper/TP4PLGA2"},"agent_actions":{"view_html":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA","download_json":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA.json","view_paper":"https://pith.science/paper/TP4PLGA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07003&json=true","fetch_graph":"https://pith.science/api/pith-number/TP4PLGA2SLBIEIWN7S7MUEKNGA/graph.json","fetch_events":"https://pith.science/api/pith-number/TP4PLGA2SLBIEIWN7S7MUEKNGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/action/storage_attestation","attest_author":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/action/author_attestation","sign_citation":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/action/citation_signature","submit_replication":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/action/replication_record"}},"created_at":"2026-05-18T01:10:35.167582+00:00","updated_at":"2026-05-18T01:10:35.167582+00:00"}