{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:27BRSMNO4YPHP2VWA5IIBGYTUU","short_pith_number":"pith:27BRSMNO","canonical_record":{"source":{"id":"1111.5003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-21T20:55:02Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"5c5ff38c050a5bf344527f3a19706038360dc6d8378f0cd486f534e70d3f5460","abstract_canon_sha256":"a247098160e37b090fb7a29c3d43eb43d48d5931c7a0e643732db09da4c2de4e"},"schema_version":"1.0"},"canonical_sha256":"d7c31931aee61e77eab60750809b13a52463713c6ea779849398d3f945fc457a","source":{"kind":"arxiv","id":"1111.5003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5003","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5003v2","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5003","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"27BRSMNO4YPH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"27BRSMNO4YPHP2VW","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"27BRSMNO","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:27BRSMNO4YPHP2VWA5IIBGYTUU","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-21T20:55:02Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"5c5ff38c050a5bf344527f3a19706038360dc6d8378f0cd486f534e70d3f5460","abstract_canon_sha256":"a247098160e37b090fb7a29c3d43eb43d48d5931c7a0e643732db09da4c2de4e"},"schema_version":"1.0"},"canonical_sha256":"d7c31931aee61e77eab60750809b13a52463713c6ea779849398d3f945fc457a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.762939Z","signature_b64":"Nr3qTaHAL4egjj4vuWWF9vjTUz5yT+koNO7BckJnTAoZov9gENId9gi1XAPNe8+4wGG5LBicXAtcu38eBmtiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c31931aee61e77eab60750809b13a52463713c6ea779849398d3f945fc457a","last_reissued_at":"2026-05-18T03:15:06.762179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.762179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5003","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-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4Qvc+ybGCoDN0/rxPmVUlNOY+IgidUhJYqWaCuj9TPLpjQ8/Ifd2LdzyvrPRzdbn27xRLI6PhwmUBxj850ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:34:27.449206Z"},"content_sha256":"7c698d234e63869a3dbb9995cfa973beeb466b1f050b0389848c033c9324b1d6","schema_version":"1.0","event_id":"sha256:7c698d234e63869a3dbb9995cfa973beeb466b1f050b0389848c033c9324b1d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:27BRSMNO4YPHP2VWA5IIBGYTUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Almost Disjunct Matrices for Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar","submitted_at":"2011-11-21T20:55:02Z","abstract_excerpt":"In a \\emph{group testing} scheme, a set of tests is designed to identify a small number $t$ of defective items among a large set (of size $N$) of items. In the non-adaptive scenario the set of tests has to be designed in one-shot. In this setting, designing a testing scheme is equivalent to the construction of a \\emph{disjunct matrix}, an $M \\times N$ matrix where the union of supports of any $t$ columns does not contain the support of any other column. In principle, one wants to have such a matrix with minimum possible number $M$ of rows (tests). One of the main ways of constructing disjunct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5003","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-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwWErkh/9nLoS9FRpMYOVVwRxr6Eaali8hz0OcMVrMsp13uVG9fRggmNz5i4/hvxzbf8wloJRK3xA8Mpcc50BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:34:27.449568Z"},"content_sha256":"13c231d2db2b7bbd173728f3341ff64389268dee17fe2efdeb18a5e5e28a66b3","schema_version":"1.0","event_id":"sha256:13c231d2db2b7bbd173728f3341ff64389268dee17fe2efdeb18a5e5e28a66b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/bundle.json","state_url":"https://pith.science/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/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-28T14:34:27Z","links":{"resolver":"https://pith.science/pith/27BRSMNO4YPHP2VWA5IIBGYTUU","bundle":"https://pith.science/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/bundle.json","state":"https://pith.science/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27BRSMNO4YPHP2VWA5IIBGYTUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:27BRSMNO4YPHP2VWA5IIBGYTUU","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":"a247098160e37b090fb7a29c3d43eb43d48d5931c7a0e643732db09da4c2de4e","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-21T20:55:02Z","title_canon_sha256":"5c5ff38c050a5bf344527f3a19706038360dc6d8378f0cd486f534e70d3f5460"},"schema_version":"1.0","source":{"id":"1111.5003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5003","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5003v2","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5003","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"27BRSMNO4YPH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"27BRSMNO4YPHP2VW","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"27BRSMNO","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:13c231d2db2b7bbd173728f3341ff64389268dee17fe2efdeb18a5e5e28a66b3","target":"graph","created_at":"2026-05-18T03:15:06Z","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":"In a \\emph{group testing} scheme, a set of tests is designed to identify a small number $t$ of defective items among a large set (of size $N$) of items. In the non-adaptive scenario the set of tests has to be designed in one-shot. In this setting, designing a testing scheme is equivalent to the construction of a \\emph{disjunct matrix}, an $M \\times N$ matrix where the union of supports of any $t$ columns does not contain the support of any other column. In principle, one wants to have such a matrix with minimum possible number $M$ of rows (tests). One of the main ways of constructing disjunct ","authors_text":"Arya Mazumdar","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-21T20:55:02Z","title":"Construction of Almost Disjunct Matrices for Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5003","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:7c698d234e63869a3dbb9995cfa973beeb466b1f050b0389848c033c9324b1d6","target":"record","created_at":"2026-05-18T03:15:06Z","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":"a247098160e37b090fb7a29c3d43eb43d48d5931c7a0e643732db09da4c2de4e","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-21T20:55:02Z","title_canon_sha256":"5c5ff38c050a5bf344527f3a19706038360dc6d8378f0cd486f534e70d3f5460"},"schema_version":"1.0","source":{"id":"1111.5003","kind":"arxiv","version":2}},"canonical_sha256":"d7c31931aee61e77eab60750809b13a52463713c6ea779849398d3f945fc457a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c31931aee61e77eab60750809b13a52463713c6ea779849398d3f945fc457a","first_computed_at":"2026-05-18T03:15:06.762179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:06.762179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nr3qTaHAL4egjj4vuWWF9vjTUz5yT+koNO7BckJnTAoZov9gENId9gi1XAPNe8+4wGG5LBicXAtcu38eBmtiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:06.762939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c698d234e63869a3dbb9995cfa973beeb466b1f050b0389848c033c9324b1d6","sha256:13c231d2db2b7bbd173728f3341ff64389268dee17fe2efdeb18a5e5e28a66b3"],"state_sha256":"0b41be7eb8fe9b49cc45e86008eb68cc6f5ad9d8d63f3a21f2d47bcf9d60c8e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aeTGC2DTg803qiVeiJyHcpRkK3WBaw1gTP8akxaGKuskjCpSQ6fkEwhtWsUE0z3Gcf7x2XGrlks1sD/6U8sZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:34:27.451477Z","bundle_sha256":"7b97d33a002cd295903d8d0d6340ff914b18e1d0aec1c32f6339cb19319666f7"}}