{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OCXUIVLP2XHLV6U2A24XQ4VYLE","short_pith_number":"pith:OCXUIVLP","schema_version":"1.0","canonical_sha256":"70af44556fd5cebafa9a06b97872b85907ff0c6eccd77806c640a83b49317c1a","source":{"kind":"arxiv","id":"1712.07509","version":8},"attestation_state":"computed","paper":{"title":"Efficiently Decodable Non-Adaptive Threshold Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Mahdi Cheraghchi, Minoru Kuribayashi, Thach V. Bui","submitted_at":"2017-12-20T14:57:57Z","abstract_excerpt":"We consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \\leq u \\leq d$ defective items, and negative otherwise. The defective items can be identified using $t = O \\left( \\left( \\frac{d}{u} \\right)^u \\left( \\frac{d}{d - u} \\right)^{d-u} \\left(u \\log{\\frac{d}{u}} + \\log{\\frac{1}{\\epsilon}} \\right) \\cdot d^2 \\log{n} \\right)$ tests with probability at least $1 - \\epsilon$ for any $\\epsilon > 0$ or $t = O \\left( \\left( \\frac{d}{u} \\right)^u \\left( \\frac{d}{d -u} \\right)^{d - u} d^3 \\l"},"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":"1712.07509","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-20T14:57:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"180a6b95db7b93f49ea77adc992e1872b6fa63f1cacff3b552d41f2db01e5a67","abstract_canon_sha256":"e01bf728f2c37d05ee4b1504a65ca0bdfbed68c2b23f3a54bde0845e4faa41cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.382869Z","signature_b64":"6vw9/q7bL0M0uMUkZp0l1GGb5ZMA0lfrCLCEWSHsqHNXlftbZN2f8WV+MoJo0OKIilRJXp0RwwPrE8Ca9B6sAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70af44556fd5cebafa9a06b97872b85907ff0c6eccd77806c640a83b49317c1a","last_reissued_at":"2026-05-18T00:05:05.382214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.382214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Decodable Non-Adaptive Threshold Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Mahdi Cheraghchi, Minoru Kuribayashi, Thach V. Bui","submitted_at":"2017-12-20T14:57:57Z","abstract_excerpt":"We consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \\leq u \\leq d$ defective items, and negative otherwise. The defective items can be identified using $t = O \\left( \\left( \\frac{d}{u} \\right)^u \\left( \\frac{d}{d - u} \\right)^{d-u} \\left(u \\log{\\frac{d}{u}} + \\log{\\frac{1}{\\epsilon}} \\right) \\cdot d^2 \\log{n} \\right)$ tests with probability at least $1 - \\epsilon$ for any $\\epsilon > 0$ or $t = O \\left( \\left( \\frac{d}{u} \\right)^u \\left( \\frac{d}{d -u} \\right)^{d - u} d^3 \\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07509","kind":"arxiv","version":8},"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":"1712.07509","created_at":"2026-05-18T00:05:05.382323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07509v8","created_at":"2026-05-18T00:05:05.382323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07509","created_at":"2026-05-18T00:05:05.382323+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCXUIVLP2XHL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCXUIVLP2XHLV6U2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCXUIVLP","created_at":"2026-05-18T12:31:34.259226+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/OCXUIVLP2XHLV6U2A24XQ4VYLE","json":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE.json","graph_json":"https://pith.science/api/pith-number/OCXUIVLP2XHLV6U2A24XQ4VYLE/graph.json","events_json":"https://pith.science/api/pith-number/OCXUIVLP2XHLV6U2A24XQ4VYLE/events.json","paper":"https://pith.science/paper/OCXUIVLP"},"agent_actions":{"view_html":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE","download_json":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE.json","view_paper":"https://pith.science/paper/OCXUIVLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07509&json=true","fetch_graph":"https://pith.science/api/pith-number/OCXUIVLP2XHLV6U2A24XQ4VYLE/graph.json","fetch_events":"https://pith.science/api/pith-number/OCXUIVLP2XHLV6U2A24XQ4VYLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE/action/storage_attestation","attest_author":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE/action/author_attestation","sign_citation":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE/action/citation_signature","submit_replication":"https://pith.science/pith/OCXUIVLP2XHLV6U2A24XQ4VYLE/action/replication_record"}},"created_at":"2026-05-18T00:05:05.382323+00:00","updated_at":"2026-05-18T00:05:05.382323+00:00"}