{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NXQOCXMRF6M7DW52OHDHXEHAI4","short_pith_number":"pith:NXQOCXMR","schema_version":"1.0","canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","source":{"kind":"arxiv","id":"0705.1750","version":6},"attestation_state":"computed","paper":{"title":"A Tighter Analysis of Setcover Greedy Algorithm for Test Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peng Cui","submitted_at":"2007-05-12T04:18:36Z","abstract_excerpt":"Setcover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of performance guarantee of this algorithm. The author improves the performance guarantee $2\\ln n$ which derives from set cover problem to $1.1354\\ln n$ by applying the potential function technique. In addition, the author gives a nontrivial lower bound $1.0004609\\ln n$ of performance guarantee of this algorithm. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better "},"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":"0705.1750","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-05-12T04:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"094b8b81214a857785e97cfd2958b906e5ff6222ad65b9ab03ddbd9f190ef9de","abstract_canon_sha256":"ec21d58e6d94f51b5e19fd825a2bb4b429190a91bcab1b8f47f54b755949a269"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:25.845367Z","signature_b64":"O2pCzmpu/Mo1BSM5i3oPN7OTJc/Jwy0bPxc63HSbvhnQBBQQTeDJ60P29n5N6Ms3SJErT5isb3bwlz/EjZSXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","last_reissued_at":"2026-05-18T04:27:25.844660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:25.844660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tighter Analysis of Setcover Greedy Algorithm for Test Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peng Cui","submitted_at":"2007-05-12T04:18:36Z","abstract_excerpt":"Setcover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of performance guarantee of this algorithm. The author improves the performance guarantee $2\\ln n$ which derives from set cover problem to $1.1354\\ln n$ by applying the potential function technique. In addition, the author gives a nontrivial lower bound $1.0004609\\ln n$ of performance guarantee of this algorithm. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1750","kind":"arxiv","version":6},"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":"0705.1750","created_at":"2026-05-18T04:27:25.844751+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.1750v6","created_at":"2026-05-18T04:27:25.844751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1750","created_at":"2026-05-18T04:27:25.844751+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXQOCXMRF6M7","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXQOCXMRF6M7DW52","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXQOCXMR","created_at":"2026-05-18T12:25:55.427421+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/NXQOCXMRF6M7DW52OHDHXEHAI4","json":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4.json","graph_json":"https://pith.science/api/pith-number/NXQOCXMRF6M7DW52OHDHXEHAI4/graph.json","events_json":"https://pith.science/api/pith-number/NXQOCXMRF6M7DW52OHDHXEHAI4/events.json","paper":"https://pith.science/paper/NXQOCXMR"},"agent_actions":{"view_html":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4","download_json":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4.json","view_paper":"https://pith.science/paper/NXQOCXMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.1750&json=true","fetch_graph":"https://pith.science/api/pith-number/NXQOCXMRF6M7DW52OHDHXEHAI4/graph.json","fetch_events":"https://pith.science/api/pith-number/NXQOCXMRF6M7DW52OHDHXEHAI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/action/storage_attestation","attest_author":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/action/author_attestation","sign_citation":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/action/citation_signature","submit_replication":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/action/replication_record"}},"created_at":"2026-05-18T04:27:25.844751+00:00","updated_at":"2026-05-18T04:27:25.844751+00:00"}