{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X6DLHXIAZQQAE2RWHZQJIZ77GS","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":"2a58955d6bbde3c56375739d48e0d349e773e3af38c4b3d230d116453b46d0da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-14T05:49:55Z","title_canon_sha256":"9733d8a5878c7072faec61f540df4f740c69e56e73bc1b7a1702c959bd0e28d8"},"schema_version":"1.0","source":{"id":"1502.04169","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04169","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04169v2","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04169","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"X6DLHXIAZQQA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X6DLHXIAZQQAE2RW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X6DLHXIA","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:825a53aa8f4baed83cc91a9cab6b7486cbe59a44b39842c34e63d75a7b8d499e","target":"graph","created_at":"2026-05-18T01:19:55Z","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":"In the classical non-adaptive group testing setup, pools of items are tested together, and the main goal of a recovery algorithm is to identify the \"complete defective set\" given the outcomes of different group tests. In contrast, the main goal of a \"non-defective subset recovery\" algorithm is to identify a \"subset\" of non-defective items given the test outcomes. In this paper, we present a suite of computationally efficient and analytically tractable non-defective subset recovery algorithms. By analyzing the probability of error of the algorithms, we obtain bounds on the number of tests requi","authors_text":"Abhay Sharma, Chandra R. Murthy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-14T05:49:55Z","title":"Computationally Tractable Algorithms for Finding a Subset of Non-defective Items from a Large Population"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04169","kind":"arxiv","version":2},"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:c3a82d9ee29bc1224f56001db2ee9c6182a29d26dd94bed6af89a689698d5c4c","target":"record","created_at":"2026-05-18T01:19:55Z","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":"2a58955d6bbde3c56375739d48e0d349e773e3af38c4b3d230d116453b46d0da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-14T05:49:55Z","title_canon_sha256":"9733d8a5878c7072faec61f540df4f740c69e56e73bc1b7a1702c959bd0e28d8"},"schema_version":"1.0","source":{"id":"1502.04169","kind":"arxiv","version":2}},"canonical_sha256":"bf86b3dd00cc20026a363e609467ff34b03dde420c8f4463afb333551bc00314","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf86b3dd00cc20026a363e609467ff34b03dde420c8f4463afb333551bc00314","first_computed_at":"2026-05-18T01:19:55.459205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:55.459205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NqvL7ErkjknKxXuvuGgS/hdMySHw2El3+XOnGocWfmDJMqhVTHra3iRTUI14EawhqP+Rl9K3crxlWs6HF3wKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:55.459735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04169","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a82d9ee29bc1224f56001db2ee9c6182a29d26dd94bed6af89a689698d5c4c","sha256:825a53aa8f4baed83cc91a9cab6b7486cbe59a44b39842c34e63d75a7b8d499e"],"state_sha256":"ca2c7de97e9cf60a7fd5894f843b840aa7547954f4bf230a4cb7a3011e22be83"}