{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PCXRVT4JV54YS2GD2CIBZUYFC5","short_pith_number":"pith:PCXRVT4J","schema_version":"1.0","canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","source":{"kind":"arxiv","id":"1407.4446","version":3},"attestation_state":"computed","paper":{"title":"Probabilistic Group Testing under Sum Observations: A Parallelizable 2-Approximation for Entropy Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Bruno M. Jedynak, Peter I. Frazier, Purnima Rajan, Weidong Han","submitted_at":"2014-07-16T19:55:51Z","abstract_excerpt":"We consider the problem of group testing with sum observations and noiseless answers, in which we aim to locate multiple objects by querying the number of objects in each of a sequence of chosen sets. We study a probabilistic setting with entropy loss, in which we assume a joint Bayesian prior density on the locations of the objects and seek to choose the sets queried to minimize the expected entropy of the Bayesian posterior distribution after a fixed number of questions. We present a new non-adaptive policy, called the dyadic policy, show it is optimal among non-adaptive policies, and is wit"},"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":"1407.4446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T19:55:51Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a61ed2c475f78e9f49a896c0a7de9c66981b09bb2bdc8cb15944c28b16b0d458","abstract_canon_sha256":"97682e3c75d5d0439fb47ae4215fa55529acf6eb665bd7706d60a096a029a751"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:19.025075Z","signature_b64":"Ok2UOEh2+RCAWWzAPfMr3JgJOl4jfmuoFTtAKp+Wt05lXci4zGb6s+WxMYvADbYnkwCAm5P4KMMWcJ6llRZUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","last_reissued_at":"2026-05-18T01:32:19.024430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:19.024430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Group Testing under Sum Observations: A Parallelizable 2-Approximation for Entropy Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Bruno M. Jedynak, Peter I. Frazier, Purnima Rajan, Weidong Han","submitted_at":"2014-07-16T19:55:51Z","abstract_excerpt":"We consider the problem of group testing with sum observations and noiseless answers, in which we aim to locate multiple objects by querying the number of objects in each of a sequence of chosen sets. We study a probabilistic setting with entropy loss, in which we assume a joint Bayesian prior density on the locations of the objects and seek to choose the sets queried to minimize the expected entropy of the Bayesian posterior distribution after a fixed number of questions. We present a new non-adaptive policy, called the dyadic policy, show it is optimal among non-adaptive policies, and is wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4446","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4446","created_at":"2026-05-18T01:32:19.024526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4446v3","created_at":"2026-05-18T01:32:19.024526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4446","created_at":"2026-05-18T01:32:19.024526+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCXRVT4JV54Y","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCXRVT4JV54YS2GD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCXRVT4J","created_at":"2026-05-18T12:28:43.426989+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/PCXRVT4JV54YS2GD2CIBZUYFC5","json":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5.json","graph_json":"https://pith.science/api/pith-number/PCXRVT4JV54YS2GD2CIBZUYFC5/graph.json","events_json":"https://pith.science/api/pith-number/PCXRVT4JV54YS2GD2CIBZUYFC5/events.json","paper":"https://pith.science/paper/PCXRVT4J"},"agent_actions":{"view_html":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5","download_json":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5.json","view_paper":"https://pith.science/paper/PCXRVT4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4446&json=true","fetch_graph":"https://pith.science/api/pith-number/PCXRVT4JV54YS2GD2CIBZUYFC5/graph.json","fetch_events":"https://pith.science/api/pith-number/PCXRVT4JV54YS2GD2CIBZUYFC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/action/storage_attestation","attest_author":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/action/author_attestation","sign_citation":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/action/citation_signature","submit_replication":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/action/replication_record"}},"created_at":"2026-05-18T01:32:19.024526+00:00","updated_at":"2026-05-18T01:32:19.024526+00:00"}