{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6LKMS22454PDLA64OLMTFEDX3S","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":"967e983839a656c07a0be58c85b5a15b3fd8fbc71e040f5e5b9823b8fddb4010","cross_cats_sorted":["cs.DM","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-09T20:47:25Z","title_canon_sha256":"c547ec798562dbbb4b3504d37101cefdd419b518de646156e6bcdf44eeb54fb4"},"schema_version":"1.0","source":{"id":"2108.04342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.04342","created_at":"2026-07-05T03:55:29Z"},{"alias_kind":"arxiv_version","alias_value":"2108.04342v2","created_at":"2026-07-05T03:55:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.04342","created_at":"2026-07-05T03:55:29Z"},{"alias_kind":"pith_short_12","alias_value":"6LKMS22454PD","created_at":"2026-07-05T03:55:29Z"},{"alias_kind":"pith_short_16","alias_value":"6LKMS22454PDLA64","created_at":"2026-07-05T03:55:29Z"},{"alias_kind":"pith_short_8","alias_value":"6LKMS224","created_at":"2026-07-05T03:55:29Z"}],"graph_snapshots":[{"event_id":"sha256:b04f590a7483a56b5fed1e9dbdfe9aec784d21d079865edfe347203146302647","target":"graph","created_at":"2026-07-05T03:55:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.04342/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider $n$ items, each of which is characterised by one of $d+1$ possible features in $\\{0, \\ldots, d\\}$. We study the inference task of learning these types by queries on subsets, or pools, of the items that only reveal a form of coarsened information on the features - in our case, the sum of all the features in the pool. This is a realistic scenario in situations where one has memory or technical constraints in the data collection process, or where the data is subject to anonymisation. Related prominent problems are the quantitative group testing problem, of which it is a generalisation, a","authors_text":"Max Hahn-Klimroth, Noela M\\\"uller","cross_cats":["cs.DM","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-09T20:47:25Z","title":"Near optimal efficient decoding from pooled data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.04342","kind":"arxiv","version":2},"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:579f7ba24467475f959c730e364383f5b31513c140fd4526018f72ab989d2147","target":"record","created_at":"2026-07-05T03:55:29Z","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":"967e983839a656c07a0be58c85b5a15b3fd8fbc71e040f5e5b9823b8fddb4010","cross_cats_sorted":["cs.DM","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-09T20:47:25Z","title_canon_sha256":"c547ec798562dbbb4b3504d37101cefdd419b518de646156e6bcdf44eeb54fb4"},"schema_version":"1.0","source":{"id":"2108.04342","kind":"arxiv","version":2}},"canonical_sha256":"f2d4c96b5cef1e3583dc72d9329077dcbf55d9a99e7ba2ae324490931a709db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2d4c96b5cef1e3583dc72d9329077dcbf55d9a99e7ba2ae324490931a709db9","first_computed_at":"2026-07-05T03:55:29.297350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:55:29.297350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEdJtgPtJyEbpHFgbBBBpVBcNnDMoFaFPY1pQQnoL8pXRiYF8VyDmvsRdeFI6oI32ataqY0K5T++/okLpkRCCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:55:29.297846Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.04342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:579f7ba24467475f959c730e364383f5b31513c140fd4526018f72ab989d2147","sha256:b04f590a7483a56b5fed1e9dbdfe9aec784d21d079865edfe347203146302647"],"state_sha256":"55a8f0c5fee0cdd1095ee66b6f8e6fa0e027740d2b5b1dbd962464fdb6e729f2"}