{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HPQ4VYWEPQ52TPNB52HHRMETX7","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":"870562f20a38dfb9675498d4123c2608badaee79b55bd48737613b823111ea0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-15T04:35:25Z","title_canon_sha256":"6a08901591cc1eb20519c87035c6aee22077afb5f143964e3b7bb539f776d238"},"schema_version":"1.0","source":{"id":"1711.05403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05403","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05403v2","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05403","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"HPQ4VYWEPQ52","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HPQ4VYWEPQ52TPNB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HPQ4VYWE","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:f6267692022357b03fc412c3a3ac54d333d09404c59d6306973601c8f072e9b9","target":"graph","created_at":"2026-05-17T23:55:30Z","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 combinatorial group testing (CGT), the objective is to identify the set of at most $d$ defective items from a pool of $n$ items using as few tests as possible. The celebrated result for the CGT problem is that the number of tests $t$ can be made logarithmic in $n$ when $d=O(poly(\\log n))$. However, state-of-the-art GT codes require the items to be tested $w=\\Omega(d\\log n)$ times and tests to include $\\rho=\\Omega(n/d)$ items (within log factors). In many applications, items can only participate in a limited number of tests and tests are constrained to include a limited number of items.\n  In","authors_text":"Ayfer Ozgur, Huseyin A. Inan, Peter Kairouz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-15T04:35:25Z","title":"Sparse Combinatorial Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05403","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:7442eb0fa6a17a998dd7bc7bff5aad2fd4030c4c1adcfe89ae64a1966604616c","target":"record","created_at":"2026-05-17T23:55:30Z","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":"870562f20a38dfb9675498d4123c2608badaee79b55bd48737613b823111ea0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-15T04:35:25Z","title_canon_sha256":"6a08901591cc1eb20519c87035c6aee22077afb5f143964e3b7bb539f776d238"},"schema_version":"1.0","source":{"id":"1711.05403","kind":"arxiv","version":2}},"canonical_sha256":"3be1cae2c47c3ba9bda1ee8e78b093bfd28185f6dd7811bbfba93b620b1f6281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3be1cae2c47c3ba9bda1ee8e78b093bfd28185f6dd7811bbfba93b620b1f6281","first_computed_at":"2026-05-17T23:55:30.876578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:30.876578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZSTIQ55yGeeGpePzcjnqkMgmN8daqxZzZxxku7klfhBupWEnr+6GwXGK59bhUAtJyCdNzjhhS4gYRdpCVhABg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:30.876967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7442eb0fa6a17a998dd7bc7bff5aad2fd4030c4c1adcfe89ae64a1966604616c","sha256:f6267692022357b03fc412c3a3ac54d333d09404c59d6306973601c8f072e9b9"],"state_sha256":"d0e104cd06a270cfa976b9b4cd2005ff9c7f9e5804ce33e54b5114115a4dffa0"}