{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KXZ45MNSTZITH2QL7YBGYVMOBG","short_pith_number":"pith:KXZ45MNS","canonical_record":{"source":{"id":"1209.5905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-09-26T11:47:33Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"720518f1e3bf7be782ad7e31cafaf7933ad68dc5fe636f4e7b985af3f9b1a813","abstract_canon_sha256":"c5ec98e98bf10457733d072b382ba6ff49abe8c6c12a47e2f574d66d0554f785"},"schema_version":"1.0"},"canonical_sha256":"55f3ceb1b29e5133ea0bfe026c558e0998bced48a606ad283390f85f98adc5d0","source":{"kind":"arxiv","id":"1209.5905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5905","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5905v2","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5905","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"KXZ45MNSTZIT","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KXZ45MNSTZITH2QL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KXZ45MNS","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KXZ45MNSTZITH2QL7YBGYVMOBG","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-09-26T11:47:33Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"720518f1e3bf7be782ad7e31cafaf7933ad68dc5fe636f4e7b985af3f9b1a813","abstract_canon_sha256":"c5ec98e98bf10457733d072b382ba6ff49abe8c6c12a47e2f574d66d0554f785"},"schema_version":"1.0"},"canonical_sha256":"55f3ceb1b29e5133ea0bfe026c558e0998bced48a606ad283390f85f98adc5d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:04.129589Z","signature_b64":"eZilzED1N1Su7ysxIecyGej6bw12ov/iotRuWyuYWuZ7tsxYqAuB5xaRIDEV+jC01j2ExsJOsBtDENl1zWwrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55f3ceb1b29e5133ea0bfe026c558e0998bced48a606ad283390f85f98adc5d0","last_reissued_at":"2026-05-18T03:41:04.129043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:04.129043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5905","source_version":2,"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:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUWuJtiKgA0dDFH84hgZy5KmMVbNEApAs7Ll1REfzndrb8Yr3A6BEPzXOVoxwKEgUNeSNmLfBwTloNr4drkBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:43:04.764977Z"},"content_sha256":"03e1dbc94ab43ed0e04cb3d37ba3cd1dc36ae2817687af58d729f4070cfe4987","schema_version":"1.0","event_id":"sha256:03e1dbc94ab43ed0e04cb3d37ba3cd1dc36ae2817687af58d729f4070cfe4987"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KXZ45MNSTZITH2QL7YBGYVMOBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Biological Sequence Compression Technique Using LUT And Repeat In The Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.CE","authors_text":"Samir K. Bandyopadhyay, Subhankar Roy, Sudipta Roy, Sunirmal Khatua","submitted_at":"2012-09-26T11:47:33Z","abstract_excerpt":"Data compression plays an important role to deal with high volumes of DNA sequences in the field of Bioinformatics. Again data compression techniques directly affect the alignment of DNA sequences. So the time needed to decompress a compressed sequence has to be given equal priorities as with compression ratio. This article contains first introduction then a brief review of different biological sequence compression after that my proposed work then our two improved Biological sequence compression algorithms after that result followed by conclusion and discussion, future scope and finally refere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5905","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"},"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:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tqn3RxSshzB+XHP1tB8mJgRf56LGFsEQ03TEqLnJE16yb4M76zHJJCaaKELtgPFa5SkXscZ9CLHAIQIZG/wKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:43:04.765406Z"},"content_sha256":"a5952e24e76f6a2aa5434dee33f3111f9dd4b2c81cfdfc5b72a0226fe6eecc69","schema_version":"1.0","event_id":"sha256:a5952e24e76f6a2aa5434dee33f3111f9dd4b2c81cfdfc5b72a0226fe6eecc69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/bundle.json","state_url":"https://pith.science/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/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-05-30T19:43:04Z","links":{"resolver":"https://pith.science/pith/KXZ45MNSTZITH2QL7YBGYVMOBG","bundle":"https://pith.science/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/bundle.json","state":"https://pith.science/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXZ45MNSTZITH2QL7YBGYVMOBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KXZ45MNSTZITH2QL7YBGYVMOBG","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":"c5ec98e98bf10457733d072b382ba6ff49abe8c6c12a47e2f574d66d0554f785","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-09-26T11:47:33Z","title_canon_sha256":"720518f1e3bf7be782ad7e31cafaf7933ad68dc5fe636f4e7b985af3f9b1a813"},"schema_version":"1.0","source":{"id":"1209.5905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5905","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5905v2","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5905","created_at":"2026-05-18T03:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"KXZ45MNSTZIT","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KXZ45MNSTZITH2QL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KXZ45MNS","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:a5952e24e76f6a2aa5434dee33f3111f9dd4b2c81cfdfc5b72a0226fe6eecc69","target":"graph","created_at":"2026-05-18T03:41:04Z","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":"Data compression plays an important role to deal with high volumes of DNA sequences in the field of Bioinformatics. Again data compression techniques directly affect the alignment of DNA sequences. So the time needed to decompress a compressed sequence has to be given equal priorities as with compression ratio. This article contains first introduction then a brief review of different biological sequence compression after that my proposed work then our two improved Biological sequence compression algorithms after that result followed by conclusion and discussion, future scope and finally refere","authors_text":"Samir K. Bandyopadhyay, Subhankar Roy, Sudipta Roy, Sunirmal Khatua","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-09-26T11:47:33Z","title":"An Efficient Biological Sequence Compression Technique Using LUT And Repeat In The Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5905","kind":"arxiv","version":2},"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:03e1dbc94ab43ed0e04cb3d37ba3cd1dc36ae2817687af58d729f4070cfe4987","target":"record","created_at":"2026-05-18T03:41:04Z","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":"c5ec98e98bf10457733d072b382ba6ff49abe8c6c12a47e2f574d66d0554f785","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-09-26T11:47:33Z","title_canon_sha256":"720518f1e3bf7be782ad7e31cafaf7933ad68dc5fe636f4e7b985af3f9b1a813"},"schema_version":"1.0","source":{"id":"1209.5905","kind":"arxiv","version":2}},"canonical_sha256":"55f3ceb1b29e5133ea0bfe026c558e0998bced48a606ad283390f85f98adc5d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55f3ceb1b29e5133ea0bfe026c558e0998bced48a606ad283390f85f98adc5d0","first_computed_at":"2026-05-18T03:41:04.129043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:04.129043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eZilzED1N1Su7ysxIecyGej6bw12ov/iotRuWyuYWuZ7tsxYqAuB5xaRIDEV+jC01j2ExsJOsBtDENl1zWwrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:04.129589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03e1dbc94ab43ed0e04cb3d37ba3cd1dc36ae2817687af58d729f4070cfe4987","sha256:a5952e24e76f6a2aa5434dee33f3111f9dd4b2c81cfdfc5b72a0226fe6eecc69"],"state_sha256":"853bab7316f0ed0b9d1f01e35fefeb63f2a416eb5d1d7ca4c055708273e83257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYKaWm0M2MuNWHDIqAVGtwLdNwY/k/Rgr78XtjYDj97vrGcQOQRJJ1VBy203P+GAhyVIaNwJZAQOflMf3NSNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:43:04.767503Z","bundle_sha256":"440062537e72ab91243a7ffb3063948ba427ccc92b61e8275b8bdd0374f0158c"}}