{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DTJVXVBTOVRB4UVSHF4NK5UUSZ","short_pith_number":"pith:DTJVXVBT","schema_version":"1.0","canonical_sha256":"1cd35bd43375621e52b23978d5769496632233e61c11500198e0491217e44575","source":{"kind":"arxiv","id":"1510.02873","version":2},"attestation_state":"computed","paper":{"title":"Group testing schemes from codes and designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Arya Mazumdar","submitted_at":"2015-10-10T04:13:06Z","abstract_excerpt":"In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output indicating whether the group is free of the defective items or contains one or more of them. In this paper we study a relaxation of the combinatorial group testing problem. A matrix is called $(t,\\epsilon)$-disjunct if it gives rise to a nonadaptive group testing scheme with the property of identifying a uniformly random $t$-set of defective subjects out of a popula"},"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":"1510.02873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T04:13:06Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"91b8dd7bf393d46a93a79fb44c57f45c180560611371aef662a0bc9485bb1596","abstract_canon_sha256":"7e967ff8fad9b05399f2c0ee13acb4ed7b87ac242d17b5d9731277249afe955b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.690294Z","signature_b64":"PU5HXtuE3YUVKt31aOLQwB6/y6CA47e/R1P0sjNyJ61w5SC//kmCMyNxT9hNI8bB6BbaMYJAdeO2DkhxfwstDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd35bd43375621e52b23978d5769496632233e61c11500198e0491217e44575","last_reissued_at":"2026-05-18T00:46:49.689614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.689614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group testing schemes from codes and designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Arya Mazumdar","submitted_at":"2015-10-10T04:13:06Z","abstract_excerpt":"In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output indicating whether the group is free of the defective items or contains one or more of them. In this paper we study a relaxation of the combinatorial group testing problem. A matrix is called $(t,\\epsilon)$-disjunct if it gives rise to a nonadaptive group testing scheme with the property of identifying a uniformly random $t$-set of defective subjects out of a popula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02873","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":"1510.02873","created_at":"2026-05-18T00:46:49.689701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02873v2","created_at":"2026-05-18T00:46:49.689701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02873","created_at":"2026-05-18T00:46:49.689701+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTJVXVBTOVRB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTJVXVBTOVRB4UVS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTJVXVBT","created_at":"2026-05-18T12:29:17.054201+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/DTJVXVBTOVRB4UVSHF4NK5UUSZ","json":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ.json","graph_json":"https://pith.science/api/pith-number/DTJVXVBTOVRB4UVSHF4NK5UUSZ/graph.json","events_json":"https://pith.science/api/pith-number/DTJVXVBTOVRB4UVSHF4NK5UUSZ/events.json","paper":"https://pith.science/paper/DTJVXVBT"},"agent_actions":{"view_html":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ","download_json":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ.json","view_paper":"https://pith.science/paper/DTJVXVBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02873&json=true","fetch_graph":"https://pith.science/api/pith-number/DTJVXVBTOVRB4UVSHF4NK5UUSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DTJVXVBTOVRB4UVSHF4NK5UUSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ/action/storage_attestation","attest_author":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ/action/author_attestation","sign_citation":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ/action/citation_signature","submit_replication":"https://pith.science/pith/DTJVXVBTOVRB4UVSHF4NK5UUSZ/action/replication_record"}},"created_at":"2026-05-18T00:46:49.689701+00:00","updated_at":"2026-05-18T00:46:49.689701+00:00"}