{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:5W3GPCPH4XAJNZOHQE4W5KUWDU","short_pith_number":"pith:5W3GPCPH","canonical_record":{"source":{"id":"0811.2609","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-11-17T00:12:45Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"2092651aa3439744b14df8f4f0c8604d630dca3e1bd11fbf04bb15449bb57963","abstract_canon_sha256":"eab9610dc0af57d4ad9d8f51273e5108f0162519d0922858d4a320df8eb13f5d"},"schema_version":"1.0"},"canonical_sha256":"edb66789e7e5c096e5c781396eaa961d2ad2ed7e3a5fd8b0bb562d6c60ea97b9","source":{"kind":"arxiv","id":"0811.2609","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2609","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2609v3","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2609","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"5W3GPCPH4XAJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"5W3GPCPH4XAJNZOH","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"5W3GPCPH","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:5W3GPCPH4XAJNZOHQE4W5KUWDU","target":"record","payload":{"canonical_record":{"source":{"id":"0811.2609","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-11-17T00:12:45Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"2092651aa3439744b14df8f4f0c8604d630dca3e1bd11fbf04bb15449bb57963","abstract_canon_sha256":"eab9610dc0af57d4ad9d8f51273e5108f0162519d0922858d4a320df8eb13f5d"},"schema_version":"1.0"},"canonical_sha256":"edb66789e7e5c096e5c781396eaa961d2ad2ed7e3a5fd8b0bb562d6c60ea97b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:20.864630Z","signature_b64":"yP7g3mDAWa/h52gqr5GwzLpI94/uEvzfKHlkc3UFYJmt837BZf2YmBDMS/2KIzPJZQ63GPsX5TpiZeG3DX0OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb66789e7e5c096e5c781396eaa961d2ad2ed7e3a5fd8b0bb562d6c60ea97b9","last_reissued_at":"2026-05-18T02:15:20.863705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:20.863705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.2609","source_version":3,"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:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uKereyxfJedXIF/gkEBWNYJNNXgBZvX7WhsDJ6cWM8p5h73/7wIwayCnk1xZZngQ5LdfAaU77HvXUA/0u4YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:44:47.179209Z"},"content_sha256":"8c5d633b83375a3414a5a2d3b40bd2086c3c0542e6c206df5e40f3dd67704630","schema_version":"1.0","event_id":"sha256:8c5d633b83375a3414a5a2d3b40bd2086c3c0542e6c206df5e40f3dd67704630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:5W3GPCPH4XAJNZOHQE4W5KUWDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noise-Resilient Group Testing: Limitations and Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Mahdi Cheraghchi","submitted_at":"2008-11-17T00:12:45Z","abstract_excerpt":"We study combinatorial group testing schemes for learning $d$-sparse Boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the number of false observations, and show that any noise-resilient scheme in this model can only approximately reconstruct the sparse vector. On the positive side, we take this barrier to our advantage and show that approximate reconstruction (within a satisfactory degree of approximation) allows us to break the information theoretic lower bound of $\\tilde{\\Omega}(d^2 \\log n)$ that is known for exact reco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2609","kind":"arxiv","version":3},"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:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ecq8+neJa3dS5Ak2dZuOCQg9EZ1jHE7VekiAEikbPAfGmUMbHbioouGOsIIdeZbqIlJ5ZHRSZq8FqJPWObIrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:44:47.179872Z"},"content_sha256":"da9f9445bcb210e59a9e2386588dc914ecd4577ca3acb7d0eaf81702b4204845","schema_version":"1.0","event_id":"sha256:da9f9445bcb210e59a9e2386588dc914ecd4577ca3acb7d0eaf81702b4204845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/bundle.json","state_url":"https://pith.science/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/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-07T05:44:47Z","links":{"resolver":"https://pith.science/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU","bundle":"https://pith.science/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/bundle.json","state":"https://pith.science/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5W3GPCPH4XAJNZOHQE4W5KUWDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:5W3GPCPH4XAJNZOHQE4W5KUWDU","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":"eab9610dc0af57d4ad9d8f51273e5108f0162519d0922858d4a320df8eb13f5d","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-11-17T00:12:45Z","title_canon_sha256":"2092651aa3439744b14df8f4f0c8604d630dca3e1bd11fbf04bb15449bb57963"},"schema_version":"1.0","source":{"id":"0811.2609","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2609","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2609v3","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2609","created_at":"2026-05-18T02:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"5W3GPCPH4XAJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"5W3GPCPH4XAJNZOH","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"5W3GPCPH","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:da9f9445bcb210e59a9e2386588dc914ecd4577ca3acb7d0eaf81702b4204845","target":"graph","created_at":"2026-05-18T02:15:20Z","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":"We study combinatorial group testing schemes for learning $d$-sparse Boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the number of false observations, and show that any noise-resilient scheme in this model can only approximately reconstruct the sparse vector. On the positive side, we take this barrier to our advantage and show that approximate reconstruction (within a satisfactory degree of approximation) allows us to break the information theoretic lower bound of $\\tilde{\\Omega}(d^2 \\log n)$ that is known for exact reco","authors_text":"Mahdi Cheraghchi","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-11-17T00:12:45Z","title":"Noise-Resilient Group Testing: Limitations and Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2609","kind":"arxiv","version":3},"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:8c5d633b83375a3414a5a2d3b40bd2086c3c0542e6c206df5e40f3dd67704630","target":"record","created_at":"2026-05-18T02:15:20Z","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":"eab9610dc0af57d4ad9d8f51273e5108f0162519d0922858d4a320df8eb13f5d","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-11-17T00:12:45Z","title_canon_sha256":"2092651aa3439744b14df8f4f0c8604d630dca3e1bd11fbf04bb15449bb57963"},"schema_version":"1.0","source":{"id":"0811.2609","kind":"arxiv","version":3}},"canonical_sha256":"edb66789e7e5c096e5c781396eaa961d2ad2ed7e3a5fd8b0bb562d6c60ea97b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb66789e7e5c096e5c781396eaa961d2ad2ed7e3a5fd8b0bb562d6c60ea97b9","first_computed_at":"2026-05-18T02:15:20.863705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:15:20.863705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yP7g3mDAWa/h52gqr5GwzLpI94/uEvzfKHlkc3UFYJmt837BZf2YmBDMS/2KIzPJZQ63GPsX5TpiZeG3DX0OAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:15:20.864630Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.2609","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c5d633b83375a3414a5a2d3b40bd2086c3c0542e6c206df5e40f3dd67704630","sha256:da9f9445bcb210e59a9e2386588dc914ecd4577ca3acb7d0eaf81702b4204845"],"state_sha256":"0b2a2e2bb4d1786ebd951a482d5bdd71a0d78a9dc298ba2c9bdd9d22afb85407"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CelVUj7rOpYjChC7Kl5jlmzUqJYLKMs9I849gTR5BjIzKSEt9hEIWXEfVY8NRFC2PvTqNUUleq4enKvpcdA2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:44:47.183757Z","bundle_sha256":"e5c3abf92c5e03c288ac38aa96fca356500e124ded08a5457fc53a13cd1d6c5e"}}