{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RLW2O4NC4AG57EEEBA5Y2FPKPK","short_pith_number":"pith:RLW2O4NC","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"},"canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","source":{"kind":"arxiv","id":"1812.09353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09353","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09353v1","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09353","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"RLW2O4NC4AG5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RLW2O4NC4AG57EEE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RLW2O4NC","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RLW2O4NC4AG57EEEBA5Y2FPKPK","target":"record","payload":{"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"},"canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","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"},"source_kind":"arxiv","source_id":"1812.09353","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Afu8n1YijTR4vvpn2RjX3kMYqWVWijVR/JZecEAquDEyDcpVLyenXCESuERvFuiaBNzGZNepOMfJJmuNnMT8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:57:06.706756Z"},"content_sha256":"291c3ae452604f0fb1a15e444a95b1f13823ab0b1404b5c9b9d9df7d9968fe0e","schema_version":"1.0","event_id":"sha256:291c3ae452604f0fb1a15e444a95b1f13823ab0b1404b5c9b9d9df7d9968fe0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RLW2O4NC4AG57EEEBA5Y2FPKPK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XG04cYlalzLIbac8Er3U8lfK04FaO9dIdkEE0jlVbtj6fWjqz0nYurKeYXollbTA7grmqS4YcQgT9bVZANoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:57:06.707184Z"},"content_sha256":"6038001b1c30efe303d40959dc7a45529dc17991051e173b897c22c97a94ed0e","schema_version":"1.0","event_id":"sha256:6038001b1c30efe303d40959dc7a45529dc17991051e173b897c22c97a94ed0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/bundle.json","state_url":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T19:57:06Z","links":{"resolver":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK","bundle":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/bundle.json","state":"https://pith.science/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLW2O4NC4AG57EEEBA5Y2FPKPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RLW2O4NC4AG57EEEBA5Y2FPKPK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"56fa473559789f9a62b920784d1193ac7d453e4712a7c2332b44221f1de25b3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-21T19:45:54Z","title_canon_sha256":"ca3895d470fb984903adbf59130e5026d804dc22b0582e24e47cd818e9ec2537"},"schema_version":"1.0","source":{"id":"1812.09353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09353","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09353v1","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09353","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"RLW2O4NC4AG5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RLW2O4NC4AG57EEE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RLW2O4NC","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:6038001b1c30efe303d40959dc7a45529dc17991051e173b897c22c97a94ed0e","target":"graph","created_at":"2026-05-17T23:57:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"An Zhang, Bing Su, Guohui Lin, Longcheng Liu, Randy Goebel, Weitian Tong, Yao Xu, Yong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-21T19:45:54Z","title":"A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09353","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:291c3ae452604f0fb1a15e444a95b1f13823ab0b1404b5c9b9d9df7d9968fe0e","target":"record","created_at":"2026-05-17T23:57:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"56fa473559789f9a62b920784d1193ac7d453e4712a7c2332b44221f1de25b3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-21T19:45:54Z","title_canon_sha256":"ca3895d470fb984903adbf59130e5026d804dc22b0582e24e47cd818e9ec2537"},"schema_version":"1.0","source":{"id":"1812.09353","kind":"arxiv","version":1}},"canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aeda771a2e00ddf9084083b8d15ea7aa76bcadbeb49f39fdf6d0a0bb2bb352b","first_computed_at":"2026-05-17T23:57:30.327043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:30.327043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6I61y6gJfinZRxjX9ocXTSABgT23fpM6jmT5gXTKTSCKugV2BXNdjFr4D1vkzciVsvnZKAujLvWDH1SByeb/Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:30.327604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:291c3ae452604f0fb1a15e444a95b1f13823ab0b1404b5c9b9d9df7d9968fe0e","sha256:6038001b1c30efe303d40959dc7a45529dc17991051e173b897c22c97a94ed0e"],"state_sha256":"cceb06dcc484e159c572f5c51bb4c5569bd67c9b5d56cc1abd6ea65f9bfa2bae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neBmsIID3moDf6RekVnAKVzbXpMZ/KVfwFz3HBaqfM4rUuLRKvISittF343Fj2tRAh5uCfuaKD+zoLk1qKVJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T19:57:06.710438Z","bundle_sha256":"0034421d64c358455ce1cb1ab6b64cd37fde3f908f5994502cbdc05f8af58ee9"}}