{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TP4PLGA2SLBIEIWN7S7MUEKNGA","short_pith_number":"pith:TP4PLGA2","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"},"canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","source":{"kind":"arxiv","id":"1607.07003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07003","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07003v1","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07003","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"TP4PLGA2SLBI","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TP4PLGA2SLBIEIWN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TP4PLGA2","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TP4PLGA2SLBIEIWN7S7MUEKNGA","target":"record","payload":{"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"},"canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","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"},"source_kind":"arxiv","source_id":"1607.07003","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgzKM1t7iGVvTErmNDB4IEmcnU4FmKh72rg2qnCppaU6RsNNKlXN37teTpG40GtWg7Firazmicgbirf9gbpXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:21:06.239473Z"},"content_sha256":"f7469a63255b5582c3615e847d4556c61fd048a0735de24f051adff560d93758","schema_version":"1.0","event_id":"sha256:f7469a63255b5582c3615e847d4556c61fd048a0735de24f051adff560d93758"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TP4PLGA2SLBIEIWN7S7MUEKNGA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYSbGrYdvBIJ07zRp1RLovB6n2qFim5u8cd5A/WoKAp1U2EvUfX14W1HObi/Tb6o6tGKxFu+gY+wpxU2+By0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:21:06.240246Z"},"content_sha256":"c84c92013e6b63222ab5cbac0aba3d0b19920a239166592dbfb2f3e8798fd6b7","schema_version":"1.0","event_id":"sha256:c84c92013e6b63222ab5cbac0aba3d0b19920a239166592dbfb2f3e8798fd6b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/bundle.json","state_url":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T23:21:06Z","links":{"resolver":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA","bundle":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/bundle.json","state":"https://pith.science/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TP4PLGA2SLBIEIWN7S7MUEKNGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TP4PLGA2SLBIEIWN7S7MUEKNGA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8f9defe09ce00aa22e85f0d18da35b148d2afeeb9af744bb6d43743c24c1f569","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-24T06:06:13Z","title_canon_sha256":"4fd47ac77eb3be1ccf42c9c18c3cf62bce12a14752e5e6861c5500e2bcc506a1"},"schema_version":"1.0","source":{"id":"1607.07003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07003","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07003v1","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07003","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"TP4PLGA2SLBI","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TP4PLGA2SLBIEIWN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TP4PLGA2","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:c84c92013e6b63222ab5cbac0aba3d0b19920a239166592dbfb2f3e8798fd6b7","target":"graph","created_at":"2026-05-18T01:10:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-24T06:06:13Z","title":"Large Alphabet Source Coding using Independent Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07003","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7469a63255b5582c3615e847d4556c61fd048a0735de24f051adff560d93758","target":"record","created_at":"2026-05-18T01:10:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8f9defe09ce00aa22e85f0d18da35b148d2afeeb9af744bb6d43743c24c1f569","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-24T06:06:13Z","title_canon_sha256":"4fd47ac77eb3be1ccf42c9c18c3cf62bce12a14752e5e6861c5500e2bcc506a1"},"schema_version":"1.0","source":{"id":"1607.07003","kind":"arxiv","version":1}},"canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bf8f5981a92c28222cdfcbeca114d30304e6b858f7c808b903952d6c66c61eb","first_computed_at":"2026-05-18T01:10:35.167479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:35.167479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6Nne85c/x+tnHFSjki71LVxhsiy9vhj550jF4Cw+L0zoCSIrxEo2aHq/zE207MgqiLOJJqxmCi+dJyJA6dADw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:35.168090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7469a63255b5582c3615e847d4556c61fd048a0735de24f051adff560d93758","sha256:c84c92013e6b63222ab5cbac0aba3d0b19920a239166592dbfb2f3e8798fd6b7"],"state_sha256":"c2b6a5f3376eebf86fcf20616fbc18c0fef2140ed69976277ab98ca747a77364"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZuwoTo69Xq1ykDNOnSqAF2nkgFLHqN0IxEAzurGnmuUHzrbWoC4UPFGBcDCz82mcbI4MWv7FWsQY71vDSEtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:21:06.244237Z","bundle_sha256":"88831b81573a002951efdc4317aa8d99fd0cb63bcebbfa09869faf24093fd100"}}