{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EIGGUYS6SVFBRXHTBSQLC7DBCH","short_pith_number":"pith:EIGGUYS6","schema_version":"1.0","canonical_sha256":"220c6a625e954a18dcf30ca0b17c6111d82c9bc9ee5758f419250d2a9308189d","source":{"kind":"arxiv","id":"1009.4981","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Technique for Text Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, S. M. Kamruzzaman","submitted_at":"2010-09-25T06:49:28Z","abstract_excerpt":"For storing a word or the whole text segment, we need a huge storage space. Typically a character requires 1 Byte for storing it in memory. Compression of the memory is very important for data management. In case of memory requirement compression for text data, lossless memory compression is needed. We are suggesting a lossless memory requirement compression method for text data compression. The proposed compression method will compress the text segment or the text file based on two level approaches firstly reduction and secondly compression. Reduction will be done using a word lookup table no"},"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":"1009.4981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-25T06:49:28Z","cross_cats_sorted":["cs.IR","math.IT"],"title_canon_sha256":"b09a819a1b2d554fa15b4e6acfb6aa111baea09245c1d65ce80adf3df36c5914","abstract_canon_sha256":"5936d2408aa48746fbcd0a375b535be4c7174232ad1805409fb977a58d8a7c51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:19.563959Z","signature_b64":"PFr+kiUwFidggc7i7+AkNghaqr+m4zwW+svb5+BaL9jeNjQPwn6I7cVKa06vCiHGilSod0HhsLvPpYaPRI3DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"220c6a625e954a18dcf30ca0b17c6111d82c9bc9ee5758f419250d2a9308189d","last_reissued_at":"2026-05-18T04:40:19.563406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:19.563406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Technique for Text Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, S. M. Kamruzzaman","submitted_at":"2010-09-25T06:49:28Z","abstract_excerpt":"For storing a word or the whole text segment, we need a huge storage space. Typically a character requires 1 Byte for storing it in memory. Compression of the memory is very important for data management. In case of memory requirement compression for text data, lossless memory compression is needed. We are suggesting a lossless memory requirement compression method for text data compression. The proposed compression method will compress the text segment or the text file based on two level approaches firstly reduction and secondly compression. Reduction will be done using a word lookup table no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4981","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":"1009.4981","created_at":"2026-05-18T04:40:19.563477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4981v1","created_at":"2026-05-18T04:40:19.563477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4981","created_at":"2026-05-18T04:40:19.563477+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIGGUYS6SVFB","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIGGUYS6SVFBRXHT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIGGUYS6","created_at":"2026-05-18T12:26:06.534383+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/EIGGUYS6SVFBRXHTBSQLC7DBCH","json":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH.json","graph_json":"https://pith.science/api/pith-number/EIGGUYS6SVFBRXHTBSQLC7DBCH/graph.json","events_json":"https://pith.science/api/pith-number/EIGGUYS6SVFBRXHTBSQLC7DBCH/events.json","paper":"https://pith.science/paper/EIGGUYS6"},"agent_actions":{"view_html":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH","download_json":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH.json","view_paper":"https://pith.science/paper/EIGGUYS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4981&json=true","fetch_graph":"https://pith.science/api/pith-number/EIGGUYS6SVFBRXHTBSQLC7DBCH/graph.json","fetch_events":"https://pith.science/api/pith-number/EIGGUYS6SVFBRXHTBSQLC7DBCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH/action/storage_attestation","attest_author":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH/action/author_attestation","sign_citation":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH/action/citation_signature","submit_replication":"https://pith.science/pith/EIGGUYS6SVFBRXHTBSQLC7DBCH/action/replication_record"}},"created_at":"2026-05-18T04:40:19.563477+00:00","updated_at":"2026-05-18T04:40:19.563477+00:00"}