{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X6DLHXIAZQQAE2RWHZQJIZ77GS","short_pith_number":"pith:X6DLHXIA","canonical_record":{"source":{"id":"1502.04169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-14T05:49:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9733d8a5878c7072faec61f540df4f740c69e56e73bc1b7a1702c959bd0e28d8","abstract_canon_sha256":"2a58955d6bbde3c56375739d48e0d349e773e3af38c4b3d230d116453b46d0da"},"schema_version":"1.0"},"canonical_sha256":"bf86b3dd00cc20026a363e609467ff34b03dde420c8f4463afb333551bc00314","source":{"kind":"arxiv","id":"1502.04169","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X6DLHXIAZQQAE2RWHZQJIZ77GS","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-14T05:49:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9733d8a5878c7072faec61f540df4f740c69e56e73bc1b7a1702c959bd0e28d8","abstract_canon_sha256":"2a58955d6bbde3c56375739d48e0d349e773e3af38c4b3d230d116453b46d0da"},"schema_version":"1.0"},"canonical_sha256":"bf86b3dd00cc20026a363e609467ff34b03dde420c8f4463afb333551bc00314","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:55.459735Z","signature_b64":"NqvL7ErkjknKxXuvuGgS/hdMySHw2El3+XOnGocWfmDJMqhVTHra3iRTUI14EawhqP+Rl9K3crxlWs6HF3wKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf86b3dd00cc20026a363e609467ff34b03dde420c8f4463afb333551bc00314","last_reissued_at":"2026-05-18T01:19:55.459205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:55.459205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04169","source_version":2,"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-18T01:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1i8tFHx8gRTT7139MfmtO3L9h/7E53NAhz+q1/YjBgdSlzd8iBDzEolKF0um2eaXQgw5uJXg9Gu9re2T+olCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T21:49:07.070572Z"},"content_sha256":"c3a82d9ee29bc1224f56001db2ee9c6182a29d26dd94bed6af89a689698d5c4c","schema_version":"1.0","event_id":"sha256:c3a82d9ee29bc1224f56001db2ee9c6182a29d26dd94bed6af89a689698d5c4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X6DLHXIAZQQAE2RWHZQJIZ77GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Tractable Algorithms for Finding a Subset of Non-defective Items from a Large Population","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhay Sharma, Chandra R. Murthy","submitted_at":"2015-02-14T05:49:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04169","kind":"arxiv","version":2},"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-18T01:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrfBgQmuMVL5r9gJzRp9UM4/6HAcdK+4T4i7TVaED/YsbLIqC4XYHkp3fEPFOAzH0kVBaLNfcewIBhsjkrF6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T21:49:07.070921Z"},"content_sha256":"825a53aa8f4baed83cc91a9cab6b7486cbe59a44b39842c34e63d75a7b8d499e","schema_version":"1.0","event_id":"sha256:825a53aa8f4baed83cc91a9cab6b7486cbe59a44b39842c34e63d75a7b8d499e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/bundle.json","state_url":"https://pith.science/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/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-07-14T21:49:07Z","links":{"resolver":"https://pith.science/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS","bundle":"https://pith.science/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/bundle.json","state":"https://pith.science/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6DLHXIAZQQAE2RWHZQJIZ77GS/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/V4IKbQvalQ45AWBeC55TgixwEIe25kiWCTxRVC45H6J9XUFdwnzmDZeOKM9B7CVSVv9oHHL6GRKZgdHqQxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T21:49:07.072839Z","bundle_sha256":"c5aa173d19fea2f70ad1fedda662305c1429725f1e78e87d47cf4e2aee9411b6"}}