{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GON4NFWR5NFDLKO6YZ3BX7744F","short_pith_number":"pith:GON4NFWR","canonical_record":{"source":{"id":"1209.5448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-09-24T22:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"50489b5aeb232cf4be0b1c25ddff1587d0005a066256e6024ecfdba3466fdad4","abstract_canon_sha256":"bdf54cc1f22314465675143a9bacd75124b6905e2d9800acad67b179b9d2bfa4"},"schema_version":"1.0"},"canonical_sha256":"339bc696d1eb4a35a9dec6761bfffce1770bed862a5caa84f113ff2a148c726c","source":{"kind":"arxiv","id":"1209.5448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5448","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5448v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5448","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"GON4NFWR5NFD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GON4NFWR5NFDLKO6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GON4NFWR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GON4NFWR5NFDLKO6YZ3BX7744F","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-09-24T22:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"50489b5aeb232cf4be0b1c25ddff1587d0005a066256e6024ecfdba3466fdad4","abstract_canon_sha256":"bdf54cc1f22314465675143a9bacd75124b6905e2d9800acad67b179b9d2bfa4"},"schema_version":"1.0"},"canonical_sha256":"339bc696d1eb4a35a9dec6761bfffce1770bed862a5caa84f113ff2a148c726c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:48.500278Z","signature_b64":"K/K/Td1Coq+3GKC/WUNXBG6WbZsp0ZT6HwfihJt4zdMB6rJtqR7CPukyKNowpDrXEOG0/dfC1dHOdpF1veopAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339bc696d1eb4a35a9dec6761bfffce1770bed862a5caa84f113ff2a148c726c","last_reissued_at":"2026-05-18T03:44:48.499545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:48.499545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5448","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-18T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rREHJPksZUUFxhA204UwquskVFLRhH7YPjnhLGPpI8l1ajEEJ+Ar7WHpZX4CIP6vOUbLz1C5FQ2Mz3KtAaJwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:03:00.768418Z"},"content_sha256":"9b7a9d96b1b98f1c0ff2e507f125d061badfdfb7df1397447c3004585a4498df","schema_version":"1.0","event_id":"sha256:9b7a9d96b1b98f1c0ff2e507f125d061badfdfb7df1397447c3004585a4498df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GON4NFWR5NFDLKO6YZ3BX7744F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Compression Based Index Structure for Efficient Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Md. Abdullah al Mamun, Md. Hanif, Md. Mofizul Islam, Md. Rakib Uddin, Tanvir Ahmed","submitted_at":"2012-09-24T22:27:17Z","abstract_excerpt":"Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes the index structure large enough affecting the IR system's quality. So compressing the Index structure is our main contribution in this paper. We compressed the document number in inverted file entries using a new coding technique based on run-length encoding. Our coding mechanism uses a specified cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5448","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-18T03:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tosBj5CYcXV0lx+LpRZ0UHErHPs/CNP8+AgSlIFBWkwGiaPUzMtq+8q5z7NCVNAIUMf9nz4FYO0eAdSmgVHhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:03:00.768757Z"},"content_sha256":"05ab55fdc0fe8f7c82bed2d292cc99c52b0f9306c44ce765409a99ccc9e0a4a7","schema_version":"1.0","event_id":"sha256:05ab55fdc0fe8f7c82bed2d292cc99c52b0f9306c44ce765409a99ccc9e0a4a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GON4NFWR5NFDLKO6YZ3BX7744F/bundle.json","state_url":"https://pith.science/pith/GON4NFWR5NFDLKO6YZ3BX7744F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GON4NFWR5NFDLKO6YZ3BX7744F/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-27T14:03:00Z","links":{"resolver":"https://pith.science/pith/GON4NFWR5NFDLKO6YZ3BX7744F","bundle":"https://pith.science/pith/GON4NFWR5NFDLKO6YZ3BX7744F/bundle.json","state":"https://pith.science/pith/GON4NFWR5NFDLKO6YZ3BX7744F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GON4NFWR5NFDLKO6YZ3BX7744F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GON4NFWR5NFDLKO6YZ3BX7744F","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":"bdf54cc1f22314465675143a9bacd75124b6905e2d9800acad67b179b9d2bfa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-09-24T22:27:17Z","title_canon_sha256":"50489b5aeb232cf4be0b1c25ddff1587d0005a066256e6024ecfdba3466fdad4"},"schema_version":"1.0","source":{"id":"1209.5448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5448","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5448v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5448","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"GON4NFWR5NFD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GON4NFWR5NFDLKO6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GON4NFWR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:05ab55fdc0fe8f7c82bed2d292cc99c52b0f9306c44ce765409a99ccc9e0a4a7","target":"graph","created_at":"2026-05-18T03:44:48Z","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":"Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes the index structure large enough affecting the IR system's quality. So compressing the Index structure is our main contribution in this paper. We compressed the document number in inverted file entries using a new coding technique based on run-length encoding. Our coding mechanism uses a specified cod","authors_text":"Md. Abdullah al Mamun, Md. Hanif, Md. Mofizul Islam, Md. Rakib Uddin, Tanvir Ahmed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-09-24T22:27:17Z","title":"A New Compression Based Index Structure for Efficient Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5448","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:9b7a9d96b1b98f1c0ff2e507f125d061badfdfb7df1397447c3004585a4498df","target":"record","created_at":"2026-05-18T03:44:48Z","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":"bdf54cc1f22314465675143a9bacd75124b6905e2d9800acad67b179b9d2bfa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-09-24T22:27:17Z","title_canon_sha256":"50489b5aeb232cf4be0b1c25ddff1587d0005a066256e6024ecfdba3466fdad4"},"schema_version":"1.0","source":{"id":"1209.5448","kind":"arxiv","version":1}},"canonical_sha256":"339bc696d1eb4a35a9dec6761bfffce1770bed862a5caa84f113ff2a148c726c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"339bc696d1eb4a35a9dec6761bfffce1770bed862a5caa84f113ff2a148c726c","first_computed_at":"2026-05-18T03:44:48.499545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:48.499545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/K/Td1Coq+3GKC/WUNXBG6WbZsp0ZT6HwfihJt4zdMB6rJtqR7CPukyKNowpDrXEOG0/dfC1dHOdpF1veopAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:48.500278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b7a9d96b1b98f1c0ff2e507f125d061badfdfb7df1397447c3004585a4498df","sha256:05ab55fdc0fe8f7c82bed2d292cc99c52b0f9306c44ce765409a99ccc9e0a4a7"],"state_sha256":"b6fb7fd1876a6e3cc4b55d353c874ff66c242c7ec4b734235ce153c03d4a4587"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLpITR67ZY70Brids5Y2+t77maeQ/gruqU5DBVpPd7e4d9DAOT/4L+vJgbaVc2HPbTZDVV4WGLc68500kswDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:03:00.770606Z","bundle_sha256":"5cf3f02dd4237dca98d23fc20f2ec3a485ca87621193267ddfcdb00dcd0808f0"}}