{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VHJEHPH2Y6ABJTVGTFQ7BO32HN","short_pith_number":"pith:VHJEHPH2","schema_version":"1.0","canonical_sha256":"a9d243bcfac78014cea69961f0bb7a3b4eb5cf320685089d077025c638941b2f","source":{"kind":"arxiv","id":"1808.09097","version":1},"attestation_state":"computed","paper":{"title":"On the isometric path partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Manuel","submitted_at":"2018-08-26T11:19:32Z","abstract_excerpt":"The isometric path cover (partition) problem of a graph is to find a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality a minimum isometric path cover (partition). We prove that the isometric path partition problem and the isometric $k$-path partition problem for $k\\geq 3$ are NP-complete on general graphs. Fisher and Fitzpatrick \\cite{FiFi01} have shown that the isometric path cover number of $(r\\times r)$-dimensional grid is $\\lceil 2r/3\\rceil$. We show that the isometric path cover (pa"},"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":"1808.09097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-26T11:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"c701770eb1f06df42d3e1622d6219f459aaae4df45c4e4e8bef1ee5d04ecee22","abstract_canon_sha256":"3c50ccee5d754e293d0697fb66f2c8248255c3964d85c34826ff83fb86a86245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.533155Z","signature_b64":"4iVe61Rzx1ijrUA0PvWyc/I/T1e9mOzhvXbH1WKKe0jKHVMow/Pfr3DwZN+IWdPzh6p5VxwlAQrMg06I4x7MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d243bcfac78014cea69961f0bb7a3b4eb5cf320685089d077025c638941b2f","last_reissued_at":"2026-05-18T00:07:04.532354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.532354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the isometric path partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Manuel","submitted_at":"2018-08-26T11:19:32Z","abstract_excerpt":"The isometric path cover (partition) problem of a graph is to find a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality a minimum isometric path cover (partition). We prove that the isometric path partition problem and the isometric $k$-path partition problem for $k\\geq 3$ are NP-complete on general graphs. Fisher and Fitzpatrick \\cite{FiFi01} have shown that the isometric path cover number of $(r\\times r)$-dimensional grid is $\\lceil 2r/3\\rceil$. We show that the isometric path cover (pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09097","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":"1808.09097","created_at":"2026-05-18T00:07:04.532511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09097v1","created_at":"2026-05-18T00:07:04.532511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09097","created_at":"2026-05-18T00:07:04.532511+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHJEHPH2Y6AB","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHJEHPH2Y6ABJTVG","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHJEHPH2","created_at":"2026-05-18T12:32:59.047623+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/VHJEHPH2Y6ABJTVGTFQ7BO32HN","json":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN.json","graph_json":"https://pith.science/api/pith-number/VHJEHPH2Y6ABJTVGTFQ7BO32HN/graph.json","events_json":"https://pith.science/api/pith-number/VHJEHPH2Y6ABJTVGTFQ7BO32HN/events.json","paper":"https://pith.science/paper/VHJEHPH2"},"agent_actions":{"view_html":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN","download_json":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN.json","view_paper":"https://pith.science/paper/VHJEHPH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09097&json=true","fetch_graph":"https://pith.science/api/pith-number/VHJEHPH2Y6ABJTVGTFQ7BO32HN/graph.json","fetch_events":"https://pith.science/api/pith-number/VHJEHPH2Y6ABJTVGTFQ7BO32HN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN/action/storage_attestation","attest_author":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN/action/author_attestation","sign_citation":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN/action/citation_signature","submit_replication":"https://pith.science/pith/VHJEHPH2Y6ABJTVGTFQ7BO32HN/action/replication_record"}},"created_at":"2026-05-18T00:07:04.532511+00:00","updated_at":"2026-05-18T00:07:04.532511+00:00"}