{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TAFYXKWE2RCXWPMZVCRFCIC4TM","short_pith_number":"pith:TAFYXKWE","schema_version":"1.0","canonical_sha256":"980b8baac4d4457b3d99a8a251205c9b0a3326a40e4ea97697cbd78fde8e957c","source":{"kind":"arxiv","id":"2309.15507","version":4},"attestation_state":"computed","paper":{"title":"Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Nelvin Tan, Pablo Pascual Cobo, Ramji Venkataramanan","submitted_at":"2023-09-27T09:20:57Z","abstract_excerpt":"In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number of items of each category within the pool. We study an approximate message passing (AMP) algorithm for estimating the categories and rigorously characterize its performance, in both the noiseless and noisy settings. For the noiseless setting, we show that the AMP algorithm is equivalent to one recently proposed by El Alaoui et al. Our results provide a rigorous version of their performance guarantees, previously obtai"},"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":"2309.15507","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-27T09:20:57Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"946f4b55e1d7d6fd8b82a8d5fd5c1d88b31b888d0ec25fd2015b5086b6529e8b","abstract_canon_sha256":"f2364df815882c02bb97d56fd0e4a0b4daec5a1a79c2cfc91bb522818ad08138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:54.550544Z","signature_b64":"G2+CoQj9V9PC9OzIaiiDz/0glz8uxwv/NeGX7qoHcOvXm1O0odbXSfCAY7Mls22LBk1s88D+GE8IFS0oCqNWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980b8baac4d4457b3d99a8a251205c9b0a3326a40e4ea97697cbd78fde8e957c","last_reissued_at":"2026-07-05T09:24:54.550106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:54.550106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Nelvin Tan, Pablo Pascual Cobo, Ramji Venkataramanan","submitted_at":"2023-09-27T09:20:57Z","abstract_excerpt":"In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number of items of each category within the pool. We study an approximate message passing (AMP) algorithm for estimating the categories and rigorously characterize its performance, in both the noiseless and noisy settings. For the noiseless setting, we show that the AMP algorithm is equivalent to one recently proposed by El Alaoui et al. Our results provide a rigorous version of their performance guarantees, previously obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15507","kind":"arxiv","version":4},"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/2309.15507/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":"2309.15507","created_at":"2026-07-05T09:24:54.550157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15507v4","created_at":"2026-07-05T09:24:54.550157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15507","created_at":"2026-07-05T09:24:54.550157+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAFYXKWE2RCX","created_at":"2026-07-05T09:24:54.550157+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAFYXKWE2RCXWPMZ","created_at":"2026-07-05T09:24:54.550157+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAFYXKWE","created_at":"2026-07-05T09:24:54.550157+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01723","citing_title":"Learning to Ask: Decision Transformers for Adaptive Quantitative Group Testing","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM","json":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM.json","graph_json":"https://pith.science/api/pith-number/TAFYXKWE2RCXWPMZVCRFCIC4TM/graph.json","events_json":"https://pith.science/api/pith-number/TAFYXKWE2RCXWPMZVCRFCIC4TM/events.json","paper":"https://pith.science/paper/TAFYXKWE"},"agent_actions":{"view_html":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM","download_json":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM.json","view_paper":"https://pith.science/paper/TAFYXKWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15507&json=true","fetch_graph":"https://pith.science/api/pith-number/TAFYXKWE2RCXWPMZVCRFCIC4TM/graph.json","fetch_events":"https://pith.science/api/pith-number/TAFYXKWE2RCXWPMZVCRFCIC4TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM/action/storage_attestation","attest_author":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM/action/author_attestation","sign_citation":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM/action/citation_signature","submit_replication":"https://pith.science/pith/TAFYXKWE2RCXWPMZVCRFCIC4TM/action/replication_record"}},"created_at":"2026-07-05T09:24:54.550157+00:00","updated_at":"2026-07-05T09:24:54.550157+00:00"}