{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:377RGW5PWLOKN4LBLC2IQWBSNZ","short_pith_number":"pith:377RGW5P","schema_version":"1.0","canonical_sha256":"dfff135bafb2dca6f16158b48858326e5873cf9b9566d1d35577502e7d8917bb","source":{"kind":"arxiv","id":"1012.3790","version":2},"attestation_state":"computed","paper":{"title":"Improving PPM Algorithm Using Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farooq Khan, Jianzhong (Charlie) Zhang, Yichuan Hu, Ying Li","submitted_at":"2010-12-17T00:38:58Z","abstract_excerpt":"We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic idea of our algorithm is to encode non-words and prefixes of words using character-based context models and encode suffixes of words using dictionary models. By using dictionary models, the algorithm can encode multiple characters as a whole, and thus enhance the compression efficiency. The advantages of the proposed algorithm are: 1) it does not require any text preprocessing; 2) it does not need any explicit codeword to i"},"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":"1012.3790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-17T00:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6e728bbc1eaa4b7edbe01c066db5e0fa5c7f5b29942443ad87b5a6b4650f152","abstract_canon_sha256":"4d59578f1799cda270954c3699374249c5b053d1b349bf9a0f42888026491623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:07.019812Z","signature_b64":"do5P4K1KxgCcpMZ57N9JnpeFls6Q+oVkCfO2fT4PjYj40UWPbo4NmrVLYrSqhcXz1BYCUupUXyZJba9fv1a8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfff135bafb2dca6f16158b48858326e5873cf9b9566d1d35577502e7d8917bb","last_reissued_at":"2026-05-18T02:23:07.019208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:07.019208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving PPM Algorithm Using Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farooq Khan, Jianzhong (Charlie) Zhang, Yichuan Hu, Ying Li","submitted_at":"2010-12-17T00:38:58Z","abstract_excerpt":"We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic idea of our algorithm is to encode non-words and prefixes of words using character-based context models and encode suffixes of words using dictionary models. By using dictionary models, the algorithm can encode multiple characters as a whole, and thus enhance the compression efficiency. The advantages of the proposed algorithm are: 1) it does not require any text preprocessing; 2) it does not need any explicit codeword to i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3790","kind":"arxiv","version":2},"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":"1012.3790","created_at":"2026-05-18T02:23:07.019294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3790v2","created_at":"2026-05-18T02:23:07.019294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3790","created_at":"2026-05-18T02:23:07.019294+00:00"},{"alias_kind":"pith_short_12","alias_value":"377RGW5PWLOK","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"377RGW5PWLOKN4LB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"377RGW5P","created_at":"2026-05-18T12:26:03.138858+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/377RGW5PWLOKN4LBLC2IQWBSNZ","json":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ.json","graph_json":"https://pith.science/api/pith-number/377RGW5PWLOKN4LBLC2IQWBSNZ/graph.json","events_json":"https://pith.science/api/pith-number/377RGW5PWLOKN4LBLC2IQWBSNZ/events.json","paper":"https://pith.science/paper/377RGW5P"},"agent_actions":{"view_html":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ","download_json":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ.json","view_paper":"https://pith.science/paper/377RGW5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3790&json=true","fetch_graph":"https://pith.science/api/pith-number/377RGW5PWLOKN4LBLC2IQWBSNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/377RGW5PWLOKN4LBLC2IQWBSNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ/action/storage_attestation","attest_author":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ/action/author_attestation","sign_citation":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ/action/citation_signature","submit_replication":"https://pith.science/pith/377RGW5PWLOKN4LBLC2IQWBSNZ/action/replication_record"}},"created_at":"2026-05-18T02:23:07.019294+00:00","updated_at":"2026-05-18T02:23:07.019294+00:00"}