{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QUCG7QD7IDBLEQMC6F6GUM5VRW","short_pith_number":"pith:QUCG7QD7","canonical_record":{"source":{"id":"1501.03566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-15T04:11:06Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"776cdf4d30e4ef1506e5d56eed07eb017360d378fbc5d3109416f62d9e0cfeac","abstract_canon_sha256":"701394570d15608cecab1e4c0621063646de2d3a2e57fc71f80bf988c7377bc5"},"schema_version":"1.0"},"canonical_sha256":"85046fc07f40c2b24182f17c6a33b58dbae48815d492542156913dc9129b3b08","source":{"kind":"arxiv","id":"1501.03566","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03566","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03566v2","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03566","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"QUCG7QD7IDBL","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUCG7QD7IDBLEQMC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUCG7QD7","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QUCG7QD7IDBLEQMC6F6GUM5VRW","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-15T04:11:06Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"776cdf4d30e4ef1506e5d56eed07eb017360d378fbc5d3109416f62d9e0cfeac","abstract_canon_sha256":"701394570d15608cecab1e4c0621063646de2d3a2e57fc71f80bf988c7377bc5"},"schema_version":"1.0"},"canonical_sha256":"85046fc07f40c2b24182f17c6a33b58dbae48815d492542156913dc9129b3b08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:29.367045Z","signature_b64":"8NWBt3knthOLKoPP/3Gc+AA7w/XtJxIESW9K2fiY3L05wIhYrsQNVAoOAW1c63xT0uNJRNrtTp8hyNW5hiymDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85046fc07f40c2b24182f17c6a33b58dbae48815d492542156913dc9129b3b08","last_reissued_at":"2026-05-18T01:01:29.366598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:29.366598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03566","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:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5lt1BBOtX5jt/Dq3iC8oarttcbpm0ZBLnRBmJnNFCX9v9TrR3EeBGDbydjTzpLnumg6kfu5oOQn+Qa08A1GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:14:01.800302Z"},"content_sha256":"4f0b8436d65df95b079bd9d7b2d5bd0dde2dd79a4e455eb36c0e47250ae5cb2f","schema_version":"1.0","event_id":"sha256:4f0b8436d65df95b079bd9d7b2d5bd0dde2dd79a4e455eb36c0e47250ae5cb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QUCG7QD7IDBLEQMC6F6GUM5VRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds on the number of tests for disjunct matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2015-01-15T04:11:06Z","abstract_excerpt":"Given $n$ items with at most $d$ of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items using as few tests as possible. This paper is devoted to a fundamental and thirty-year-old problem in the nonadaptive group testing theory. A binary matrix is called $d$-disjunct if the boolean sum of arbitrary $d$ columns does not contain another column not in this collection. Let $T(d)$ denote the minimal $t$ such that there exists a $t\\times n$ $d$-disjunct matrix with $n>t$. $T(d)$ can also be viewed as the mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03566","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:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pwofzz73ajbZbyZLj20qSaJ6YZOM1VOg04eSHqwO4FNF+jpaLr0UxXL56DKkPfcNH0M5GNP/pz79LL1zasaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:14:01.800657Z"},"content_sha256":"0f485949ec144fed33e8ee80b29b61595b11aa81cd997ba1c0a57cd3ba7a1ba5","schema_version":"1.0","event_id":"sha256:0f485949ec144fed33e8ee80b29b61595b11aa81cd997ba1c0a57cd3ba7a1ba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/bundle.json","state_url":"https://pith.science/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/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-02T06:14:01Z","links":{"resolver":"https://pith.science/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW","bundle":"https://pith.science/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/bundle.json","state":"https://pith.science/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUCG7QD7IDBLEQMC6F6GUM5VRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QUCG7QD7IDBLEQMC6F6GUM5VRW","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":"701394570d15608cecab1e4c0621063646de2d3a2e57fc71f80bf988c7377bc5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-15T04:11:06Z","title_canon_sha256":"776cdf4d30e4ef1506e5d56eed07eb017360d378fbc5d3109416f62d9e0cfeac"},"schema_version":"1.0","source":{"id":"1501.03566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03566","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03566v2","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03566","created_at":"2026-05-18T01:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"QUCG7QD7IDBL","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUCG7QD7IDBLEQMC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUCG7QD7","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:0f485949ec144fed33e8ee80b29b61595b11aa81cd997ba1c0a57cd3ba7a1ba5","target":"graph","created_at":"2026-05-18T01:01:29Z","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":"Given $n$ items with at most $d$ of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items using as few tests as possible. This paper is devoted to a fundamental and thirty-year-old problem in the nonadaptive group testing theory. A binary matrix is called $d$-disjunct if the boolean sum of arbitrary $d$ columns does not contain another column not in this collection. Let $T(d)$ denote the minimal $t$ such that there exists a $t\\times n$ $d$-disjunct matrix with $n>t$. $T(d)$ can also be viewed as the mini","authors_text":"Chong Shangguan, Gennian Ge","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-15T04:11:06Z","title":"New bounds on the number of tests for disjunct matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03566","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:4f0b8436d65df95b079bd9d7b2d5bd0dde2dd79a4e455eb36c0e47250ae5cb2f","target":"record","created_at":"2026-05-18T01:01:29Z","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":"701394570d15608cecab1e4c0621063646de2d3a2e57fc71f80bf988c7377bc5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-15T04:11:06Z","title_canon_sha256":"776cdf4d30e4ef1506e5d56eed07eb017360d378fbc5d3109416f62d9e0cfeac"},"schema_version":"1.0","source":{"id":"1501.03566","kind":"arxiv","version":2}},"canonical_sha256":"85046fc07f40c2b24182f17c6a33b58dbae48815d492542156913dc9129b3b08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85046fc07f40c2b24182f17c6a33b58dbae48815d492542156913dc9129b3b08","first_computed_at":"2026-05-18T01:01:29.366598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:29.366598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8NWBt3knthOLKoPP/3Gc+AA7w/XtJxIESW9K2fiY3L05wIhYrsQNVAoOAW1c63xT0uNJRNrtTp8hyNW5hiymDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:29.367045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f0b8436d65df95b079bd9d7b2d5bd0dde2dd79a4e455eb36c0e47250ae5cb2f","sha256:0f485949ec144fed33e8ee80b29b61595b11aa81cd997ba1c0a57cd3ba7a1ba5"],"state_sha256":"498ed4e23530530620cdcbe75a2ff6d99ebaee4985b6998ef8abdba4a2fdf086"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P77+eZjy7LnE0zUBvZiXRewkWezbjg0YiyHnmQm71KouE0+1ilLU207i1k/03ePS71cv0UC4zmol+rR8gVDhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:14:01.802623Z","bundle_sha256":"0122bb164039c78657f5960d8157c221c004ee33d4b29e0c26792f252e62bf0b"}}