{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3LYCDWCOBXUDHAOH32JROJGKLN","short_pith_number":"pith:3LYCDWCO","canonical_record":{"source":{"id":"1207.0361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-02T12:38:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1dcd83fa958d0d6b37d1abfe985b8d155dc2f9ce49d6c33c40f512b0874384b","abstract_canon_sha256":"74fa249d7ddf2452f31b40ad4d75e2d24341ff7d270edb4b5dcc296508184426"},"schema_version":"1.0"},"canonical_sha256":"daf021d84e0de83381c7de931724ca5b50638dfe376d004f8435798ab660b00f","source":{"kind":"arxiv","id":"1207.0361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0361","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0361v2","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0361","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"3LYCDWCOBXUD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3LYCDWCOBXUDHAOH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3LYCDWCO","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3LYCDWCOBXUDHAOH32JROJGKLN","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-02T12:38:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1dcd83fa958d0d6b37d1abfe985b8d155dc2f9ce49d6c33c40f512b0874384b","abstract_canon_sha256":"74fa249d7ddf2452f31b40ad4d75e2d24341ff7d270edb4b5dcc296508184426"},"schema_version":"1.0"},"canonical_sha256":"daf021d84e0de83381c7de931724ca5b50638dfe376d004f8435798ab660b00f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:57.889056Z","signature_b64":"upau7DcAlAJXDHSb4CvsuVZaxeNboszgQq9k3AwnOyuMx249nZGCy2dGm2glb4HFBJ3yQcOVAGk06bLt89HtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf021d84e0de83381c7de931724ca5b50638dfe376d004f8435798ab660b00f","last_reissued_at":"2026-05-18T03:51:57.888595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:57.888595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0361","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HRXPWbKtY48FMNlJtAgVmHG+Lf5EVNyzsFhN7tGuCQtlO/mq2iHrkHGHPpXBxUsOuCfveDO/ZX5vs7NHhR1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:31:35.135685Z"},"content_sha256":"d33d3359c0f7550d5c94fb2a360cbe23531f81881c2ba23501c6224e7dd77e9f","schema_version":"1.0","event_id":"sha256:d33d3359c0f7550d5c94fb2a360cbe23531f81881c2ba23501c6224e7dd77e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3LYCDWCOBXUDHAOH32JROJGKLN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"INSTRUCT: Space-Efficient Structure for Indexing and Complete Query Management of String Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Arnab Bhattacharya, Sourav Dutta","submitted_at":"2012-07-02T12:38:47Z","abstract_excerpt":"The tremendous expanse of search engines, dictionary and thesaurus storage, and other text mining applications, combined with the popularity of readily available scanning devices and optical character recognition tools, has necessitated efficient storage, retrieval and management of massive text databases for various modern applications. For such applications, we propose a novel data structure, INSTRUCT, for efficient storage and management of sequence databases. Our structure uses bit vectors for reusing the storage space for common triplets, and hence, has a very low memory requirement. INST"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0361","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnx3ys+iU933mX/G4NdISwn+t7PxVMa3fARz1Opz8bUoVG0hYcpZ1w0l7NeBAsp4dJIJ7+a7pfwwdV+vO523Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:31:35.136306Z"},"content_sha256":"642257c810c2c0f22ebffc93f3684879b658244a659e179538d2002c38a38693","schema_version":"1.0","event_id":"sha256:642257c810c2c0f22ebffc93f3684879b658244a659e179538d2002c38a38693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LYCDWCOBXUDHAOH32JROJGKLN/bundle.json","state_url":"https://pith.science/pith/3LYCDWCOBXUDHAOH32JROJGKLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LYCDWCOBXUDHAOH32JROJGKLN/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-02T13:31:35Z","links":{"resolver":"https://pith.science/pith/3LYCDWCOBXUDHAOH32JROJGKLN","bundle":"https://pith.science/pith/3LYCDWCOBXUDHAOH32JROJGKLN/bundle.json","state":"https://pith.science/pith/3LYCDWCOBXUDHAOH32JROJGKLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LYCDWCOBXUDHAOH32JROJGKLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3LYCDWCOBXUDHAOH32JROJGKLN","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":"74fa249d7ddf2452f31b40ad4d75e2d24341ff7d270edb4b5dcc296508184426","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-02T12:38:47Z","title_canon_sha256":"c1dcd83fa958d0d6b37d1abfe985b8d155dc2f9ce49d6c33c40f512b0874384b"},"schema_version":"1.0","source":{"id":"1207.0361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0361","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0361v2","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0361","created_at":"2026-05-18T03:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"3LYCDWCOBXUD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3LYCDWCOBXUDHAOH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3LYCDWCO","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:642257c810c2c0f22ebffc93f3684879b658244a659e179538d2002c38a38693","target":"graph","created_at":"2026-05-18T03:51:57Z","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":"The tremendous expanse of search engines, dictionary and thesaurus storage, and other text mining applications, combined with the popularity of readily available scanning devices and optical character recognition tools, has necessitated efficient storage, retrieval and management of massive text databases for various modern applications. For such applications, we propose a novel data structure, INSTRUCT, for efficient storage and management of sequence databases. Our structure uses bit vectors for reusing the storage space for common triplets, and hence, has a very low memory requirement. INST","authors_text":"Arnab Bhattacharya, Sourav Dutta","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-02T12:38:47Z","title":"INSTRUCT: Space-Efficient Structure for Indexing and Complete Query Management of String Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0361","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:d33d3359c0f7550d5c94fb2a360cbe23531f81881c2ba23501c6224e7dd77e9f","target":"record","created_at":"2026-05-18T03:51:57Z","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":"74fa249d7ddf2452f31b40ad4d75e2d24341ff7d270edb4b5dcc296508184426","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-02T12:38:47Z","title_canon_sha256":"c1dcd83fa958d0d6b37d1abfe985b8d155dc2f9ce49d6c33c40f512b0874384b"},"schema_version":"1.0","source":{"id":"1207.0361","kind":"arxiv","version":2}},"canonical_sha256":"daf021d84e0de83381c7de931724ca5b50638dfe376d004f8435798ab660b00f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daf021d84e0de83381c7de931724ca5b50638dfe376d004f8435798ab660b00f","first_computed_at":"2026-05-18T03:51:57.888595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:57.888595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upau7DcAlAJXDHSb4CvsuVZaxeNboszgQq9k3AwnOyuMx249nZGCy2dGm2glb4HFBJ3yQcOVAGk06bLt89HtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:57.889056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d33d3359c0f7550d5c94fb2a360cbe23531f81881c2ba23501c6224e7dd77e9f","sha256:642257c810c2c0f22ebffc93f3684879b658244a659e179538d2002c38a38693"],"state_sha256":"e0d2791e336469188edc3e2d40cd571d7d854575b45c3aea399f787ba5737f92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDRtNFNvz4raO0T+dMUcFBWFiR9zo5S5ig2bfz96F36S+HFdHLE+JQMwhhtTNJgDfJqSQCU04kgxNSrjzZu4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:31:35.139237Z","bundle_sha256":"67e4106033302739f11cf108a393e8ad99110df3c148f3795d87fb7c4d3a7fa7"}}