{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WJA4SBR4U2VKOYGZA3FBMQ6AOY","short_pith_number":"pith:WJA4SBR4","schema_version":"1.0","canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","source":{"kind":"arxiv","id":"1405.6322","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dror Baron, Mehmet K{\\i}van\\c{c} M{\\i}h\\c{c}ak, Nikhil Krishnan","submitted_at":"2014-05-24T17:02:02Z","abstract_excerpt":"We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-$N$ input sequence is partitioned into $B$ blocks. Processing each block independently of the other blocks can accelerate the computation by a factor of $B$, but degrades the compression quality. Instead, our approach is to first estimate the minimum description length (MDL) source underlying the entire input, and then encode each of the $B$ blocks in parallel based on the MDL source. With this two-pass approach, the compression loss incurred by using more"},"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":"1405.6322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-24T17:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c89b208ea2de0d4cf92fc45b935a5836d64a4ea25be46657dec89f0f41cf86a7","abstract_canon_sha256":"1d30c24e81d585241ae229719a2810b484648ce8f80d08f6340f4becca136624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:19.181372Z","signature_b64":"9lPg3rOso1LAUPXgPCYi91QJLjWz0N1Pw/4vAFJCrg/afKY0KXg1Xala0u5z8Dr6dv5Fjuc6cAcKKgN2y96bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","last_reissued_at":"2026-05-18T01:18:19.180625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:19.180625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dror Baron, Mehmet K{\\i}van\\c{c} M{\\i}h\\c{c}ak, Nikhil Krishnan","submitted_at":"2014-05-24T17:02:02Z","abstract_excerpt":"We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-$N$ input sequence is partitioned into $B$ blocks. Processing each block independently of the other blocks can accelerate the computation by a factor of $B$, but degrades the compression quality. Instead, our approach is to first estimate the minimum description length (MDL) source underlying the entire input, and then encode each of the $B$ blocks in parallel based on the MDL source. With this two-pass approach, the compression loss incurred by using more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6322","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":"1405.6322","created_at":"2026-05-18T01:18:19.180748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6322v1","created_at":"2026-05-18T01:18:19.180748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6322","created_at":"2026-05-18T01:18:19.180748+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJA4SBR4U2VK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJA4SBR4U2VKOYGZ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJA4SBR4","created_at":"2026-05-18T12:28:54.890064+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/WJA4SBR4U2VKOYGZA3FBMQ6AOY","json":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY.json","graph_json":"https://pith.science/api/pith-number/WJA4SBR4U2VKOYGZA3FBMQ6AOY/graph.json","events_json":"https://pith.science/api/pith-number/WJA4SBR4U2VKOYGZA3FBMQ6AOY/events.json","paper":"https://pith.science/paper/WJA4SBR4"},"agent_actions":{"view_html":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY","download_json":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY.json","view_paper":"https://pith.science/paper/WJA4SBR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6322&json=true","fetch_graph":"https://pith.science/api/pith-number/WJA4SBR4U2VKOYGZA3FBMQ6AOY/graph.json","fetch_events":"https://pith.science/api/pith-number/WJA4SBR4U2VKOYGZA3FBMQ6AOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/action/storage_attestation","attest_author":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/action/author_attestation","sign_citation":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/action/citation_signature","submit_replication":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/action/replication_record"}},"created_at":"2026-05-18T01:18:19.180748+00:00","updated_at":"2026-05-18T01:18:19.180748+00:00"}