{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OORDDNVG3FOSC7E3L4E3SBAPZA","short_pith_number":"pith:OORDDNVG","schema_version":"1.0","canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","source":{"kind":"arxiv","id":"1701.06989","version":4},"attestation_state":"computed","paper":{"title":"Non-Adaptive Group Testing Framework based on Concatenation Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Minoru Kuribayashi, Thach V. Bui","submitted_at":"2017-01-24T17:31:20Z","abstract_excerpt":"We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as quickly as possible. Those $d$ specific items are called \\textit{defective items}. The idea of NAGT is to pool a group of items, which is called \\textit{a test}, then run a test on them. If the test outcome is \\textit{positive}, there exists at least one defective item in the test, and if it is \\textit{negative}, there exists no defective items. Formally, 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":"1701.06989","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T17:31:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"458655e2e019980ba5867f4dea5f45be8298a535884c1f83ba0d915a6283ab6d","abstract_canon_sha256":"8cf1c5b6ebfc504ce2870b700d193aa08ab7ea5a4a59a66ff96959da5e475cba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.370710Z","signature_b64":"jwmuXJ3YVjS2lPEW3VOmUjabqYMZyjDIYF91JjIFxiTbfBVyZ5hVHFZwq6tq0XgkCvJmIG+dlGxp50jvmEO/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","last_reissued_at":"2026-05-18T00:30:22.370102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.370102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Adaptive Group Testing Framework based on Concatenation Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Minoru Kuribayashi, Thach V. Bui","submitted_at":"2017-01-24T17:31:20Z","abstract_excerpt":"We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as quickly as possible. Those $d$ specific items are called \\textit{defective items}. The idea of NAGT is to pool a group of items, which is called \\textit{a test}, then run a test on them. If the test outcome is \\textit{positive}, there exists at least one defective item in the test, and if it is \\textit{negative}, there exists no defective items. Formally, a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06989","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":""},"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":"1701.06989","created_at":"2026-05-18T00:30:22.370203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06989v4","created_at":"2026-05-18T00:30:22.370203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06989","created_at":"2026-05-18T00:30:22.370203+00:00"},{"alias_kind":"pith_short_12","alias_value":"OORDDNVG3FOS","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OORDDNVG3FOSC7E3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OORDDNVG","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/OORDDNVG3FOSC7E3L4E3SBAPZA","json":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA.json","graph_json":"https://pith.science/api/pith-number/OORDDNVG3FOSC7E3L4E3SBAPZA/graph.json","events_json":"https://pith.science/api/pith-number/OORDDNVG3FOSC7E3L4E3SBAPZA/events.json","paper":"https://pith.science/paper/OORDDNVG"},"agent_actions":{"view_html":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA","download_json":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA.json","view_paper":"https://pith.science/paper/OORDDNVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/OORDDNVG3FOSC7E3L4E3SBAPZA/graph.json","fetch_events":"https://pith.science/api/pith-number/OORDDNVG3FOSC7E3L4E3SBAPZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/action/storage_attestation","attest_author":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/action/author_attestation","sign_citation":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/action/citation_signature","submit_replication":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/action/replication_record"}},"created_at":"2026-05-18T00:30:22.370203+00:00","updated_at":"2026-05-18T00:30:22.370203+00:00"}