{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OORDDNVG3FOSC7E3L4E3SBAPZA","short_pith_number":"pith:OORDDNVG","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"},"canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","source":{"kind":"arxiv","id":"1701.06989","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06989","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06989v4","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06989","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"OORDDNVG3FOS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OORDDNVG3FOSC7E3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OORDDNVG","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OORDDNVG3FOSC7E3L4E3SBAPZA","target":"record","payload":{"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"},"canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","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"},"source_kind":"arxiv","source_id":"1701.06989","source_version":4,"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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x/0iU73z1qFZ44rN+wu0GkrCHbsdWWE6moxBufbb7rnKjB/59TEhkZ0cyN4L7YXOCWZseFlbij8OGOBi8IBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:23.300101Z"},"content_sha256":"730f30f6aafd6111c7459f43d0f27d376b5b2930ae9548bb229d8a5f377038dc","schema_version":"1.0","event_id":"sha256:730f30f6aafd6111c7459f43d0f27d376b5b2930ae9548bb229d8a5f377038dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OORDDNVG3FOSC7E3L4E3SBAPZA","target":"graph","payload":{"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"},"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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLYh2jWcG6vmyuPqaS1GpWMg+IRcOBZx5BobfyER6w1DfKY+1OfYcfTjaAVfBwY381b3C+XHJXbnC/AnRZF0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:23.300893Z"},"content_sha256":"e9fd5d720562ed25ec8060550eddd4dac9a13b12b5af11e585d02fe9845a9e67","schema_version":"1.0","event_id":"sha256:e9fd5d720562ed25ec8060550eddd4dac9a13b12b5af11e585d02fe9845a9e67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/bundle.json","state_url":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/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-05-25T16:58:23Z","links":{"resolver":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA","bundle":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/bundle.json","state":"https://pith.science/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OORDDNVG3FOSC7E3L4E3SBAPZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OORDDNVG3FOSC7E3L4E3SBAPZA","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":"8cf1c5b6ebfc504ce2870b700d193aa08ab7ea5a4a59a66ff96959da5e475cba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T17:31:20Z","title_canon_sha256":"458655e2e019980ba5867f4dea5f45be8298a535884c1f83ba0d915a6283ab6d"},"schema_version":"1.0","source":{"id":"1701.06989","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06989","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06989v4","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06989","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"OORDDNVG3FOS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OORDDNVG3FOSC7E3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OORDDNVG","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:e9fd5d720562ed25ec8060550eddd4dac9a13b12b5af11e585d02fe9845a9e67","target":"graph","created_at":"2026-05-18T00:30:22Z","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":"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 ","authors_text":"Isao Echizen, Minoru Kuribayashi, Thach V. Bui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T17:31:20Z","title":"Non-Adaptive Group Testing Framework based on Concatenation Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06989","kind":"arxiv","version":4},"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:730f30f6aafd6111c7459f43d0f27d376b5b2930ae9548bb229d8a5f377038dc","target":"record","created_at":"2026-05-18T00:30:22Z","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":"8cf1c5b6ebfc504ce2870b700d193aa08ab7ea5a4a59a66ff96959da5e475cba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T17:31:20Z","title_canon_sha256":"458655e2e019980ba5867f4dea5f45be8298a535884c1f83ba0d915a6283ab6d"},"schema_version":"1.0","source":{"id":"1701.06989","kind":"arxiv","version":4}},"canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73a231b6a6d95d217c9b5f09b9040fc80af54c7c5a3fed470a044da8edfcc804","first_computed_at":"2026-05-18T00:30:22.370102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.370102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jwmuXJ3YVjS2lPEW3VOmUjabqYMZyjDIYF91JjIFxiTbfBVyZ5hVHFZwq6tq0XgkCvJmIG+dlGxp50jvmEO/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.370710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06989","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:730f30f6aafd6111c7459f43d0f27d376b5b2930ae9548bb229d8a5f377038dc","sha256:e9fd5d720562ed25ec8060550eddd4dac9a13b12b5af11e585d02fe9845a9e67"],"state_sha256":"71673eecc9dddfe1193e4fd2da1ee473aa651330701d68527a75b95bfad59b67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PXMIJA7iDnw1YdZDPWSRqMgBh+v4Nv7bkO5/SjLKEiBxm+upzBzVVYRZgI4msJhIKxqoXpVYjfU1G+joT7ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:58:23.304508Z","bundle_sha256":"bb8eeacfcc57985c93ef132e23d0a333d8cb2f047cc87a6f65d614be1857ff08"}}