{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7H4CPE4ZOYGYN5LEVBMHX2B66Y","short_pith_number":"pith:7H4CPE4Z","schema_version":"1.0","canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","source":{"kind":"arxiv","id":"1509.00131","version":1},"attestation_state":"computed","paper":{"title":"Generalising separating families of fixed size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory T. Palmer, D\\'aniel Gerbner, Dominik K. Vu, Fabr\\'icio S. Benevides","submitted_at":"2015-09-01T04:07:15Z","abstract_excerpt":"We examine the following version of a classic combinatorial search problem introduced by R\\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \\subset X$ of exactly $d$ elements by testing, by as few as possible subsets $A$ of $X$, whether $A$ contains an element of $Y$ or not. We are primarily concerned with the model where the family of test sets is specified in advance (non-adaptive) and each test set is of size at most a given $k$. Our main results are asymptotically sharp bounds on the minimum number of tests necessary for fixed $d$ and $k$ and for $n$ t"},"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":"1509.00131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T04:07:15Z","cross_cats_sorted":[],"title_canon_sha256":"e48153ef15992eb20203fd9548c2d8ea95f317a957b4f29ed0450ac0bc1f9f85","abstract_canon_sha256":"cd73125994b72c18a051d06cc85702357522ee665ff59c35182583e39bfb4647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.554078Z","signature_b64":"F0QpeFJqU6Oc159sHMnlZNkxhZp28w//QMLWy6zLaUvDPBtfu1MNdCRBPPomk/kRgkr9L6gLaB9NOtMZpdQ0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","last_reissued_at":"2026-05-18T01:34:30.553666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.553666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalising separating families of fixed size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory T. Palmer, D\\'aniel Gerbner, Dominik K. Vu, Fabr\\'icio S. Benevides","submitted_at":"2015-09-01T04:07:15Z","abstract_excerpt":"We examine the following version of a classic combinatorial search problem introduced by R\\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \\subset X$ of exactly $d$ elements by testing, by as few as possible subsets $A$ of $X$, whether $A$ contains an element of $Y$ or not. We are primarily concerned with the model where the family of test sets is specified in advance (non-adaptive) and each test set is of size at most a given $k$. Our main results are asymptotically sharp bounds on the minimum number of tests necessary for fixed $d$ and $k$ and for $n$ t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00131","kind":"arxiv","version":1},"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":"1509.00131","created_at":"2026-05-18T01:34:30.553726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00131v1","created_at":"2026-05-18T01:34:30.553726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00131","created_at":"2026-05-18T01:34:30.553726+00:00"},{"alias_kind":"pith_short_12","alias_value":"7H4CPE4ZOYGY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7H4CPE4ZOYGYN5LE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7H4CPE4Z","created_at":"2026-05-18T12:29:10.953037+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/7H4CPE4ZOYGYN5LEVBMHX2B66Y","json":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y.json","graph_json":"https://pith.science/api/pith-number/7H4CPE4ZOYGYN5LEVBMHX2B66Y/graph.json","events_json":"https://pith.science/api/pith-number/7H4CPE4ZOYGYN5LEVBMHX2B66Y/events.json","paper":"https://pith.science/paper/7H4CPE4Z"},"agent_actions":{"view_html":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y","download_json":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y.json","view_paper":"https://pith.science/paper/7H4CPE4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00131&json=true","fetch_graph":"https://pith.science/api/pith-number/7H4CPE4ZOYGYN5LEVBMHX2B66Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7H4CPE4ZOYGYN5LEVBMHX2B66Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/action/storage_attestation","attest_author":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/action/author_attestation","sign_citation":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/action/citation_signature","submit_replication":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/action/replication_record"}},"created_at":"2026-05-18T01:34:30.553726+00:00","updated_at":"2026-05-18T01:34:30.553726+00:00"}