{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MVEUQZPOPBFUKRO4HKSJAM3GY5","short_pith_number":"pith:MVEUQZPO","schema_version":"1.0","canonical_sha256":"65494865ee784b4545dc3aa4903366c758bcf887f857aaab9c8253894ecfe823","source":{"kind":"arxiv","id":"1901.05959","version":1},"attestation_state":"computed","paper":{"title":"BioSEAL: In-Memory Biological Sequence Alignment Accelerator for Large-Scale Genomic Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"Leonid Yavits, Ran Ginosar, Roman Kaplan","submitted_at":"2019-01-17T10:13:22Z","abstract_excerpt":"Genome sequences contain hundreds of millions of DNA base pairs. Finding the degree of similarity between two genomes requires executing a compute-intensive dynamic programming algorithm, such as Smith-Waterman. Traditional von Neumann architectures have limited parallelism and cannot provide an efficient solution for large-scale genomic data. Approximate heuristic methods (e.g. BLAST) are commonly used. However, they are suboptimal and still compute-intensive. In this work, we present BioSEAL, a Biological SEquence ALignment accelerator. BioSEAL is a massively parallel non-von Neumann process"},"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":"1901.05959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-01-17T10:13:22Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"0e08903ef668d90b5f33bd31b28a44db6b343be35113e46ac239562cbce4721f","abstract_canon_sha256":"fedd872f161c79862e857b9cd5efbcff0b0a42a8fea0de67c97499f84d9e9e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:04.899949Z","signature_b64":"MHXs4t9Zn46b8kJTh6C+D2LJjfbVpP2JYru7k0YPgpmpI596FthCruHShlz89M2NnRuybyuoQLxYVw9VndppAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65494865ee784b4545dc3aa4903366c758bcf887f857aaab9c8253894ecfe823","last_reissued_at":"2026-05-17T23:56:04.899266Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:04.899266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BioSEAL: In-Memory Biological Sequence Alignment Accelerator for Large-Scale Genomic Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"Leonid Yavits, Ran Ginosar, Roman Kaplan","submitted_at":"2019-01-17T10:13:22Z","abstract_excerpt":"Genome sequences contain hundreds of millions of DNA base pairs. Finding the degree of similarity between two genomes requires executing a compute-intensive dynamic programming algorithm, such as Smith-Waterman. Traditional von Neumann architectures have limited parallelism and cannot provide an efficient solution for large-scale genomic data. Approximate heuristic methods (e.g. BLAST) are commonly used. However, they are suboptimal and still compute-intensive. In this work, we present BioSEAL, a Biological SEquence ALignment accelerator. BioSEAL is a massively parallel non-von Neumann process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05959","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":"1901.05959","created_at":"2026-05-17T23:56:04.899391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05959v1","created_at":"2026-05-17T23:56:04.899391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05959","created_at":"2026-05-17T23:56:04.899391+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVEUQZPOPBFU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVEUQZPOPBFUKRO4","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVEUQZPO","created_at":"2026-05-18T12:33:24.271573+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/MVEUQZPOPBFUKRO4HKSJAM3GY5","json":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5.json","graph_json":"https://pith.science/api/pith-number/MVEUQZPOPBFUKRO4HKSJAM3GY5/graph.json","events_json":"https://pith.science/api/pith-number/MVEUQZPOPBFUKRO4HKSJAM3GY5/events.json","paper":"https://pith.science/paper/MVEUQZPO"},"agent_actions":{"view_html":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5","download_json":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5.json","view_paper":"https://pith.science/paper/MVEUQZPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05959&json=true","fetch_graph":"https://pith.science/api/pith-number/MVEUQZPOPBFUKRO4HKSJAM3GY5/graph.json","fetch_events":"https://pith.science/api/pith-number/MVEUQZPOPBFUKRO4HKSJAM3GY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5/action/storage_attestation","attest_author":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5/action/author_attestation","sign_citation":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5/action/citation_signature","submit_replication":"https://pith.science/pith/MVEUQZPOPBFUKRO4HKSJAM3GY5/action/replication_record"}},"created_at":"2026-05-17T23:56:04.899391+00:00","updated_at":"2026-05-17T23:56:04.899391+00:00"}