{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JU5NNK5OQMRLMEKFVGV6GM45XY","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":"c173ded99a6b973f765ccc3f85274e5a020b509fcac7a57ad630806608c2070b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T12:27:27Z","title_canon_sha256":"0b778dd177524b1ec42160c120993eb45861fc5a4872259b1648be9b4767d950"},"schema_version":"1.0","source":{"id":"1309.4953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4953","created_at":"2026-05-18T03:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4953v1","created_at":"2026-05-18T03:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4953","created_at":"2026-05-18T03:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"JU5NNK5OQMRL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JU5NNK5OQMRLMEKF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JU5NNK5O","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:395ecbc78122509b9a0a1838fc7a8a2770d50b30b2806d872fdb1aa1ff6c8fca","target":"graph","created_at":"2026-05-18T03:12:49Z","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":"Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity ?{\\theta}(V 2) and space complexity ?{\\theta}(V + E). We show that our proposed method is more approximate with example and theorem proof. Our algorithm also induces improvement on previous algorithms for the independent","authors_text":"Deepak Puthal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T12:27:27Z","title":"A Near Optimal Approximation Algorithm for Vertex-Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4953","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:bdeb67f1fff1d18c44148914488233323f0566b2800bdf96cd49989427ce09d0","target":"record","created_at":"2026-05-18T03:12:49Z","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":"c173ded99a6b973f765ccc3f85274e5a020b509fcac7a57ad630806608c2070b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T12:27:27Z","title_canon_sha256":"0b778dd177524b1ec42160c120993eb45861fc5a4872259b1648be9b4767d950"},"schema_version":"1.0","source":{"id":"1309.4953","kind":"arxiv","version":1}},"canonical_sha256":"4d3ad6abae8322b61145a9abe3339dbe3b76a1fc7da391e9377526432291911c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d3ad6abae8322b61145a9abe3339dbe3b76a1fc7da391e9377526432291911c","first_computed_at":"2026-05-18T03:12:49.213609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:49.213609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hiJw2dPX/WZ9eZ8t3aQMeiuzNM3E0gGqE6djHc9XYv5eZ2JgcF7n+PtKoZprMw/50b+EgObiZeoQTX2kW0pZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:49.214036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdeb67f1fff1d18c44148914488233323f0566b2800bdf96cd49989427ce09d0","sha256:395ecbc78122509b9a0a1838fc7a8a2770d50b30b2806d872fdb1aa1ff6c8fca"],"state_sha256":"b36e0cadcb0721dd5e902f6b34de7a01f4f4a0a087a77438e568726865c8c970"}