{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:NXQOCXMRF6M7DW52OHDHXEHAI4","short_pith_number":"pith:NXQOCXMR","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"},"canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","source":{"kind":"arxiv","id":"0705.1750","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1750","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1750v6","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1750","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"NXQOCXMRF6M7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"NXQOCXMRF6M7DW52","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"NXQOCXMR","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:NXQOCXMRF6M7DW52OHDHXEHAI4","target":"record","payload":{"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"},"canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","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"},"source_kind":"arxiv","source_id":"0705.1750","source_version":6,"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-18T04:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPo0s7paPw+zxxelSAO0vcPQqlkDXRiMmmrThS6KplxCTvcB5uMIFmaNKP9mdhtQLIVcEhuyjo8vkqBLkmYWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:25.672755Z"},"content_sha256":"329612ab5186a404485227d39e71104dd1bb42414c52c1f73be96c72361cca97","schema_version":"1.0","event_id":"sha256:329612ab5186a404485227d39e71104dd1bb42414c52c1f73be96c72361cca97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:NXQOCXMRF6M7DW52OHDHXEHAI4","target":"graph","payload":{"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"},"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-18T04:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLgFw0F6wcTL+fn9H8eFzbg5n50MSHmmYJO4G0SGlQB8KlWd78CLRziiL2WffwVCSXZ/kPHdu2TAnuD23t7CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:25.673123Z"},"content_sha256":"f18f28ed86d4d4ccd9dcf33fa9061fbd89ca1a42ad7a486d2cdf80fcc1d977d0","schema_version":"1.0","event_id":"sha256:f18f28ed86d4d4ccd9dcf33fa9061fbd89ca1a42ad7a486d2cdf80fcc1d977d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/bundle.json","state_url":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/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-06-05T19:21:25Z","links":{"resolver":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4","bundle":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/bundle.json","state":"https://pith.science/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXQOCXMRF6M7DW52OHDHXEHAI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:NXQOCXMRF6M7DW52OHDHXEHAI4","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":"ec21d58e6d94f51b5e19fd825a2bb4b429190a91bcab1b8f47f54b755949a269","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-05-12T04:18:36Z","title_canon_sha256":"094b8b81214a857785e97cfd2958b906e5ff6222ad65b9ab03ddbd9f190ef9de"},"schema_version":"1.0","source":{"id":"0705.1750","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1750","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1750v6","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1750","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"NXQOCXMRF6M7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"NXQOCXMRF6M7DW52","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"NXQOCXMR","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:f18f28ed86d4d4ccd9dcf33fa9061fbd89ca1a42ad7a486d2cdf80fcc1d977d0","target":"graph","created_at":"2026-05-18T04:27:25Z","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":"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 ","authors_text":"Peng Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-05-12T04:18:36Z","title":"A Tighter Analysis of Setcover Greedy Algorithm for Test Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1750","kind":"arxiv","version":6},"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:329612ab5186a404485227d39e71104dd1bb42414c52c1f73be96c72361cca97","target":"record","created_at":"2026-05-18T04:27:25Z","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":"ec21d58e6d94f51b5e19fd825a2bb4b429190a91bcab1b8f47f54b755949a269","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-05-12T04:18:36Z","title_canon_sha256":"094b8b81214a857785e97cfd2958b906e5ff6222ad65b9ab03ddbd9f190ef9de"},"schema_version":"1.0","source":{"id":"0705.1750","kind":"arxiv","version":6}},"canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de0e15d912f99f1dbba71c67b90e0472d2047d9aa954ebb42a52e350cc97952","first_computed_at":"2026-05-18T04:27:25.844660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:25.844660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O2pCzmpu/Mo1BSM5i3oPN7OTJc/Jwy0bPxc63HSbvhnQBBQQTeDJ60P29n5N6Ms3SJErT5isb3bwlz/EjZSXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:25.845367Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.1750","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:329612ab5186a404485227d39e71104dd1bb42414c52c1f73be96c72361cca97","sha256:f18f28ed86d4d4ccd9dcf33fa9061fbd89ca1a42ad7a486d2cdf80fcc1d977d0"],"state_sha256":"016a400a47ab36092d890095bf8a0eb50fcd481fbd8ea6d9f1c9fb4962ad3e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Gncy+6NtMUORzR+tLexY9D8vzeZd8kOuJFk72W2VQ7tSzUq+ehdRJAkkSA48r4vn/5m6VX6AAH0X4RJ+8dDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:21:25.675292Z","bundle_sha256":"17a4dcbd6d9fd5ff6f23dc9626292b42a301de598051be163d6cb534ff75d385"}}