{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X65SDEBR34PW5ZD5R4HQ5P77LA","short_pith_number":"pith:X65SDEBR","canonical_record":{"source":{"id":"1511.05201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T22:10:13Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"499224651d0b905d25f366306de431b16d80b57eb28352f60159c930215f17ee","abstract_canon_sha256":"9ce47b7da97135adfaa22aa38589636c7e2bf5ff66acc8d665ec66476bd5ef2f"},"schema_version":"1.0"},"canonical_sha256":"bfbb219031df1f6ee47d8f0f0ebfff58273b795587b6ee79b6584198cd5a5fc6","source":{"kind":"arxiv","id":"1511.05201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05201","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05201v2","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05201","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"X65SDEBR34PW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X65SDEBR34PW5ZD5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X65SDEBR","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X65SDEBR34PW5ZD5R4HQ5P77LA","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T22:10:13Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"499224651d0b905d25f366306de431b16d80b57eb28352f60159c930215f17ee","abstract_canon_sha256":"9ce47b7da97135adfaa22aa38589636c7e2bf5ff66acc8d665ec66476bd5ef2f"},"schema_version":"1.0"},"canonical_sha256":"bfbb219031df1f6ee47d8f0f0ebfff58273b795587b6ee79b6584198cd5a5fc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.160529Z","signature_b64":"5xeI2bxhveGfSwiLCOTjfCEGsUSmM9f3RexmdlNPN5gH9nUIKCoJhgUZcTLPie3gYoPB615ZQ70ts5yBkFiEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbb219031df1f6ee47d8f0f0ebfff58273b795587b6ee79b6584198cd5a5fc6","last_reissued_at":"2026-05-18T00:30:33.159912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.159912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05201","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6d0qcv8angncsXGcS7oB9Y7luivrtls2vWQB59qnd7W3REuEIRzARVpylUhtwwlANoIQ0fRBJNJ1wGoslrnDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:05:16.065038Z"},"content_sha256":"b3825fcb541e7422eb617a75d4c4ff4014840d454551d85ea9b5996f0b987ecc","schema_version":"1.0","event_id":"sha256:b3825fcb541e7422eb617a75d4c4ff4014840d454551d85ea9b5996f0b987ecc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X65SDEBR34PW5ZD5R4HQ5P77LA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The capacity of Bernoulli nonadaptive group testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge","submitted_at":"2015-11-16T22:10:13Z","abstract_excerpt":"We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under optimal Bernoulli testing. Achievability is given by a result of Scarlett and Cevher; here we give a converse bound showing that this result is best possible. Our new converse requires three parts: a typicality bound generalising the trivial counting bound, a converse on the COMP algorithm of Chan et al, and a bound on the SSS algorithm similar to that given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05201","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7r4rBbh5En7MlKvJ7gm6iWYktPzYpnwtcobjUx+xFNlnamvPUUx9PefTpvY/GEuE/4ICZi4ij/48DZLxzZnQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:05:16.065401Z"},"content_sha256":"419670edc595b4aaedfb71457499fad8b02835bb8754c1bd409ff793808002d9","schema_version":"1.0","event_id":"sha256:419670edc595b4aaedfb71457499fad8b02835bb8754c1bd409ff793808002d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/bundle.json","state_url":"https://pith.science/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/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-06-03T09:05:16Z","links":{"resolver":"https://pith.science/pith/X65SDEBR34PW5ZD5R4HQ5P77LA","bundle":"https://pith.science/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/bundle.json","state":"https://pith.science/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X65SDEBR34PW5ZD5R4HQ5P77LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X65SDEBR34PW5ZD5R4HQ5P77LA","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":"9ce47b7da97135adfaa22aa38589636c7e2bf5ff66acc8d665ec66476bd5ef2f","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T22:10:13Z","title_canon_sha256":"499224651d0b905d25f366306de431b16d80b57eb28352f60159c930215f17ee"},"schema_version":"1.0","source":{"id":"1511.05201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05201","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05201v2","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05201","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"X65SDEBR34PW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X65SDEBR34PW5ZD5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X65SDEBR","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:419670edc595b4aaedfb71457499fad8b02835bb8754c1bd409ff793808002d9","target":"graph","created_at":"2026-05-18T00:30:33Z","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 consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under optimal Bernoulli testing. Achievability is given by a result of Scarlett and Cevher; here we give a converse bound showing that this result is best possible. Our new converse requires three parts: a typicality bound generalising the trivial counting bound, a converse on the COMP algorithm of Chan et al, and a bound on the SSS algorithm similar to that given","authors_text":"Matthew Aldridge","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T22:10:13Z","title":"The capacity of Bernoulli nonadaptive group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05201","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:b3825fcb541e7422eb617a75d4c4ff4014840d454551d85ea9b5996f0b987ecc","target":"record","created_at":"2026-05-18T00:30:33Z","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":"9ce47b7da97135adfaa22aa38589636c7e2bf5ff66acc8d665ec66476bd5ef2f","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-16T22:10:13Z","title_canon_sha256":"499224651d0b905d25f366306de431b16d80b57eb28352f60159c930215f17ee"},"schema_version":"1.0","source":{"id":"1511.05201","kind":"arxiv","version":2}},"canonical_sha256":"bfbb219031df1f6ee47d8f0f0ebfff58273b795587b6ee79b6584198cd5a5fc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfbb219031df1f6ee47d8f0f0ebfff58273b795587b6ee79b6584198cd5a5fc6","first_computed_at":"2026-05-18T00:30:33.159912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:33.159912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xeI2bxhveGfSwiLCOTjfCEGsUSmM9f3RexmdlNPN5gH9nUIKCoJhgUZcTLPie3gYoPB615ZQ70ts5yBkFiEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:33.160529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3825fcb541e7422eb617a75d4c4ff4014840d454551d85ea9b5996f0b987ecc","sha256:419670edc595b4aaedfb71457499fad8b02835bb8754c1bd409ff793808002d9"],"state_sha256":"f95a848ddf64fb626be7fa17e9365c28e57f89912d1fd9165b1d505cbfa6bbc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K34IJy4OHUzJ/8+/lhZ48c7leFjpiw75PI6/2CtHIn8O1Ziq9adZONyydt2y/Sb4uXZhr29Ik9seqzxY40OgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:05:16.067256Z","bundle_sha256":"03d05859fedc8f9f25385c013876356ac073c151dc0177abed4798a3479eacd5"}}