{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5EASIT5BUZIIQQHFYQU5GDKQD7","short_pith_number":"pith:5EASIT5B","schema_version":"1.0","canonical_sha256":"e901244fa1a6508840e5c429d30d501fd0986bf346d2701d7c34843f7359ae8e","source":{"kind":"arxiv","id":"2607.00118","version":1},"attestation_state":"computed","paper":{"title":"Temporal Path Covers: Dilworth Properties and Parameterized Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aris Pagourtzis, Christos Pergaminelis, Edouard Nemery, Lapo Cioni, Manolis Vasilakis, Sotiris Kanellopoulos","submitted_at":"2026-06-30T19:55:40Z","abstract_excerpt":"The Minimum Temporal Path Cover (TPC) and Minimum Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24]. Both were shown to be NP-hard on temporal DAGs, while the latter is also NP-hard on temporal oriented trees. All tractable cases for T(D)PC established in that paper satisfy a temporal Dilworth property, namely that the size of the minimum T(D)PC is equal to the size of the maximum antichain. This raises a natural question: is T(D)PC polynomial-time solvable under the promise that the respective Dilworth property holds? In this w"},"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":"2607.00118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T19:55:40Z","cross_cats_sorted":[],"title_canon_sha256":"27f42943c1f66eb1c34bb34aec0c8eaff544f3593dd81b34162a21640fd4ef95","abstract_canon_sha256":"cdee9543d437a06b715e190400aecb1c231d63f226ff92eb44bfcef73bc41e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:35.411523Z","signature_b64":"9I10jZA84VIDvzn+UEQuoAm4pcv2Ymip4opNUcebcGS+pQ4mHBWiQQgTRAq0YUwebQv+UprOMzKagWVmykTCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e901244fa1a6508840e5c429d30d501fd0986bf346d2701d7c34843f7359ae8e","last_reissued_at":"2026-07-02T00:18:35.410985Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:35.410985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Path Covers: Dilworth Properties and Parameterized Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aris Pagourtzis, Christos Pergaminelis, Edouard Nemery, Lapo Cioni, Manolis Vasilakis, Sotiris Kanellopoulos","submitted_at":"2026-06-30T19:55:40Z","abstract_excerpt":"The Minimum Temporal Path Cover (TPC) and Minimum Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24]. Both were shown to be NP-hard on temporal DAGs, while the latter is also NP-hard on temporal oriented trees. All tractable cases for T(D)PC established in that paper satisfy a temporal Dilworth property, namely that the size of the minimum T(D)PC is equal to the size of the maximum antichain. This raises a natural question: is T(D)PC polynomial-time solvable under the promise that the respective Dilworth property holds? In this w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00118","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/2607.00118/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":"2607.00118","created_at":"2026-07-02T00:18:35.411067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00118v1","created_at":"2026-07-02T00:18:35.411067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00118","created_at":"2026-07-02T00:18:35.411067+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EASIT5BUZII","created_at":"2026-07-02T00:18:35.411067+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EASIT5BUZIIQQHF","created_at":"2026-07-02T00:18:35.411067+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EASIT5B","created_at":"2026-07-02T00:18:35.411067+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/5EASIT5BUZIIQQHFYQU5GDKQD7","json":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7.json","graph_json":"https://pith.science/api/pith-number/5EASIT5BUZIIQQHFYQU5GDKQD7/graph.json","events_json":"https://pith.science/api/pith-number/5EASIT5BUZIIQQHFYQU5GDKQD7/events.json","paper":"https://pith.science/paper/5EASIT5B"},"agent_actions":{"view_html":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7","download_json":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7.json","view_paper":"https://pith.science/paper/5EASIT5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00118&json=true","fetch_graph":"https://pith.science/api/pith-number/5EASIT5BUZIIQQHFYQU5GDKQD7/graph.json","fetch_events":"https://pith.science/api/pith-number/5EASIT5BUZIIQQHFYQU5GDKQD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7/action/storage_attestation","attest_author":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7/action/author_attestation","sign_citation":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7/action/citation_signature","submit_replication":"https://pith.science/pith/5EASIT5BUZIIQQHFYQU5GDKQD7/action/replication_record"}},"created_at":"2026-07-02T00:18:35.411067+00:00","updated_at":"2026-07-02T00:18:35.411067+00:00"}