{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GHIMK6HLRIF5LASFA5WSZNM4SP","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":"410917d8f49fd34d35376fbea363b3c19f31974c401b7343d8fa7e85c60d7204","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-09T20:27:23Z","title_canon_sha256":"7ff95adaf375ce1b49966ae1f9eb55a699512a7693ab315416df11eb8e5857d9"},"schema_version":"1.0","source":{"id":"1001.1445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1445","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1445v2","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1445","created_at":"2026-05-18T04:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"GHIMK6HLRIF5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GHIMK6HLRIF5LASF","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GHIMK6HL","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:4e378c3f5fc1ba8180672f6b3acdf9937764eeeaf6187cfba18f74a95235aaa4","target":"graph","created_at":"2026-05-18T04:17:03Z","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":"Non-adaptive group testing involves grouping arbitrary subsets of $n$ items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most $d$ defective items. Motivated by applications in network tomography, sensor networks and infection propagation, a variation of group testing problems on graphs is formulated. Unlike conventional group testing problems, each group here must conform to the constraints imposed by a graph. For instance, items can be associated with vertices and each ","authors_text":"Amin Karbasi, Mahdi Cheraghchi, Soheil Mohajer, Venkatesh Saligrama","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-09T20:27:23Z","title":"Graph-Constrained Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1445","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:ae6d145aebfdb8bed66f91f7e42ca4c574f535c0a4f115ad075e83c0257e66cc","target":"record","created_at":"2026-05-18T04:17:03Z","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":"410917d8f49fd34d35376fbea363b3c19f31974c401b7343d8fa7e85c60d7204","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-09T20:27:23Z","title_canon_sha256":"7ff95adaf375ce1b49966ae1f9eb55a699512a7693ab315416df11eb8e5857d9"},"schema_version":"1.0","source":{"id":"1001.1445","kind":"arxiv","version":2}},"canonical_sha256":"31d0c578eb8a0bd58245076d2cb59c93d311a0a12c4540529ced21f958780e99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31d0c578eb8a0bd58245076d2cb59c93d311a0a12c4540529ced21f958780e99","first_computed_at":"2026-05-18T04:17:03.422964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:03.422964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tJxOK+poe6lcToWQklMiQ79/D+w3b0+5qqTKl5k6UVCkWd9XLRWxHjproM+ZXhlRmtSWUZzf5d5yNXu5bhSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:03.423440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae6d145aebfdb8bed66f91f7e42ca4c574f535c0a4f115ad075e83c0257e66cc","sha256:4e378c3f5fc1ba8180672f6b3acdf9937764eeeaf6187cfba18f74a95235aaa4"],"state_sha256":"84e1e630f3e2abaf8e75b8bd2ebccf349f6380002f4e6b95a39d5f81b31297c0"}