{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7H4CPE4ZOYGYN5LEVBMHX2B66Y","short_pith_number":"pith:7H4CPE4Z","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"},"canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","source":{"kind":"arxiv","id":"1509.00131","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00131","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00131v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00131","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"7H4CPE4ZOYGY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7H4CPE4ZOYGYN5LE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7H4CPE4Z","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7H4CPE4ZOYGYN5LEVBMHX2B66Y","target":"record","payload":{"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"},"canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","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"},"source_kind":"arxiv","source_id":"1509.00131","source_version":1,"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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArRdIYtgiqh1UUcLl8Adf97vQtrFnmuGGsgidqe3h78+FfgBEDmZO9Gg4Be3I2ow43WvHvCqD1o+uAwRnsnQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:38:58.645194Z"},"content_sha256":"0c2fb82942dc653bd58b4a0c7b9a860d5a31c8c66a24687f4794edb3c3b2d82d","schema_version":"1.0","event_id":"sha256:0c2fb82942dc653bd58b4a0c7b9a860d5a31c8c66a24687f4794edb3c3b2d82d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7H4CPE4ZOYGYN5LEVBMHX2B66Y","target":"graph","payload":{"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"},"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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC/nIes2XW5FKMLaYyI9odOtzNeuzQAMTb/Qc+SFVvKJqr5B+rohhz33Ga2RfOc6yXX3JQLAvmAnkIq4SEMZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:38:58.645920Z"},"content_sha256":"7d99f683300f0901e5e3d9c0df028404e9e233a940bc3d9d0a0e15fd357b0fbf","schema_version":"1.0","event_id":"sha256:7d99f683300f0901e5e3d9c0df028404e9e233a940bc3d9d0a0e15fd357b0fbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/bundle.json","state_url":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/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-05-22T23:38:58Z","links":{"resolver":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y","bundle":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/bundle.json","state":"https://pith.science/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7H4CPE4ZOYGYN5LEVBMHX2B66Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7H4CPE4ZOYGYN5LEVBMHX2B66Y","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":"cd73125994b72c18a051d06cc85702357522ee665ff59c35182583e39bfb4647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T04:07:15Z","title_canon_sha256":"e48153ef15992eb20203fd9548c2d8ea95f317a957b4f29ed0450ac0bc1f9f85"},"schema_version":"1.0","source":{"id":"1509.00131","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00131","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00131v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00131","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"7H4CPE4ZOYGY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7H4CPE4ZOYGYN5LE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7H4CPE4Z","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:7d99f683300f0901e5e3d9c0df028404e9e233a940bc3d9d0a0e15fd357b0fbf","target":"graph","created_at":"2026-05-18T01:34:30Z","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":"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","authors_text":"Cory T. Palmer, D\\'aniel Gerbner, Dominik K. Vu, Fabr\\'icio S. Benevides","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T04:07:15Z","title":"Generalising separating families of fixed size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00131","kind":"arxiv","version":1},"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:0c2fb82942dc653bd58b4a0c7b9a860d5a31c8c66a24687f4794edb3c3b2d82d","target":"record","created_at":"2026-05-18T01:34:30Z","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":"cd73125994b72c18a051d06cc85702357522ee665ff59c35182583e39bfb4647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T04:07:15Z","title_canon_sha256":"e48153ef15992eb20203fd9548c2d8ea95f317a957b4f29ed0450ac0bc1f9f85"},"schema_version":"1.0","source":{"id":"1509.00131","kind":"arxiv","version":1}},"canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9f8279399760d86f564a8587be83ef601d1b51a23e65c56cb0383b37a51e051","first_computed_at":"2026-05-18T01:34:30.553666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:30.553666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F0QpeFJqU6Oc159sHMnlZNkxhZp28w//QMLWy6zLaUvDPBtfu1MNdCRBPPomk/kRgkr9L6gLaB9NOtMZpdQ0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:30.554078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00131","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2fb82942dc653bd58b4a0c7b9a860d5a31c8c66a24687f4794edb3c3b2d82d","sha256:7d99f683300f0901e5e3d9c0df028404e9e233a940bc3d9d0a0e15fd357b0fbf"],"state_sha256":"42523cfd7e28d85a567b005f81787dc4d7e73e2a2a4a34b7ecc7fe363adaed20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO+79J1FJW8vx/GbrXw5pJLCGtLAVf4aHGYAWizi5PYVjKLohojMdCzv2aNKD1NhqhEQWTjfH1hR2huEdGFNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T23:38:58.649923Z","bundle_sha256":"f882e44bbe1201059a80448ce7b7c06c87b0edb8274ae3b726081e368818773b"}}