{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XX3DW32CZILI7KQLN6QZM6MK6I","short_pith_number":"pith:XX3DW32C","schema_version":"1.0","canonical_sha256":"bdf63b6f42ca168faa0b6fa196798af21420a54369b1679f6fcad88c44d4af10","source":{"kind":"arxiv","id":"1401.3667","version":8},"attestation_state":"computed","paper":{"title":"Group Testing with Prior Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Sidharth Jaggi, Tarik Kaced, Tongxin Li, Wenhao Huang","submitted_at":"2014-01-15T17:00:31Z","abstract_excerpt":"We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily identically distributed. The goal of group testing algorithms is to identify with high probability the subset of defectives via non-linear (disjunctive) binary measurements. Our main contributions are two classes of algorithms: (1) adaptive algorithms with tests based either on a maximum entropy principle, or on a Shannon-Fano/Huffman code; (2) non-adaptive algorith"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.3667","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T17:00:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1076656a0b8b23bd5a47c4c6e1f24ba5434b25aec62e8322626a987bc4c5da45","abstract_canon_sha256":"2b9f8312de6444d6be2afe65ff86b9c36e545b6ef3d225489168a6a2dc7e038f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:14.406067Z","signature_b64":"mQix89/pWOoirmxI5tu8mK7NOjSHCCJFOieC87iG2v4GII2hRRXWthCroO+WOog2V+VpHTq41OWRU61AOy8aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf63b6f42ca168faa0b6fa196798af21420a54369b1679f6fcad88c44d4af10","last_reissued_at":"2026-05-18T00:10:14.405380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:14.405380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Testing with Prior Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Sidharth Jaggi, Tarik Kaced, Tongxin Li, Wenhao Huang","submitted_at":"2014-01-15T17:00:31Z","abstract_excerpt":"We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily identically distributed. The goal of group testing algorithms is to identify with high probability the subset of defectives via non-linear (disjunctive) binary measurements. Our main contributions are two classes of algorithms: (1) adaptive algorithms with tests based either on a maximum entropy principle, or on a Shannon-Fano/Huffman code; (2) non-adaptive algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3667","kind":"arxiv","version":8},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3667","created_at":"2026-05-18T00:10:14.405488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3667v8","created_at":"2026-05-18T00:10:14.405488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3667","created_at":"2026-05-18T00:10:14.405488+00:00"},{"alias_kind":"pith_short_12","alias_value":"XX3DW32CZILI","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XX3DW32CZILI7KQL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XX3DW32C","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I","json":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I.json","graph_json":"https://pith.science/api/pith-number/XX3DW32CZILI7KQLN6QZM6MK6I/graph.json","events_json":"https://pith.science/api/pith-number/XX3DW32CZILI7KQLN6QZM6MK6I/events.json","paper":"https://pith.science/paper/XX3DW32C"},"agent_actions":{"view_html":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I","download_json":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I.json","view_paper":"https://pith.science/paper/XX3DW32C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3667&json=true","fetch_graph":"https://pith.science/api/pith-number/XX3DW32CZILI7KQLN6QZM6MK6I/graph.json","fetch_events":"https://pith.science/api/pith-number/XX3DW32CZILI7KQLN6QZM6MK6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I/action/storage_attestation","attest_author":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I/action/author_attestation","sign_citation":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I/action/citation_signature","submit_replication":"https://pith.science/pith/XX3DW32CZILI7KQLN6QZM6MK6I/action/replication_record"}},"created_at":"2026-05-18T00:10:14.405488+00:00","updated_at":"2026-05-18T00:10:14.405488+00:00"}