{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2NEYEHY7CYPAHEGY3KT4AYG4ZF","short_pith_number":"pith:2NEYEHY7","schema_version":"1.0","canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","source":{"kind":"arxiv","id":"1705.08754","version":3},"attestation_state":"computed","paper":{"title":"Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Rayan Chikhi, Topi Paavilainen, Travis Gagie, Veli M\\\"akinen","submitted_at":"2017-05-24T13:37:44Z","abstract_excerpt":"Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausible matches between substrings of a read to subpaths of the graph. These anchor matches are then combined to form a (semi-local) alignment of the complete read on a subpath. Co-linear chaining is an algorithmically rigorous approach to combine the anchors. It is a well-known approach for the case of two sequences as inputs. Here we extend the approach so that one of the inputs can be a directed acyclic graph (DAGs), "},"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":"1705.08754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"77c350b2efc1a5b7bca531e3fe7f080710376324f21c364eff615c20e74cf0af","abstract_canon_sha256":"e32fab2aebeaa4023e7c546471f78f93075692ebe33a4a716be30635e1353676"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:01.747228Z","signature_b64":"UrCog/0DbUngPO5Rrzmn2zVLGjtVygL4WC81kjgRonsMeezWG2JeIwp1nrWagrKWMquc1/UKiN01yz0Rik8nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","last_reissued_at":"2026-05-18T00:25:01.746731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:01.746731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Rayan Chikhi, Topi Paavilainen, Travis Gagie, Veli M\\\"akinen","submitted_at":"2017-05-24T13:37:44Z","abstract_excerpt":"Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausible matches between substrings of a read to subpaths of the graph. These anchor matches are then combined to form a (semi-local) alignment of the complete read on a subpath. Co-linear chaining is an algorithmically rigorous approach to combine the anchors. It is a well-known approach for the case of two sequences as inputs. Here we extend the approach so that one of the inputs can be a directed acyclic graph (DAGs), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08754","kind":"arxiv","version":3},"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":"1705.08754","created_at":"2026-05-18T00:25:01.746800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08754v3","created_at":"2026-05-18T00:25:01.746800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08754","created_at":"2026-05-18T00:25:01.746800+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NEYEHY7CYPA","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NEYEHY7CYPAHEGY","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NEYEHY7","created_at":"2026-05-18T12:30:55.937587+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/2NEYEHY7CYPAHEGY3KT4AYG4ZF","json":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF.json","graph_json":"https://pith.science/api/pith-number/2NEYEHY7CYPAHEGY3KT4AYG4ZF/graph.json","events_json":"https://pith.science/api/pith-number/2NEYEHY7CYPAHEGY3KT4AYG4ZF/events.json","paper":"https://pith.science/paper/2NEYEHY7"},"agent_actions":{"view_html":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF","download_json":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF.json","view_paper":"https://pith.science/paper/2NEYEHY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08754&json=true","fetch_graph":"https://pith.science/api/pith-number/2NEYEHY7CYPAHEGY3KT4AYG4ZF/graph.json","fetch_events":"https://pith.science/api/pith-number/2NEYEHY7CYPAHEGY3KT4AYG4ZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/action/storage_attestation","attest_author":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/action/author_attestation","sign_citation":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/action/citation_signature","submit_replication":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/action/replication_record"}},"created_at":"2026-05-18T00:25:01.746800+00:00","updated_at":"2026-05-18T00:25:01.746800+00:00"}