{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VPA53E7EEOEVUEMIG6JK5NFT5P","short_pith_number":"pith:VPA53E7E","schema_version":"1.0","canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","source":{"kind":"arxiv","id":"1712.03168","version":2},"attestation_state":"computed","paper":{"title":"On optimal policy in the group testing with incomplete identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.OT","authors_text":"Yaakov Malinovsky","submitted_at":"2017-12-08T16:54:22Z","abstract_excerpt":"Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following group testing policy (policy A) is considered: test items together in the groups, if the test outcome of group i of size n_i is negative, then accept all items in this group as good, otherwise discard the group. Then, move to the next group and continue until exact N good items are found. The goal is to find an optimal testing configuration, i.e., group sizes,"},"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":"1712.03168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"7ff78990bd75fb6af3d2811b03248701882488639c2dca9a604fd12e4bef38a2","abstract_canon_sha256":"cb8876b49867a0397ee3804504273623fa02be89db9f20ad4ce9c3c51f7dcb74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:31.195163Z","signature_b64":"KeU+zoE2aAFJOvM9YkSC44nEaWbu/VTtn6kum4Z+9hWhXVgPYVwwgXQOTz/7/RJocfvfoZ7V5xbhVQW3BKrGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","last_reissued_at":"2026-05-18T00:18:31.194645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:31.194645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On optimal policy in the group testing with incomplete identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.OT","authors_text":"Yaakov Malinovsky","submitted_at":"2017-12-08T16:54:22Z","abstract_excerpt":"Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following group testing policy (policy A) is considered: test items together in the groups, if the test outcome of group i of size n_i is negative, then accept all items in this group as good, otherwise discard the group. Then, move to the next group and continue until exact N good items are found. The goal is to find an optimal testing configuration, i.e., group sizes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03168","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.03168","created_at":"2026-05-18T00:18:31.194715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03168v2","created_at":"2026-05-18T00:18:31.194715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03168","created_at":"2026-05-18T00:18:31.194715+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPA53E7EEOEV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPA53E7EEOEVUEMI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPA53E7E","created_at":"2026-05-18T12:31:49.984773+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/VPA53E7EEOEVUEMIG6JK5NFT5P","json":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P.json","graph_json":"https://pith.science/api/pith-number/VPA53E7EEOEVUEMIG6JK5NFT5P/graph.json","events_json":"https://pith.science/api/pith-number/VPA53E7EEOEVUEMIG6JK5NFT5P/events.json","paper":"https://pith.science/paper/VPA53E7E"},"agent_actions":{"view_html":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P","download_json":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P.json","view_paper":"https://pith.science/paper/VPA53E7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03168&json=true","fetch_graph":"https://pith.science/api/pith-number/VPA53E7EEOEVUEMIG6JK5NFT5P/graph.json","fetch_events":"https://pith.science/api/pith-number/VPA53E7EEOEVUEMIG6JK5NFT5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/action/storage_attestation","attest_author":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/action/author_attestation","sign_citation":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/action/citation_signature","submit_replication":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/action/replication_record"}},"created_at":"2026-05-18T00:18:31.194715+00:00","updated_at":"2026-05-18T00:18:31.194715+00:00"}