{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RLW2O4NC4AG57EEEBA5Y2FPKPK","short_pith_number":"pith:RLW2O4NC","schema_version":"1.0","canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","source":{"kind":"arxiv","id":"1812.09353","version":1},"attestation_state":"computed","paper":{"title":"A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Bing Su, Guohui Lin, Longcheng Liu, Randy Goebel, Weitian Tong, Yao Xu, Yong Chen","submitted_at":"2018-12-21T19:45:54Z","abstract_excerpt":"Given a graph $G = (V, E)$, the $3$-path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most $3$ to cover all the vertices of $V$. It is different from but closely related to the well-known $3$-set cover problem. The best known approximation algorithm for the $3$-path partition problem was proposed recently and has a ratio $13/9$. Here we present a local search algorithm and show, by an amortized analysis, that it is a $4/3$-approximation. This ratio matches up to the best approximation ratio for the $3$-set cover problem."},"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":"1812.09353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-21T19:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"ca3895d470fb984903adbf59130e5026d804dc22b0582e24e47cd818e9ec2537","abstract_canon_sha256":"56fa473559789f9a62b920784d1193ac7d453e4712a7c2332b44221f1de25b3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.327604Z","signature_b64":"6I61y6gJfinZRxjX9ocXTSABgT23fpM6jmT5gXTKTSCKugV2BXNdjFr4D1vkzciVsvnZKAujLvWDH1SByeb/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","last_reissued_at":"2026-05-17T23:57:30.327043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.327043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Bing Su, Guohui Lin, Longcheng Liu, Randy Goebel, Weitian Tong, Yao Xu, Yong Chen","submitted_at":"2018-12-21T19:45:54Z","abstract_excerpt":"Given a graph $G = (V, E)$, the $3$-path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most $3$ to cover all the vertices of $V$. It is different from but closely related to the well-known $3$-set cover problem. The best known approximation algorithm for the $3$-path partition problem was proposed recently and has a ratio $13/9$. Here we present a local search algorithm and show, by an amortized analysis, that it is a $4/3$-approximation. This ratio matches up to the best approximation ratio for the $3$-set cover problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09353","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":"1812.09353","created_at":"2026-05-17T23:57:30.327111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09353v1","created_at":"2026-05-17T23:57:30.327111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09353","created_at":"2026-05-17T23:57:30.327111+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLW2O4NC4AG5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLW2O4NC4AG57EEE","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLW2O4NC","created_at":"2026-05-18T12:32:50.500415+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/RLW2O4NC4AG57EEEBA5Y2FPKPK","json":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK.json","graph_json":"https://pith.science/api/pith-number/RLW2O4NC4AG57EEEBA5Y2FPKPK/graph.json","events_json":"https://pith.science/api/pith-number/RLW2O4NC4AG57EEEBA5Y2FPKPK/events.json","paper":"https://pith.science/paper/RLW2O4NC"},"agent_actions":{"view_html":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK","download_json":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK.json","view_paper":"https://pith.science/paper/RLW2O4NC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09353&json=true","fetch_graph":"https://pith.science/api/pith-number/RLW2O4NC4AG57EEEBA5Y2FPKPK/graph.json","fetch_events":"https://pith.science/api/pith-number/RLW2O4NC4AG57EEEBA5Y2FPKPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/action/storage_attestation","attest_author":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/action/author_attestation","sign_citation":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/action/citation_signature","submit_replication":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/action/replication_record"}},"created_at":"2026-05-17T23:57:30.327111+00:00","updated_at":"2026-05-17T23:57:30.327111+00:00"}