{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LQZYZLDVJ7LOADFDPWL5VY4JIL","short_pith_number":"pith:LQZYZLDV","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"},"canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","source":{"kind":"arxiv","id":"1901.07635","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07635","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07635v3","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07635","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"LQZYZLDVJ7LO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LQZYZLDVJ7LOADFD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LQZYZLDV","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LQZYZLDVJ7LOADFDPWL5VY4JIL","target":"record","payload":{"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"},"canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","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"},"source_kind":"arxiv","source_id":"1901.07635","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-17T23:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8lK8esnoXnTgPEVY/TRYtlmDL4igw7+Ewku4fB8+fy9o6BNQbmO4DP58MmETqz2qnTbNMOtLxaW20AGeflACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:06:49.407297Z"},"content_sha256":"c7a9aed771f11ead8e5e7a1322da071b870519e8e75d73ab4b363719cce12f67","schema_version":"1.0","event_id":"sha256:c7a9aed771f11ead8e5e7a1322da071b870519e8e75d73ab4b363719cce12f67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LQZYZLDVJ7LOADFDPWL5VY4JIL","target":"graph","payload":{"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"},"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-17T23:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/7oGsrCMw/bSsX/ROT5KVA8FG2Wn4Hjl8QyfWyq1y4wK4BmRg9GyU74an17qI3X6qfnXZEUrLEPzTyQ5GsACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:06:49.407660Z"},"content_sha256":"c7b32488d956e736d235e49230ae2884249e32e9ad69b5d4a99827abd4534dc1","schema_version":"1.0","event_id":"sha256:c7b32488d956e736d235e49230ae2884249e32e9ad69b5d4a99827abd4534dc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/bundle.json","state_url":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/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-06-02T12:06:49Z","links":{"resolver":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL","bundle":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/bundle.json","state":"https://pith.science/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQZYZLDVJ7LOADFDPWL5VY4JIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LQZYZLDVJ7LOADFDPWL5VY4JIL","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":"5b4327243f8c0c6558844142097092a20d1941828999036b6d70dd58f2b0884c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T22:43:48Z","title_canon_sha256":"b74c51a719dae0221b7441e7c03c1876b5d9f7795ad55c10f2fd4d3cdfbed27c"},"schema_version":"1.0","source":{"id":"1901.07635","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07635","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07635v3","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07635","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"LQZYZLDVJ7LO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LQZYZLDVJ7LOADFD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LQZYZLDV","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:c7b32488d956e736d235e49230ae2884249e32e9ad69b5d4a99827abd4534dc1","target":"graph","created_at":"2026-05-17T23:47:50Z","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":"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","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi, Krishna R. Narayanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T22:43:48Z","title":"Sparse Graph Codes for Non-adaptive Quantitative Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07635","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:c7a9aed771f11ead8e5e7a1322da071b870519e8e75d73ab4b363719cce12f67","target":"record","created_at":"2026-05-17T23:47:50Z","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":"5b4327243f8c0c6558844142097092a20d1941828999036b6d70dd58f2b0884c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T22:43:48Z","title_canon_sha256":"b74c51a719dae0221b7441e7c03c1876b5d9f7795ad55c10f2fd4d3cdfbed27c"},"schema_version":"1.0","source":{"id":"1901.07635","kind":"arxiv","version":3}},"canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c338cac754fd6e00ca37d97dae38942d6e3235f1671f413eb5729ff9d6f7c3d","first_computed_at":"2026-05-17T23:47:50.700015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:50.700015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mWfq3BzzXWzwYcPyblz0of4fVnCgOFe0NTPiCJ5Qz3GwwFTYbP7QNafNubcYloHNBRrNBUjWcFq9owCGvRuWAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:50.700482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07635","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7a9aed771f11ead8e5e7a1322da071b870519e8e75d73ab4b363719cce12f67","sha256:c7b32488d956e736d235e49230ae2884249e32e9ad69b5d4a99827abd4534dc1"],"state_sha256":"9e64653fd02cf2b952739d234df403f2dfbee427001a411923363a52da58767c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sRcGp7vd83tYwHavmufe/1Ja8Dsa0i98E7+TFcpGX0huCbnkHY4R72LloHDB8PV1l7RmuZawhiNIMOcUBOjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:06:49.409591Z","bundle_sha256":"4a5b39e9a7f2c751af6be2a383e5ae10e1644c0c239c9f64fd1b5f7d0a2fa43a"}}