{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QBZVPL3M26RORS36PIGBCXYYI4","short_pith_number":"pith:QBZVPL3M","canonical_record":{"source":{"id":"1602.03471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T18:18:35Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"0d0c29c3416c2477cb515df3b218d903ce5ccc80f89d50de20fa28a9031b9a33","abstract_canon_sha256":"cbda9a91cbde084ed642eff669bf89979ca27e3fa88791ef17e4e8a85ee8f3a1"},"schema_version":"1.0"},"canonical_sha256":"807357af6cd7a2e8cb7e7a0c115f1847160f464ab427125257eb4f76f64b390a","source":{"kind":"arxiv","id":"1602.03471","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03471","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03471v2","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03471","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"QBZVPL3M26RO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBZVPL3M26RORS36","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBZVPL3M","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QBZVPL3M26RORS36PIGBCXYYI4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T18:18:35Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"0d0c29c3416c2477cb515df3b218d903ce5ccc80f89d50de20fa28a9031b9a33","abstract_canon_sha256":"cbda9a91cbde084ed642eff669bf89979ca27e3fa88791ef17e4e8a85ee8f3a1"},"schema_version":"1.0"},"canonical_sha256":"807357af6cd7a2e8cb7e7a0c115f1847160f464ab427125257eb4f76f64b390a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:25.918695Z","signature_b64":"qklYYAF9Iuo989slPwDclhUnLYO+b0Mz44lETryKkIgbdYsyq4HTFnsgSULHK717GVkaYFzLpnaluG5I5FtQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807357af6cd7a2e8cb7e7a0c115f1847160f464ab427125257eb4f76f64b390a","last_reissued_at":"2026-05-18T01:08:25.918048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:25.918048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03471","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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/5J7pkWNgtnUYqItaKyH3XliNwDPxFIHm2KyJg6Pum7HE7neVF+/ht+8FK39jm+8mswaBFdEWIXPcXJ114eCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:32:30.355736Z"},"content_sha256":"a4c6a0ae8aba204f7b274402617806eb7c01005a9b2c0c71e1dbb1487c835257","schema_version":"1.0","event_id":"sha256:a4c6a0ae8aba204f7b274402617806eb7c01005a9b2c0c71e1dbb1487c835257"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QBZVPL3M26RORS36PIGBCXYYI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved group testing rates with constant column weight designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","submitted_at":"2016-02-10T18:18:35Z","abstract_excerpt":"We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance is improved compared to Bernoulli designs, where each item is placed in each test independently with a fixed probability. In particular, we show that the rate of the practical COMP detection algorithm is increased by 31% in all sparsity regimes. In dense cases, this beats the best possible algorithm with Bernoulli tests, and in sparse cases is the best proven"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03471","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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQiCO6OPG8vfBfV/gg633ZuvpqCk4rwjlpByrnWoXpOdONb7SvV5NBnEFHm+NrRpnb5Qt/3zrdoqhzJVEAsiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:32:30.356096Z"},"content_sha256":"0b1dcf60c9b0af3272b066f4dc1096c61e7c85da3024cb10b5b257c57d577764","schema_version":"1.0","event_id":"sha256:0b1dcf60c9b0af3272b066f4dc1096c61e7c85da3024cb10b5b257c57d577764"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBZVPL3M26RORS36PIGBCXYYI4/bundle.json","state_url":"https://pith.science/pith/QBZVPL3M26RORS36PIGBCXYYI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBZVPL3M26RORS36PIGBCXYYI4/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-02T21:32:30Z","links":{"resolver":"https://pith.science/pith/QBZVPL3M26RORS36PIGBCXYYI4","bundle":"https://pith.science/pith/QBZVPL3M26RORS36PIGBCXYYI4/bundle.json","state":"https://pith.science/pith/QBZVPL3M26RORS36PIGBCXYYI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBZVPL3M26RORS36PIGBCXYYI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QBZVPL3M26RORS36PIGBCXYYI4","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":"cbda9a91cbde084ed642eff669bf89979ca27e3fa88791ef17e4e8a85ee8f3a1","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T18:18:35Z","title_canon_sha256":"0d0c29c3416c2477cb515df3b218d903ce5ccc80f89d50de20fa28a9031b9a33"},"schema_version":"1.0","source":{"id":"1602.03471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03471","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03471v2","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03471","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"QBZVPL3M26RO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBZVPL3M26RORS36","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBZVPL3M","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:0b1dcf60c9b0af3272b066f4dc1096c61e7c85da3024cb10b5b257c57d577764","target":"graph","created_at":"2026-05-18T01:08:25Z","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 where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance is improved compared to Bernoulli designs, where each item is placed in each test independently with a fixed probability. In particular, we show that the rate of the practical COMP detection algorithm is increased by 31% in all sparsity regimes. In dense cases, this beats the best possible algorithm with Bernoulli tests, and in sparse cases is the best proven","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T18:18:35Z","title":"Improved group testing rates with constant column weight designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03471","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:a4c6a0ae8aba204f7b274402617806eb7c01005a9b2c0c71e1dbb1487c835257","target":"record","created_at":"2026-05-18T01:08:25Z","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":"cbda9a91cbde084ed642eff669bf89979ca27e3fa88791ef17e4e8a85ee8f3a1","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T18:18:35Z","title_canon_sha256":"0d0c29c3416c2477cb515df3b218d903ce5ccc80f89d50de20fa28a9031b9a33"},"schema_version":"1.0","source":{"id":"1602.03471","kind":"arxiv","version":2}},"canonical_sha256":"807357af6cd7a2e8cb7e7a0c115f1847160f464ab427125257eb4f76f64b390a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"807357af6cd7a2e8cb7e7a0c115f1847160f464ab427125257eb4f76f64b390a","first_computed_at":"2026-05-18T01:08:25.918048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:25.918048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qklYYAF9Iuo989slPwDclhUnLYO+b0Mz44lETryKkIgbdYsyq4HTFnsgSULHK717GVkaYFzLpnaluG5I5FtQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:25.918695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4c6a0ae8aba204f7b274402617806eb7c01005a9b2c0c71e1dbb1487c835257","sha256:0b1dcf60c9b0af3272b066f4dc1096c61e7c85da3024cb10b5b257c57d577764"],"state_sha256":"892c356f5f082196355ce2d9a5e068b86b4f5a4e8db704099efb3282ac01678e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2r76lvmFXpp+hwtCnMOF8OmRSJLViONMxJR3a0ibnmMK8iAKfpThQ+TmAjr79rMGcREV2LC4aNyXIctpMvt+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:32:30.358159Z","bundle_sha256":"12973db95fa997fa28a8e2d24602f54c446c8efc7b9ff92144a249df1449a7de"}}