{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LQZYZLDVJ7LOADFDPWL5VY4JIL","short_pith_number":"pith:LQZYZLDV","schema_version":"1.0","canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","source":{"kind":"arxiv","id":"1901.07635","version":3},"attestation_state":"computed","paper":{"title":"Sparse Graph Codes for Non-adaptive Quantitative Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi, Krishna R. Narayanan","submitted_at":"2019-01-22T22:43:48Z","abstract_excerpt":"This paper considers the problem of Quantitative Group Testing (QGT). Consider a set of $N$ items among which $K$ items are defective. The QGT problem is to identify (all or a sufficiently large fraction of) the defective items, where the result of a test reveals the number of defective items in the tested group. In this work, we propose a non-adaptive QGT algorithm using sparse graph codes over bi-regular bipartite graphs with left-degree $\\ell$ and right degree $r$ and binary $t$-error-correcting BCH codes. The proposed scheme provides exact recovery with probabilistic guarantee, i.e. recove"},"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":"1901.07635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T22:43:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b74c51a719dae0221b7441e7c03c1876b5d9f7795ad55c10f2fd4d3cdfbed27c","abstract_canon_sha256":"5b4327243f8c0c6558844142097092a20d1941828999036b6d70dd58f2b0884c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.700482Z","signature_b64":"mWfq3BzzXWzwYcPyblz0of4fVnCgOFe0NTPiCJ5Qz3GwwFTYbP7QNafNubcYloHNBRrNBUjWcFq9owCGvRuWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","last_reissued_at":"2026-05-17T23:47:50.700015Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.700015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Graph Codes for Non-adaptive Quantitative Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi, Krishna R. Narayanan","submitted_at":"2019-01-22T22:43:48Z","abstract_excerpt":"This paper considers the problem of Quantitative Group Testing (QGT). Consider a set of $N$ items among which $K$ items are defective. The QGT problem is to identify (all or a sufficiently large fraction of) the defective items, where the result of a test reveals the number of defective items in the tested group. In this work, we propose a non-adaptive QGT algorithm using sparse graph codes over bi-regular bipartite graphs with left-degree $\\ell$ and right degree $r$ and binary $t$-error-correcting BCH codes. The proposed scheme provides exact recovery with probabilistic guarantee, i.e. recove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07635","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":"1901.07635","created_at":"2026-05-17T23:47:50.700083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07635v3","created_at":"2026-05-17T23:47:50.700083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07635","created_at":"2026-05-17T23:47:50.700083+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQZYZLDVJ7LO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQZYZLDVJ7LOADFD","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQZYZLDV","created_at":"2026-05-18T12:33:21.387695+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/LQZYZLDVJ7LOADFDPWL5VY4JIL","json":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL.json","graph_json":"https://pith.science/api/pith-number/LQZYZLDVJ7LOADFDPWL5VY4JIL/graph.json","events_json":"https://pith.science/api/pith-number/LQZYZLDVJ7LOADFDPWL5VY4JIL/events.json","paper":"https://pith.science/paper/LQZYZLDV"},"agent_actions":{"view_html":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL","download_json":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL.json","view_paper":"https://pith.science/paper/LQZYZLDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07635&json=true","fetch_graph":"https://pith.science/api/pith-number/LQZYZLDVJ7LOADFDPWL5VY4JIL/graph.json","fetch_events":"https://pith.science/api/pith-number/LQZYZLDVJ7LOADFDPWL5VY4JIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/action/storage_attestation","attest_author":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/action/author_attestation","sign_citation":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/action/citation_signature","submit_replication":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/action/replication_record"}},"created_at":"2026-05-17T23:47:50.700083+00:00","updated_at":"2026-05-17T23:47:50.700083+00:00"}