{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XJY2DKUIVDLSK4UUMNJXINTZWU","short_pith_number":"pith:XJY2DKUI","schema_version":"1.0","canonical_sha256":"ba71a1aa88a8d72572946353743679b5312ce8040be8340adc254d314fbef9bc","source":{"kind":"arxiv","id":"2207.09765","version":2},"attestation_state":"computed","paper":{"title":"ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-Efficient Genome Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-bio.GN","q-bio.QM"],"primary_cat":"cs.AR","authors_text":"Bharathwaj Suresh, Can Firtina, Damla Senol Cali, Gurpreet S. Kalsi, Jeremie Kim, Joel Lindegger, Juan G\\'omez Luna, Kamlesh Pillai, Meryem Banu Cavlak, Mohammed Alser, Onur Mutlu, Sreenivas Subramoney, Taha Shahroodi","submitted_at":"2022-07-20T09:16:12Z","abstract_excerpt":"Profile hidden Markov models (pHMMs) are widely employed in various bioinformatics applications to identify similarities between biological sequences, such as DNA or protein sequences. In pHMMs, sequences are represented as graph structures. These probabilities are subsequently used to compute the similarity score between a sequence and a pHMM graph. The Baum-Welch algorithm, a prevalent and highly accurate method, utilizes these probabilities to optimize and compute similarity scores. However, the Baum-Welch algorithm is computationally intensive, and existing solutions offer either software-"},"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":"2207.09765","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2022-07-20T09:16:12Z","cross_cats_sorted":["cs.AI","cs.LG","q-bio.GN","q-bio.QM"],"title_canon_sha256":"521e82721a29ca3d370cfb8c8ed0960499d6875122e601cfd5ad22839f108dd9","abstract_canon_sha256":"0a16042665bb8710652f637dbd402dace2c7cc0518a96f364d773fd3afa0264f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:17.985538Z","signature_b64":"1Yj4GPPwfdMYYiLAHGBWiYd/t4+yHBlWSyxbu74DceGyBTspiUhNmQtQoCH0D4cGVeb4J5/R8jjoeahaOJQlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba71a1aa88a8d72572946353743679b5312ce8040be8340adc254d314fbef9bc","last_reissued_at":"2026-07-05T07:03:17.984993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:17.984993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-Efficient Genome Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-bio.GN","q-bio.QM"],"primary_cat":"cs.AR","authors_text":"Bharathwaj Suresh, Can Firtina, Damla Senol Cali, Gurpreet S. Kalsi, Jeremie Kim, Joel Lindegger, Juan G\\'omez Luna, Kamlesh Pillai, Meryem Banu Cavlak, Mohammed Alser, Onur Mutlu, Sreenivas Subramoney, Taha Shahroodi","submitted_at":"2022-07-20T09:16:12Z","abstract_excerpt":"Profile hidden Markov models (pHMMs) are widely employed in various bioinformatics applications to identify similarities between biological sequences, such as DNA or protein sequences. In pHMMs, sequences are represented as graph structures. These probabilities are subsequently used to compute the similarity score between a sequence and a pHMM graph. The Baum-Welch algorithm, a prevalent and highly accurate method, utilizes these probabilities to optimize and compute similarity scores. However, the Baum-Welch algorithm is computationally intensive, and existing solutions offer either software-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09765","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.09765/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":"2207.09765","created_at":"2026-07-05T07:03:17.985050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09765v2","created_at":"2026-07-05T07:03:17.985050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09765","created_at":"2026-07-05T07:03:17.985050+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJY2DKUIVDLS","created_at":"2026-07-05T07:03:17.985050+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJY2DKUIVDLSK4UU","created_at":"2026-07-05T07:03:17.985050+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJY2DKUI","created_at":"2026-07-05T07:03:17.985050+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/XJY2DKUIVDLSK4UUMNJXINTZWU","json":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU.json","graph_json":"https://pith.science/api/pith-number/XJY2DKUIVDLSK4UUMNJXINTZWU/graph.json","events_json":"https://pith.science/api/pith-number/XJY2DKUIVDLSK4UUMNJXINTZWU/events.json","paper":"https://pith.science/paper/XJY2DKUI"},"agent_actions":{"view_html":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU","download_json":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU.json","view_paper":"https://pith.science/paper/XJY2DKUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09765&json=true","fetch_graph":"https://pith.science/api/pith-number/XJY2DKUIVDLSK4UUMNJXINTZWU/graph.json","fetch_events":"https://pith.science/api/pith-number/XJY2DKUIVDLSK4UUMNJXINTZWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU/action/storage_attestation","attest_author":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU/action/author_attestation","sign_citation":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU/action/citation_signature","submit_replication":"https://pith.science/pith/XJY2DKUIVDLSK4UUMNJXINTZWU/action/replication_record"}},"created_at":"2026-07-05T07:03:17.985050+00:00","updated_at":"2026-07-05T07:03:17.985050+00:00"}