{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ED5H6B4DMF32EWKGWKWKSRK4UN","short_pith_number":"pith:ED5H6B4D","canonical_record":{"source":{"id":"1010.0433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-03T19:29:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e96149a8795e79b6e463998e199e3d8a4e43a209de3c94e017744da321139662","abstract_canon_sha256":"9d1bab2931e5f47b75cba4d92c0901bb2e2d40a5ce8982ab014b277604b8abfc"},"schema_version":"1.0"},"canonical_sha256":"20fa7f07836177a25946b2aca9455ca36a506b238d1bc10bfb85d7c74e12a8ba","source":{"kind":"arxiv","id":"1010.0433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0433","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0433v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0433","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"ED5H6B4DMF32","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ED5H6B4DMF32EWKG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ED5H6B4D","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ED5H6B4DMF32EWKGWKWKSRK4UN","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-03T19:29:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e96149a8795e79b6e463998e199e3d8a4e43a209de3c94e017744da321139662","abstract_canon_sha256":"9d1bab2931e5f47b75cba4d92c0901bb2e2d40a5ce8982ab014b277604b8abfc"},"schema_version":"1.0"},"canonical_sha256":"20fa7f07836177a25946b2aca9455ca36a506b238d1bc10bfb85d7c74e12a8ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:47.593380Z","signature_b64":"VNSjInXSlvdOlXsPE4PMq2NtqCJqrnCqM2Uy+MpkT8aFXUQ6wA4qzlDNc43fCEsHshNt1elRd3DpwOHWBQwuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20fa7f07836177a25946b2aca9455ca36a506b238d1bc10bfb85d7c74e12a8ba","last_reissued_at":"2026-05-18T02:23:47.592832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:47.592832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0433","source_version":1,"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-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4i45Hm+HC76LVKw3jVrgQLfN5z6DKuG1VOIYdVajDb9B9peN/292HgIZkX3IAa+NVfF2hngbIvhISv6SzV9HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:03.878528Z"},"content_sha256":"7865702008e5ea0f789cde827596083b7fef007e3c0d7a47077ba2fcfbe0ebdb","schema_version":"1.0","event_id":"sha256:7865702008e5ea0f789cde827596083b7fef007e3c0d7a47077ba2fcfbe0ebdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ED5H6B4DMF32EWKGWKWKSRK4UN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Derandomization and Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi","submitted_at":"2010-10-03T19:29:55Z","abstract_excerpt":"The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinatorial group testing. In its most basic setting, the aim of group testing is to identify a set of \"positive\" individuals in a population of items by taking groups of items and asking whether there is a positive in each group.\n  In particular, we will discuss explicit constructions of optimal or nearly-optimal group testing schemes using \"randomn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0433","kind":"arxiv","version":1},"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-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tV4CRt99p00wQPTBc71V5KDpWCJXh6VgF0ealIq8nYBlm2ti9/cEMbvSlEuGIMldFNlLeIPE8xQNhfKmktu/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:03.878877Z"},"content_sha256":"d0d94133be17953d6a9d710ded99778b52ed3da391b90fa3dff783a4467e55df","schema_version":"1.0","event_id":"sha256:d0d94133be17953d6a9d710ded99778b52ed3da391b90fa3dff783a4467e55df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/bundle.json","state_url":"https://pith.science/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/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-01T12:31:03Z","links":{"resolver":"https://pith.science/pith/ED5H6B4DMF32EWKGWKWKSRK4UN","bundle":"https://pith.science/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/bundle.json","state":"https://pith.science/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ED5H6B4DMF32EWKGWKWKSRK4UN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ED5H6B4DMF32EWKGWKWKSRK4UN","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":"9d1bab2931e5f47b75cba4d92c0901bb2e2d40a5ce8982ab014b277604b8abfc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-03T19:29:55Z","title_canon_sha256":"e96149a8795e79b6e463998e199e3d8a4e43a209de3c94e017744da321139662"},"schema_version":"1.0","source":{"id":"1010.0433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0433","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0433v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0433","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"ED5H6B4DMF32","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ED5H6B4DMF32EWKG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ED5H6B4D","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:d0d94133be17953d6a9d710ded99778b52ed3da391b90fa3dff783a4467e55df","target":"graph","created_at":"2026-05-18T02:23:47Z","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":"The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinatorial group testing. In its most basic setting, the aim of group testing is to identify a set of \"positive\" individuals in a population of items by taking groups of items and asking whether there is a positive in each group.\n  In particular, we will discuss explicit constructions of optimal or nearly-optimal group testing schemes using \"randomn","authors_text":"Mahdi Cheraghchi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-03T19:29:55Z","title":"Derandomization and Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0433","kind":"arxiv","version":1},"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:7865702008e5ea0f789cde827596083b7fef007e3c0d7a47077ba2fcfbe0ebdb","target":"record","created_at":"2026-05-18T02:23:47Z","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":"9d1bab2931e5f47b75cba4d92c0901bb2e2d40a5ce8982ab014b277604b8abfc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-03T19:29:55Z","title_canon_sha256":"e96149a8795e79b6e463998e199e3d8a4e43a209de3c94e017744da321139662"},"schema_version":"1.0","source":{"id":"1010.0433","kind":"arxiv","version":1}},"canonical_sha256":"20fa7f07836177a25946b2aca9455ca36a506b238d1bc10bfb85d7c74e12a8ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20fa7f07836177a25946b2aca9455ca36a506b238d1bc10bfb85d7c74e12a8ba","first_computed_at":"2026-05-18T02:23:47.592832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:47.592832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNSjInXSlvdOlXsPE4PMq2NtqCJqrnCqM2Uy+MpkT8aFXUQ6wA4qzlDNc43fCEsHshNt1elRd3DpwOHWBQwuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:47.593380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7865702008e5ea0f789cde827596083b7fef007e3c0d7a47077ba2fcfbe0ebdb","sha256:d0d94133be17953d6a9d710ded99778b52ed3da391b90fa3dff783a4467e55df"],"state_sha256":"6810f002619d58426411f51735b589efa5429be207560cd723a83807b7b0a894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0Gztex9iiVvA5lLQwa8oKe6xU+f5NT7rgc1+xH6sgCl/gmsbcd0ujXj3CKRzqktp6g1HNwIXspgexTGaUMbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:31:03.880888Z","bundle_sha256":"8bc024fdc21655d5f3b3e5341fc3e0bb0abc9bfa369416ef625cef4abfeae37a"}}