{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WWI5IARQSDCZIWUQ43KXCHPPSV","short_pith_number":"pith:WWI5IARQ","canonical_record":{"source":{"id":"1708.03429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b18c8451051e5f66546baf590ce2e311744056ec5919ec02c5dae4966590836b","abstract_canon_sha256":"c42e09eff495dd8af1ecd17f32c48c929e5e982b2deb7a46f9e6c90f022cccb1"},"schema_version":"1.0"},"canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","source":{"kind":"arxiv","id":"1708.03429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03429","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03429v2","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03429","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"WWI5IARQSDCZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WWI5IARQSDCZIWUQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WWI5IARQ","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WWI5IARQSDCZIWUQ43KXCHPPSV","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b18c8451051e5f66546baf590ce2e311744056ec5919ec02c5dae4966590836b","abstract_canon_sha256":"c42e09eff495dd8af1ecd17f32c48c929e5e982b2deb7a46f9e6c90f022cccb1"},"schema_version":"1.0"},"canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.711802Z","signature_b64":"LyOl3r8b3xV/lWQTQMf3+sfY3+dDgvvNaM9QQsX4yqOYOEc3rGNDvJGk10f8dodp4QOkWJ3sibH70ZLMFVKxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","last_reissued_at":"2026-05-18T00:05:19.711271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.711271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03429","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTdAmws7SMuJvBQ36UROA0bhrZkaeSQFTuMdPq3e4IOlSJO6ICFILd7Bn4LYrx9ozEdN1iO2HZxUgIObHRvoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:37.299837Z"},"content_sha256":"65e99e37d3b2e53d51d6290dd356fa3647a74f34a4ef8f6de817659deaaa472e","schema_version":"1.0","event_id":"sha256:65e99e37d3b2e53d51d6290dd356fa3647a74f34a4ef8f6de817659deaaa472e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WWI5IARQSDCZIWUQ43KXCHPPSV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Sparse Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Elena Grigorescu, Samson Zhou, Sidharth Jaggi, Venkata Gandikota","submitted_at":"2017-08-11T04:47:09Z","abstract_excerpt":"Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a \"small\" subset of $d$ defective items. In \"classical\" non-adaptive group testing, it is known that when $d$ is substantially smaller than $n$, $\\Theta(d\\log(n))$ tests are both information-theoretically necessary and sufficient to guarantee recovery with high probability. Group testing schemes in the literature meeting this bound require most items to be tested $\\Omega(\\log(n))$ times, and most tests to incorporate $\\Omega(n/d)$ items.\n  Motivated by physical c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03429","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91/p0Y5cVsNKb/3bBBVRooULPneHEAzQzeyNDctvk8PtYelkIT5WTsO1RHKISbdcYaGcHHdXZZzRkqcuOJhXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:37.300524Z"},"content_sha256":"3e7b65e5f070bace7b8447843dcc54e00dd556a0cf1b8a09e6646c02e65c85ea","schema_version":"1.0","event_id":"sha256:3e7b65e5f070bace7b8447843dcc54e00dd556a0cf1b8a09e6646c02e65c85ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/bundle.json","state_url":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/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-05-27T03:40:37Z","links":{"resolver":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV","bundle":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/bundle.json","state":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WWI5IARQSDCZIWUQ43KXCHPPSV","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":"c42e09eff495dd8af1ecd17f32c48c929e5e982b2deb7a46f9e6c90f022cccb1","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","title_canon_sha256":"b18c8451051e5f66546baf590ce2e311744056ec5919ec02c5dae4966590836b"},"schema_version":"1.0","source":{"id":"1708.03429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03429","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03429v2","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03429","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"WWI5IARQSDCZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WWI5IARQSDCZIWUQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WWI5IARQ","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:3e7b65e5f070bace7b8447843dcc54e00dd556a0cf1b8a09e6646c02e65c85ea","target":"graph","created_at":"2026-05-18T00:05:19Z","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":"Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a \"small\" subset of $d$ defective items. In \"classical\" non-adaptive group testing, it is known that when $d$ is substantially smaller than $n$, $\\Theta(d\\log(n))$ tests are both information-theoretically necessary and sufficient to guarantee recovery with high probability. Group testing schemes in the literature meeting this bound require most items to be tested $\\Omega(\\log(n))$ times, and most tests to incorporate $\\Omega(n/d)$ items.\n  Motivated by physical c","authors_text":"Elena Grigorescu, Samson Zhou, Sidharth Jaggi, Venkata Gandikota","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","title":"Nearly Optimal Sparse Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03429","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:65e99e37d3b2e53d51d6290dd356fa3647a74f34a4ef8f6de817659deaaa472e","target":"record","created_at":"2026-05-18T00:05:19Z","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":"c42e09eff495dd8af1ecd17f32c48c929e5e982b2deb7a46f9e6c90f022cccb1","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","title_canon_sha256":"b18c8451051e5f66546baf590ce2e311744056ec5919ec02c5dae4966590836b"},"schema_version":"1.0","source":{"id":"1708.03429","kind":"arxiv","version":2}},"canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","first_computed_at":"2026-05-18T00:05:19.711271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:19.711271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LyOl3r8b3xV/lWQTQMf3+sfY3+dDgvvNaM9QQsX4yqOYOEc3rGNDvJGk10f8dodp4QOkWJ3sibH70ZLMFVKxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:19.711802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65e99e37d3b2e53d51d6290dd356fa3647a74f34a4ef8f6de817659deaaa472e","sha256:3e7b65e5f070bace7b8447843dcc54e00dd556a0cf1b8a09e6646c02e65c85ea"],"state_sha256":"f2eb09d5693f0bd800d3145b3147e9f41a8fa883eb459973bfed773fd01dc2af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DebnkEK5hEWggrMUwTVTA0qyuziZNjxeYDzyGf3IWFPsHKRJZ/H+REzrnaKYveuaCtMn/KrKd9Sp14zwuixYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:40:37.304123Z","bundle_sha256":"24dca55bfebfdef843bea9357e46c9ac8e10fd75c66004e1b4564f924bfc2af5"}}