{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5QMMH35PKU47NFRDHKR4F6MUMJ","short_pith_number":"pith:5QMMH35P","schema_version":"1.0","canonical_sha256":"ec18c3efaf5539f696233aa3c2f99462544b0da07eb2212e0e73fef61f630155","source":{"kind":"arxiv","id":"2606.25738","version":1},"attestation_state":"computed","paper":{"title":"Endeavor: Efficient PairHMM for Detection of DNA Variants in Genome-Scale Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksandar Ilic, Miguel Gra\\c{c}a","submitted_at":"2026-06-24T12:06:25Z","abstract_excerpt":"DNA variant calling represents a key operation in bioinformatics pipelines that aims at identifying genetic variants. Given an evidenced explosion in genomic data availability, there is an urgent need for a high-performant, portable and efficient solution for variant calling, which can further improve our understanding of genomic structure and genetic basis for complex diseases. In its most common formulation, the Pair Hidden Markov Model (PairHMM) algorithm for variant calling stands as the main bottleneck in the pipeline, accounting for up to 70% of the execution time in large-scale genomic "},"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":"2606.25738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-24T12:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"3d15bed4bb39979a71071699cd2a3195327e1b3aef68fb1e36cd6e6a4966fe4d","abstract_canon_sha256":"40d79fc9891d0a75bbd11cce9d1e2281e305b708eaddd714c04f17523c8bc11d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:14.016809Z","signature_b64":"n3/JtGthYj9gOm1AnFHRTTcbhOyGP9d3mKZFZvOjgCjD463XpNtgpT+R/lUPePnlbbTE/M7wy9XQrHwjSamNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec18c3efaf5539f696233aa3c2f99462544b0da07eb2212e0e73fef61f630155","last_reissued_at":"2026-06-25T01:18:14.016429Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:14.016429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Endeavor: Efficient PairHMM for Detection of DNA Variants in Genome-Scale Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksandar Ilic, Miguel Gra\\c{c}a","submitted_at":"2026-06-24T12:06:25Z","abstract_excerpt":"DNA variant calling represents a key operation in bioinformatics pipelines that aims at identifying genetic variants. Given an evidenced explosion in genomic data availability, there is an urgent need for a high-performant, portable and efficient solution for variant calling, which can further improve our understanding of genomic structure and genetic basis for complex diseases. In its most common formulation, the Pair Hidden Markov Model (PairHMM) algorithm for variant calling stands as the main bottleneck in the pipeline, accounting for up to 70% of the execution time in large-scale genomic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25738","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/2606.25738/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":"2606.25738","created_at":"2026-06-25T01:18:14.016492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25738v1","created_at":"2026-06-25T01:18:14.016492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25738","created_at":"2026-06-25T01:18:14.016492+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QMMH35PKU47","created_at":"2026-06-25T01:18:14.016492+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QMMH35PKU47NFRD","created_at":"2026-06-25T01:18:14.016492+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QMMH35P","created_at":"2026-06-25T01:18:14.016492+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/5QMMH35PKU47NFRDHKR4F6MUMJ","json":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ.json","graph_json":"https://pith.science/api/pith-number/5QMMH35PKU47NFRDHKR4F6MUMJ/graph.json","events_json":"https://pith.science/api/pith-number/5QMMH35PKU47NFRDHKR4F6MUMJ/events.json","paper":"https://pith.science/paper/5QMMH35P"},"agent_actions":{"view_html":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ","download_json":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ.json","view_paper":"https://pith.science/paper/5QMMH35P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25738&json=true","fetch_graph":"https://pith.science/api/pith-number/5QMMH35PKU47NFRDHKR4F6MUMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5QMMH35PKU47NFRDHKR4F6MUMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ/action/storage_attestation","attest_author":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ/action/author_attestation","sign_citation":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ/action/citation_signature","submit_replication":"https://pith.science/pith/5QMMH35PKU47NFRDHKR4F6MUMJ/action/replication_record"}},"created_at":"2026-06-25T01:18:14.016492+00:00","updated_at":"2026-06-25T01:18:14.016492+00:00"}