{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BXENNOW7I4QJVQPQWQZXDN37VO","short_pith_number":"pith:BXENNOW7","canonical_record":{"source":{"id":"1508.06561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-25T16:58:35Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"91bfa1e28836c0f0d5ae91a8af4578b733bfb5afa29ca89a2f88e88bee451324","abstract_canon_sha256":"f3d08e104570a45df5b29b001bf0d7efbb753bbaaf023df780cc9c58b815c27b"},"schema_version":"1.0"},"canonical_sha256":"0dc8d6badf47209ac1f0b43371b77fabbfc12cd2c0fbe3118c36454be8ba88e0","source":{"kind":"arxiv","id":"1508.06561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06561","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06561v1","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06561","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"BXENNOW7I4QJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BXENNOW7I4QJVQPQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BXENNOW7","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BXENNOW7I4QJVQPQWQZXDN37VO","target":"record","payload":{"canonical_record":{"source":{"id":"1508.06561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-25T16:58:35Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"91bfa1e28836c0f0d5ae91a8af4578b733bfb5afa29ca89a2f88e88bee451324","abstract_canon_sha256":"f3d08e104570a45df5b29b001bf0d7efbb753bbaaf023df780cc9c58b815c27b"},"schema_version":"1.0"},"canonical_sha256":"0dc8d6badf47209ac1f0b43371b77fabbfc12cd2c0fbe3118c36454be8ba88e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:42.653416Z","signature_b64":"vOPARB3oXUkQxJtGcWXARExZ+5M5b/M6EG/ThOKPHsdSAAtRqyh4CRZpxhF02pWm2k/YXB3GHkM2Csk/X028Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc8d6badf47209ac1f0b43371b77fabbfc12cd2c0fbe3118c36454be8ba88e0","last_reissued_at":"2026-05-18T01:34:42.652552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:42.652552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.06561","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-18T01:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elSI85QmBmaVVJgJrhsqD8ZJ3QX+3FXstcpyKTC8f2XNN7JdvrWFIpTjjNSeZe5Dn8eYbP64wKCKQyYtM0cOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:03:07.134393Z"},"content_sha256":"793379909348fb5006961f707af653e154c28b5e8d6f2b31f6680ae5c29a8611","schema_version":"1.0","event_id":"sha256:793379909348fb5006961f707af653e154c28b5e8d6f2b31f6680ae5c29a8611"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BXENNOW7I4QJVQPQWQZXDN37VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Space-Efficient Approach towards Distantly Homologous Protein Similarity Searches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.CE","authors_text":"Akash Nag, Sunil Karforma","submitted_at":"2015-08-25T16:58:35Z","abstract_excerpt":"Protein similarity searches are a routine job for molecular biologists where a query sequence of amino acids needs to be compared and ranked against an ever-growing database of proteins. All available algorithms in this field can be grouped into two categories, either solving the problem using sequence alignment through dynamic programming, or, employing certain heuristic measures to perform an initial screening followed by applying an optimal sequence alignment algorithm to the closest matching candidates. While the first approach suffers from huge time and space demands, the latter approach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06561","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-18T01:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiyIrnZz82/y8AHqNDESLb+1N11Vxjzv/XU3s8V0TEqfqWrtzal3YCbip68HWZ16NA3UcWCplKnfOSXnUU+IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:03:07.134778Z"},"content_sha256":"2036ac9fced38c22eada3bc77ceb4939d72f176798e1f14f9bec1582ce13f509","schema_version":"1.0","event_id":"sha256:2036ac9fced38c22eada3bc77ceb4939d72f176798e1f14f9bec1582ce13f509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXENNOW7I4QJVQPQWQZXDN37VO/bundle.json","state_url":"https://pith.science/pith/BXENNOW7I4QJVQPQWQZXDN37VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXENNOW7I4QJVQPQWQZXDN37VO/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-02T22:03:07Z","links":{"resolver":"https://pith.science/pith/BXENNOW7I4QJVQPQWQZXDN37VO","bundle":"https://pith.science/pith/BXENNOW7I4QJVQPQWQZXDN37VO/bundle.json","state":"https://pith.science/pith/BXENNOW7I4QJVQPQWQZXDN37VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXENNOW7I4QJVQPQWQZXDN37VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BXENNOW7I4QJVQPQWQZXDN37VO","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":"f3d08e104570a45df5b29b001bf0d7efbb753bbaaf023df780cc9c58b815c27b","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-25T16:58:35Z","title_canon_sha256":"91bfa1e28836c0f0d5ae91a8af4578b733bfb5afa29ca89a2f88e88bee451324"},"schema_version":"1.0","source":{"id":"1508.06561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06561","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06561v1","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06561","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"BXENNOW7I4QJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BXENNOW7I4QJVQPQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BXENNOW7","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:2036ac9fced38c22eada3bc77ceb4939d72f176798e1f14f9bec1582ce13f509","target":"graph","created_at":"2026-05-18T01:34:42Z","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":"Protein similarity searches are a routine job for molecular biologists where a query sequence of amino acids needs to be compared and ranked against an ever-growing database of proteins. All available algorithms in this field can be grouped into two categories, either solving the problem using sequence alignment through dynamic programming, or, employing certain heuristic measures to perform an initial screening followed by applying an optimal sequence alignment algorithm to the closest matching candidates. While the first approach suffers from huge time and space demands, the latter approach ","authors_text":"Akash Nag, Sunil Karforma","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-25T16:58:35Z","title":"A Space-Efficient Approach towards Distantly Homologous Protein Similarity Searches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06561","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:793379909348fb5006961f707af653e154c28b5e8d6f2b31f6680ae5c29a8611","target":"record","created_at":"2026-05-18T01:34:42Z","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":"f3d08e104570a45df5b29b001bf0d7efbb753bbaaf023df780cc9c58b815c27b","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-25T16:58:35Z","title_canon_sha256":"91bfa1e28836c0f0d5ae91a8af4578b733bfb5afa29ca89a2f88e88bee451324"},"schema_version":"1.0","source":{"id":"1508.06561","kind":"arxiv","version":1}},"canonical_sha256":"0dc8d6badf47209ac1f0b43371b77fabbfc12cd2c0fbe3118c36454be8ba88e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dc8d6badf47209ac1f0b43371b77fabbfc12cd2c0fbe3118c36454be8ba88e0","first_computed_at":"2026-05-18T01:34:42.652552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:42.652552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOPARB3oXUkQxJtGcWXARExZ+5M5b/M6EG/ThOKPHsdSAAtRqyh4CRZpxhF02pWm2k/YXB3GHkM2Csk/X028Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:42.653416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:793379909348fb5006961f707af653e154c28b5e8d6f2b31f6680ae5c29a8611","sha256:2036ac9fced38c22eada3bc77ceb4939d72f176798e1f14f9bec1582ce13f509"],"state_sha256":"80d6bf1720b380af6db712e66ca73325d238a06a9db17e3c59623c2e1fdf2876"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lx6DhE7FXpIRmBFlDWNUFFy4XBOwsu/B3Cs34GhErzEdfv3J7F2MlKuMvQ7rqfFlyBxLZjUmO4CvfCsw3++WAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:03:07.137190Z","bundle_sha256":"34e3b971d7abe72aa8725b77ff066e1e7cf3c41bb9209a980dce4fb682969766"}}