{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BBTOGGF6NOVPAMXGCKH2OXQZHN","short_pith_number":"pith:BBTOGGF6","schema_version":"1.0","canonical_sha256":"0866e318be6baaf032e6128fa75e193b7de7b8ff0aca030871b55e0901787033","source":{"kind":"arxiv","id":"1909.00899","version":1},"attestation_state":"computed","paper":{"title":"De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Roman Snytsar","submitted_at":"2019-09-03T00:37:56Z","abstract_excerpt":"Striped variation of the Smith-Waterman algorithm is known as extremely efficient and easily adaptable for the SIMD architectures. However, the potential for improvement has not been exhausted yet. The popular Lazy-F loop heuristic requires additional memory access operations, and the worst-case performance of the loop could be as bad as the nonvectorized version. We demonstrate the progression of the lazy-F loop transformations that improve the loop performance, and ultimately eliminate the loop completely. Our algorithm achieves the best asymptotic performance of all scan-based SW algorithms"},"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":"1909.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-03T00:37:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ddf2e5fbf52ef70a6b4cd8ddfcb8fde42d8d19f8e5c90161635a3da226cc5983","abstract_canon_sha256":"38dfda6b3797d9e771fff5e86d9049c431df24f6251d7c1a076a088327ebe0d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:13.998907Z","signature_b64":"IcPJI6mdchM8BFtFFQ8cqiHXqZ2Hr/yc6hWgIwwIPWDA/pEeRQhMLMJroGm8NanAvQvyD4rmK2jmMTVfYZvsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0866e318be6baaf032e6128fa75e193b7de7b8ff0aca030871b55e0901787033","last_reissued_at":"2026-07-05T00:01:13.998484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:13.998484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Roman Snytsar","submitted_at":"2019-09-03T00:37:56Z","abstract_excerpt":"Striped variation of the Smith-Waterman algorithm is known as extremely efficient and easily adaptable for the SIMD architectures. However, the potential for improvement has not been exhausted yet. The popular Lazy-F loop heuristic requires additional memory access operations, and the worst-case performance of the loop could be as bad as the nonvectorized version. We demonstrate the progression of the lazy-F loop transformations that improve the loop performance, and ultimately eliminate the loop completely. Our algorithm achieves the best asymptotic performance of all scan-based SW algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00899","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00899/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.00899","created_at":"2026-07-05T00:01:13.998540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00899v1","created_at":"2026-07-05T00:01:13.998540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00899","created_at":"2026-07-05T00:01:13.998540+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBTOGGF6NOVP","created_at":"2026-07-05T00:01:13.998540+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBTOGGF6NOVPAMXG","created_at":"2026-07-05T00:01:13.998540+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBTOGGF6","created_at":"2026-07-05T00:01:13.998540+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/BBTOGGF6NOVPAMXGCKH2OXQZHN","json":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN.json","graph_json":"https://pith.science/api/pith-number/BBTOGGF6NOVPAMXGCKH2OXQZHN/graph.json","events_json":"https://pith.science/api/pith-number/BBTOGGF6NOVPAMXGCKH2OXQZHN/events.json","paper":"https://pith.science/paper/BBTOGGF6"},"agent_actions":{"view_html":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN","download_json":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN.json","view_paper":"https://pith.science/paper/BBTOGGF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00899&json=true","fetch_graph":"https://pith.science/api/pith-number/BBTOGGF6NOVPAMXGCKH2OXQZHN/graph.json","fetch_events":"https://pith.science/api/pith-number/BBTOGGF6NOVPAMXGCKH2OXQZHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN/action/storage_attestation","attest_author":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN/action/author_attestation","sign_citation":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN/action/citation_signature","submit_replication":"https://pith.science/pith/BBTOGGF6NOVPAMXGCKH2OXQZHN/action/replication_record"}},"created_at":"2026-07-05T00:01:13.998540+00:00","updated_at":"2026-07-05T00:01:13.998540+00:00"}