{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DODKZT7WGRDWSDABCQXCL4TT26","short_pith_number":"pith:DODKZT7W","schema_version":"1.0","canonical_sha256":"1b86accff63447690c01142e25f273d7b8a569ccecca8b5ff50d5b64eb09abe9","source":{"kind":"arxiv","id":"1807.06867","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms on $k-$ cycle covering and $k-$ clique covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Zhongzheng Tang, Zhuo Diao","submitted_at":"2018-07-18T11:15:35Z","abstract_excerpt":"Given a weighted graph $G(V,E)$ with weight $\\mathbf w: E\\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number on $k-$cycle, denoted by $\\tau_{k}(G_{w})$. In this paper, we design a $k-1/2$ approximation algorithm for the weighted covering number on $k-$cycle when $k$ is odd.\n  Given a weighted graph $G(V,E)$ with weight $\\mathbf w: E\\rightarrow Z^{|E|}_{+}$. A $k-$clique covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$clique. The minimum weight of $"},"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":"1807.06867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-18T11:15:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"21ef8a43e08fd1cab6764134322b75e890236ca84b85afe738d8168caa4eabd6","abstract_canon_sha256":"bab9c552f0757c45f0ea882813f6648fe0ce090eb35cce1f188771364fd0e0c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.506553Z","signature_b64":"y7NcE/SCpzz4LN1PuktCMvYxrTezgR19DJjQE2kFRnxhcDZENvKGvQbrJ3Nk0Mq2QevE0JCNUWuvFdDIZ0FMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b86accff63447690c01142e25f273d7b8a569ccecca8b5ff50d5b64eb09abe9","last_reissued_at":"2026-05-18T00:10:25.505913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.505913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms on $k-$ cycle covering and $k-$ clique covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Zhongzheng Tang, Zhuo Diao","submitted_at":"2018-07-18T11:15:35Z","abstract_excerpt":"Given a weighted graph $G(V,E)$ with weight $\\mathbf w: E\\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number on $k-$cycle, denoted by $\\tau_{k}(G_{w})$. In this paper, we design a $k-1/2$ approximation algorithm for the weighted covering number on $k-$cycle when $k$ is odd.\n  Given a weighted graph $G(V,E)$ with weight $\\mathbf w: E\\rightarrow Z^{|E|}_{+}$. A $k-$clique covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$clique. The minimum weight of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06867","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":"1807.06867","created_at":"2026-05-18T00:10:25.506016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06867v1","created_at":"2026-05-18T00:10:25.506016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06867","created_at":"2026-05-18T00:10:25.506016+00:00"},{"alias_kind":"pith_short_12","alias_value":"DODKZT7WGRDW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DODKZT7WGRDWSDAB","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DODKZT7W","created_at":"2026-05-18T12:32:19.392346+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/DODKZT7WGRDWSDABCQXCL4TT26","json":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26.json","graph_json":"https://pith.science/api/pith-number/DODKZT7WGRDWSDABCQXCL4TT26/graph.json","events_json":"https://pith.science/api/pith-number/DODKZT7WGRDWSDABCQXCL4TT26/events.json","paper":"https://pith.science/paper/DODKZT7W"},"agent_actions":{"view_html":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26","download_json":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26.json","view_paper":"https://pith.science/paper/DODKZT7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06867&json=true","fetch_graph":"https://pith.science/api/pith-number/DODKZT7WGRDWSDABCQXCL4TT26/graph.json","fetch_events":"https://pith.science/api/pith-number/DODKZT7WGRDWSDABCQXCL4TT26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26/action/storage_attestation","attest_author":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26/action/author_attestation","sign_citation":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26/action/citation_signature","submit_replication":"https://pith.science/pith/DODKZT7WGRDWSDABCQXCL4TT26/action/replication_record"}},"created_at":"2026-05-18T00:10:25.506016+00:00","updated_at":"2026-05-18T00:10:25.506016+00:00"}