{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JGYSJ3LBXX7EXLACBUP6HVOQ7G","short_pith_number":"pith:JGYSJ3LB","schema_version":"1.0","canonical_sha256":"49b124ed61bdfe4bac020d1fe3d5d0f99cf6d852b638356ec6b01b1137c63aa5","source":{"kind":"arxiv","id":"1310.5037","version":1},"attestation_state":"computed","paper":{"title":"Covering Pairs in Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Niko Beerenwinkel, Paola Bonizzoni, Riccardo Dondi, Stefano Beretta, Yuri Pirola","submitted_at":"2013-10-18T14:33:06Z","abstract_excerpt":"The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexity of two constrained variants of Minimum Path Cover motivated by the recent introduction of next-generation sequencing technologies in bioinformatics. The first problem (MinPCRP), given a DAG and a set of pairs of vertices, asks for a minimum cardinality set of paths \"covering\" all the vertices such that both "},"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":"1310.5037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-18T14:33:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"502f8aa989fbdc2d03a1f47e7cfd7d241a9f798cac1b0a49cfbe41dc8f4705ab","abstract_canon_sha256":"49e16cb8cecede6cbc208b45ae576738f78319214a584575f5823b86c8d0796d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:06.441031Z","signature_b64":"Z0aJLREbZ8ZmFgk/0cpDDpZYw+YqedDo7hWQ+XqSdb0yZcfrMdBxyc84ic4Y+e2b4wTDh34/XLXZyTfnRU7GBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49b124ed61bdfe4bac020d1fe3d5d0f99cf6d852b638356ec6b01b1137c63aa5","last_reissued_at":"2026-05-18T02:57:06.440555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:06.440555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Pairs in Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Niko Beerenwinkel, Paola Bonizzoni, Riccardo Dondi, Stefano Beretta, Yuri Pirola","submitted_at":"2013-10-18T14:33:06Z","abstract_excerpt":"The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexity of two constrained variants of Minimum Path Cover motivated by the recent introduction of next-generation sequencing technologies in bioinformatics. The first problem (MinPCRP), given a DAG and a set of pairs of vertices, asks for a minimum cardinality set of paths \"covering\" all the vertices such that both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5037","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":"1310.5037","created_at":"2026-05-18T02:57:06.440624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5037v1","created_at":"2026-05-18T02:57:06.440624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5037","created_at":"2026-05-18T02:57:06.440624+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGYSJ3LBXX7E","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGYSJ3LBXX7EXLAC","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGYSJ3LB","created_at":"2026-05-18T12:27:49.015174+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/JGYSJ3LBXX7EXLACBUP6HVOQ7G","json":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G.json","graph_json":"https://pith.science/api/pith-number/JGYSJ3LBXX7EXLACBUP6HVOQ7G/graph.json","events_json":"https://pith.science/api/pith-number/JGYSJ3LBXX7EXLACBUP6HVOQ7G/events.json","paper":"https://pith.science/paper/JGYSJ3LB"},"agent_actions":{"view_html":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G","download_json":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G.json","view_paper":"https://pith.science/paper/JGYSJ3LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5037&json=true","fetch_graph":"https://pith.science/api/pith-number/JGYSJ3LBXX7EXLACBUP6HVOQ7G/graph.json","fetch_events":"https://pith.science/api/pith-number/JGYSJ3LBXX7EXLACBUP6HVOQ7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G/action/storage_attestation","attest_author":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G/action/author_attestation","sign_citation":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G/action/citation_signature","submit_replication":"https://pith.science/pith/JGYSJ3LBXX7EXLACBUP6HVOQ7G/action/replication_record"}},"created_at":"2026-05-18T02:57:06.440624+00:00","updated_at":"2026-05-18T02:57:06.440624+00:00"}