{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WJA4SBR4U2VKOYGZA3FBMQ6AOY","short_pith_number":"pith:WJA4SBR4","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"},"canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","source":{"kind":"arxiv","id":"1405.6322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6322","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6322v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6322","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"WJA4SBR4U2VK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJA4SBR4U2VKOYGZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJA4SBR4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WJA4SBR4U2VKOYGZA3FBMQ6AOY","target":"record","payload":{"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"},"canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","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"},"source_kind":"arxiv","source_id":"1405.6322","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:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuVTgnJoUyLMJ/10JPoAJN+pyilL8IrDRinOWuC0iFba/+ng9F0zFXg7LbAeC4x1zVMV2pyndXaqRL1zde5UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:33:04.548171Z"},"content_sha256":"d820ebe5a8c5259f43c58cfebfcf6bb840f2bf06e708ac2c87b75c0901eff633","schema_version":"1.0","event_id":"sha256:d820ebe5a8c5259f43c58cfebfcf6bb840f2bf06e708ac2c87b75c0901eff633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WJA4SBR4U2VKOYGZA3FBMQ6AOY","target":"graph","payload":{"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"},"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:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XybXeqOnnXXp/tQe+6q4rVgecq7xw1SGfuBYR5C6aGl/RlZv0eEfzv3HPF2htxUwl3dUSsjNP0Lfm8eYPb03Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:33:04.548535Z"},"content_sha256":"476e52744069a1a8ad7ba3f807a42fb83900ccab33546c7864489ae48ae09a24","schema_version":"1.0","event_id":"sha256:476e52744069a1a8ad7ba3f807a42fb83900ccab33546c7864489ae48ae09a24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/bundle.json","state_url":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/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-06-10T19:33:04Z","links":{"resolver":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY","bundle":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/bundle.json","state":"https://pith.science/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJA4SBR4U2VKOYGZA3FBMQ6AOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WJA4SBR4U2VKOYGZA3FBMQ6AOY","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":"1d30c24e81d585241ae229719a2810b484648ce8f80d08f6340f4becca136624","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-24T17:02:02Z","title_canon_sha256":"c89b208ea2de0d4cf92fc45b935a5836d64a4ea25be46657dec89f0f41cf86a7"},"schema_version":"1.0","source":{"id":"1405.6322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6322","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6322v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6322","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"WJA4SBR4U2VK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJA4SBR4U2VKOYGZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJA4SBR4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:476e52744069a1a8ad7ba3f807a42fb83900ccab33546c7864489ae48ae09a24","target":"graph","created_at":"2026-05-18T01:18:19Z","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":"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","authors_text":"Dror Baron, Mehmet K{\\i}van\\c{c} M{\\i}h\\c{c}ak, Nikhil Krishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-24T17:02:02Z","title":"A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6322","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:d820ebe5a8c5259f43c58cfebfcf6bb840f2bf06e708ac2c87b75c0901eff633","target":"record","created_at":"2026-05-18T01:18:19Z","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":"1d30c24e81d585241ae229719a2810b484648ce8f80d08f6340f4becca136624","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-24T17:02:02Z","title_canon_sha256":"c89b208ea2de0d4cf92fc45b935a5836d64a4ea25be46657dec89f0f41cf86a7"},"schema_version":"1.0","source":{"id":"1405.6322","kind":"arxiv","version":1}},"canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b241c9063ca6aaa760d906ca1643c07619c2fcb0f53c0ffde3491011711001e9","first_computed_at":"2026-05-18T01:18:19.180625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:19.180625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9lPg3rOso1LAUPXgPCYi91QJLjWz0N1Pw/4vAFJCrg/afKY0KXg1Xala0u5z8Dr6dv5Fjuc6cAcKKgN2y96bBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:19.181372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d820ebe5a8c5259f43c58cfebfcf6bb840f2bf06e708ac2c87b75c0901eff633","sha256:476e52744069a1a8ad7ba3f807a42fb83900ccab33546c7864489ae48ae09a24"],"state_sha256":"2f3d4178d9d76263e2868d00b8def87d1e62d6f1b4c9ea2a812e2830a54b4d95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4BFP5OagEANODe9ygpX9rEHWpB61SSf5FWpgeHZTZqphs+gC8c6+z1lzhEcb6QDR7Uaf1VK6hq4X7p5i+ccDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:33:04.550548Z","bundle_sha256":"38028beeef22864738a5cef813ed75ced1fda60504dc2da3031f03f5d981b89b"}}