{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6LKMS22454PDLA64OLMTFEDX3S","short_pith_number":"pith:6LKMS224","schema_version":"1.0","canonical_sha256":"f2d4c96b5cef1e3583dc72d9329077dcbf55d9a99e7ba2ae324490931a709db9","source":{"kind":"arxiv","id":"2108.04342","version":2},"attestation_state":"computed","paper":{"title":"Near optimal efficient decoding from pooled data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Max Hahn-Klimroth, Noela M\\\"uller","submitted_at":"2021-08-09T20:47:25Z","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"},"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":"2108.04342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-09T20:47:25Z","cross_cats_sorted":["cs.DM","math.IT","math.ST","stat.TH"],"title_canon_sha256":"c547ec798562dbbb4b3504d37101cefdd419b518de646156e6bcdf44eeb54fb4","abstract_canon_sha256":"967e983839a656c07a0be58c85b5a15b3fd8fbc71e040f5e5b9823b8fddb4010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:29.297846Z","signature_b64":"qEdJtgPtJyEbpHFgbBBBpVBcNnDMoFaFPY1pQQnoL8pXRiYF8VyDmvsRdeFI6oI32ataqY0K5T++/okLpkRCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d4c96b5cef1e3583dc72d9329077dcbf55d9a99e7ba2ae324490931a709db9","last_reissued_at":"2026-07-05T03:55:29.297350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:29.297350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near optimal efficient decoding from pooled data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Max Hahn-Klimroth, Noela M\\\"uller","submitted_at":"2021-08-09T20:47:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.04342","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.04342/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.04342","created_at":"2026-07-05T03:55:29.297409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.04342v2","created_at":"2026-07-05T03:55:29.297409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.04342","created_at":"2026-07-05T03:55:29.297409+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LKMS22454PD","created_at":"2026-07-05T03:55:29.297409+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LKMS22454PDLA64","created_at":"2026-07-05T03:55:29.297409+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LKMS224","created_at":"2026-07-05T03:55:29.297409+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/6LKMS22454PDLA64OLMTFEDX3S","json":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S.json","graph_json":"https://pith.science/api/pith-number/6LKMS22454PDLA64OLMTFEDX3S/graph.json","events_json":"https://pith.science/api/pith-number/6LKMS22454PDLA64OLMTFEDX3S/events.json","paper":"https://pith.science/paper/6LKMS224"},"agent_actions":{"view_html":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S","download_json":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S.json","view_paper":"https://pith.science/paper/6LKMS224","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.04342&json=true","fetch_graph":"https://pith.science/api/pith-number/6LKMS22454PDLA64OLMTFEDX3S/graph.json","fetch_events":"https://pith.science/api/pith-number/6LKMS22454PDLA64OLMTFEDX3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S/action/storage_attestation","attest_author":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S/action/author_attestation","sign_citation":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S/action/citation_signature","submit_replication":"https://pith.science/pith/6LKMS22454PDLA64OLMTFEDX3S/action/replication_record"}},"created_at":"2026-07-05T03:55:29.297409+00:00","updated_at":"2026-07-05T03:55:29.297409+00:00"}