{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YLELTECL3GNDAW7TMLP2NOOWB2","short_pith_number":"pith:YLELTECL","canonical_record":{"source":{"id":"1612.07122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"5e2b70544aabcf5f105ea34a8851d5db0c64f35116873c0b1838d834ac7efc4d","abstract_canon_sha256":"d47c8d50c458163792ed58b667349e8fd82704c58d0feb7237dd57049833755d"},"schema_version":"1.0"},"canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","source":{"kind":"arxiv","id":"1612.07122","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07122","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07122v3","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07122","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"YLELTECL3GND","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLELTECL3GNDAW7T","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLELTECL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YLELTECL3GNDAW7TMLP2NOOWB2","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"5e2b70544aabcf5f105ea34a8851d5db0c64f35116873c0b1838d834ac7efc4d","abstract_canon_sha256":"d47c8d50c458163792ed58b667349e8fd82704c58d0feb7237dd57049833755d"},"schema_version":"1.0"},"canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.741820Z","signature_b64":"aq6QLSNuwSpNfJq6A6Wd+0hflfS1r1w8IRcIyTdL/rpxxrFqJKIEUQacLtLvNr4AZysDSdSJOMQlp2clLBlPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","last_reissued_at":"2026-05-18T00:05:00.741406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.741406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07122","source_version":3,"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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7RHoby/AhqVrPn2Z0t34JPadRTaxUv7GYdpT1SO1ageDArpM/ghYSVSEeVg02a18rp18l/MtGsYuZ0rF5RMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:00:54.614849Z"},"content_sha256":"33d113e5585007288a6ad9224e4daefb30ddc11fedf9f65ba168b80b4be0e16f","schema_version":"1.0","event_id":"sha256:33d113e5585007288a6ad9224e4daefb30ddc11fedf9f65ba168b80b4be0e16f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YLELTECL3GNDAW7TMLP2NOOWB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance of group testing algorithms with near-constant tests-per-item","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","submitted_at":"2016-11-21T10:48:27Z","abstract_excerpt":"We consider the nonadaptive group testing with N items, of which $K = \\Theta(N^\\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests uniformly at random with replacement, and place the item in those tests. We analyse the performance of these designs with simple and practical decoding algorithms in a range of sparsity regimes, and show that the performance is consistently improved in comparison with standard Bernoulli designs. We show that our new design requires 23% fewer tests than a Bernoulli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07122","kind":"arxiv","version":3},"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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvPJgqOp2AOYr0/WOmKOs+D8X9BWlgJXNP3KcyHFbIg47KPDLEnJrS2wMlIXtRJ19Dr89MP0Q62PfR1zq8gzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:00:54.615381Z"},"content_sha256":"b78f165712d975396f5abb33f10ebb7bff2f9448561970d799d3ab0978b64d7e","schema_version":"1.0","event_id":"sha256:b78f165712d975396f5abb33f10ebb7bff2f9448561970d799d3ab0978b64d7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/bundle.json","state_url":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLELTECL3GNDAW7TMLP2NOOWB2/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-03T00:00:54Z","links":{"resolver":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2","bundle":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/bundle.json","state":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLELTECL3GNDAW7TMLP2NOOWB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YLELTECL3GNDAW7TMLP2NOOWB2","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":"d47c8d50c458163792ed58b667349e8fd82704c58d0feb7237dd57049833755d","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","title_canon_sha256":"5e2b70544aabcf5f105ea34a8851d5db0c64f35116873c0b1838d834ac7efc4d"},"schema_version":"1.0","source":{"id":"1612.07122","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07122","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07122v3","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07122","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"YLELTECL3GND","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLELTECL3GNDAW7T","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLELTECL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b78f165712d975396f5abb33f10ebb7bff2f9448561970d799d3ab0978b64d7e","target":"graph","created_at":"2026-05-18T00:05:00Z","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 the nonadaptive group testing with N items, of which $K = \\Theta(N^\\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests uniformly at random with replacement, and place the item in those tests. We analyse the performance of these designs with simple and practical decoding algorithms in a range of sparsity regimes, and show that the performance is consistently improved in comparison with standard Bernoulli designs. We show that our new design requires 23% fewer tests than a Bernoulli","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","title":"Performance of group testing algorithms with near-constant tests-per-item"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07122","kind":"arxiv","version":3},"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:33d113e5585007288a6ad9224e4daefb30ddc11fedf9f65ba168b80b4be0e16f","target":"record","created_at":"2026-05-18T00:05:00Z","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":"d47c8d50c458163792ed58b667349e8fd82704c58d0feb7237dd57049833755d","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","title_canon_sha256":"5e2b70544aabcf5f105ea34a8851d5db0c64f35116873c0b1838d834ac7efc4d"},"schema_version":"1.0","source":{"id":"1612.07122","kind":"arxiv","version":3}},"canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","first_computed_at":"2026-05-18T00:05:00.741406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.741406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aq6QLSNuwSpNfJq6A6Wd+0hflfS1r1w8IRcIyTdL/rpxxrFqJKIEUQacLtLvNr4AZysDSdSJOMQlp2clLBlPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.741820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07122","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33d113e5585007288a6ad9224e4daefb30ddc11fedf9f65ba168b80b4be0e16f","sha256:b78f165712d975396f5abb33f10ebb7bff2f9448561970d799d3ab0978b64d7e"],"state_sha256":"c8d74bf8c609378a80df65231e5bd468d3af1d76f0da56ce98f9e18c285298e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VfQliPGuEutuNhSsXkqhwk+Zc6sju+n03sEu4bGcy/Yb4hdeU3mn/G5mHzVUmxSxUOVGiGWYl5485vM8ImLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:00:54.617349Z","bundle_sha256":"e338f02108cd4c20efad9176d4356fb11684ba44c8b2db1d17276957ce9f9244"}}