{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PCXRVT4JV54YS2GD2CIBZUYFC5","short_pith_number":"pith:PCXRVT4J","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"},"canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","source":{"kind":"arxiv","id":"1407.4446","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4446","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4446v3","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4446","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"PCXRVT4JV54Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PCXRVT4JV54YS2GD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PCXRVT4J","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PCXRVT4JV54YS2GD2CIBZUYFC5","target":"record","payload":{"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"},"canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","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"},"source_kind":"arxiv","source_id":"1407.4446","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-18T01:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRCsDhmhMyQjWKwukgv7kAnKjJXaJ17mXeFmVLJ6fFTAcDk8QDduciXPjhdqYNyXE63LeoV1UHlySZc1JDIADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:18:21.051890Z"},"content_sha256":"e8453d4e46a25df785bc857369a511cff49369dd8af841ba6cb4bc3089cb5df9","schema_version":"1.0","event_id":"sha256:e8453d4e46a25df785bc857369a511cff49369dd8af841ba6cb4bc3089cb5df9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PCXRVT4JV54YS2GD2CIBZUYFC5","target":"graph","payload":{"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"},"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-18T01:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2oOSoSkXMIY8qe/2B6XVusoS5VCMq3DAOmjATpyViNT2yUh7oFYIPaY4QpUEdPev+h25MmkyuFZUN/stwfCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:18:21.052574Z"},"content_sha256":"d57c99e36fdd7e4383183bd73af0c2579a40801f65dc1db109ceaaa74229b172","schema_version":"1.0","event_id":"sha256:d57c99e36fdd7e4383183bd73af0c2579a40801f65dc1db109ceaaa74229b172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/bundle.json","state_url":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/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-05-25T12:18:21Z","links":{"resolver":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5","bundle":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/bundle.json","state":"https://pith.science/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCXRVT4JV54YS2GD2CIBZUYFC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PCXRVT4JV54YS2GD2CIBZUYFC5","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":"97682e3c75d5d0439fb47ae4215fa55529acf6eb665bd7706d60a096a029a751","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T19:55:51Z","title_canon_sha256":"a61ed2c475f78e9f49a896c0a7de9c66981b09bb2bdc8cb15944c28b16b0d458"},"schema_version":"1.0","source":{"id":"1407.4446","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4446","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4446v3","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4446","created_at":"2026-05-18T01:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"PCXRVT4JV54Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PCXRVT4JV54YS2GD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PCXRVT4J","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d57c99e36fdd7e4383183bd73af0c2579a40801f65dc1db109ceaaa74229b172","target":"graph","created_at":"2026-05-18T01:32:19Z","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 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","authors_text":"Bruno M. Jedynak, Peter I. Frazier, Purnima Rajan, Weidong Han","cross_cats":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T19:55:51Z","title":"Probabilistic Group Testing under Sum Observations: A Parallelizable 2-Approximation for Entropy Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4446","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:e8453d4e46a25df785bc857369a511cff49369dd8af841ba6cb4bc3089cb5df9","target":"record","created_at":"2026-05-18T01:32:19Z","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":"97682e3c75d5d0439fb47ae4215fa55529acf6eb665bd7706d60a096a029a751","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T19:55:51Z","title_canon_sha256":"a61ed2c475f78e9f49a896c0a7de9c66981b09bb2bdc8cb15944c28b16b0d458"},"schema_version":"1.0","source":{"id":"1407.4446","kind":"arxiv","version":3}},"canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78af1acf89af798968c3d0901cd3051741c00f125571b96318c4856b3f67ec73","first_computed_at":"2026-05-18T01:32:19.024430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:19.024430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ok2UOEh2+RCAWWzAPfMr3JgJOl4jfmuoFTtAKp+Wt05lXci4zGb6s+WxMYvADbYnkwCAm5P4KMMWcJ6llRZUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:19.025075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4446","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8453d4e46a25df785bc857369a511cff49369dd8af841ba6cb4bc3089cb5df9","sha256:d57c99e36fdd7e4383183bd73af0c2579a40801f65dc1db109ceaaa74229b172"],"state_sha256":"d9a319f0a3b93b756841f14d337a03ee6bf01a78c3c0710ec51d4e910d1a4957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emxsN1hVNSlCm8alud/uJhifIUJ99FUsVytFZIl9CpC7+s/e2dxadDaKvNGPDiSm59KpVC/E+dLIWskfM+EpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:18:21.055470Z","bundle_sha256":"f8c68fcaa180f6b55098a697cebe8ef1a61838d07335d52e4911e8c07e5d104a"}}