{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WUZ6RXFIAEIBBNE5UWKNPDL2OA","short_pith_number":"pith:WUZ6RXFI","canonical_record":{"source":{"id":"1804.03819","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T05:46:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51337606db137b3ad1099f7ca6f86d583dfa20181efc03bf56e53314c44c971f","abstract_canon_sha256":"e195f0dbc1cdae4cbb4417e5ea1bf35c23b4ca22718d131e0c17702a99c688a5"},"schema_version":"1.0"},"canonical_sha256":"b533e8dca8011010b49da594d78d7a702f5668ea28131fcecebcd4afdfb577d0","source":{"kind":"arxiv","id":"1804.03819","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03819","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03819v4","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03819","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUZ6RXFIAEIB","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_16","alias_value":"WUZ6RXFIAEIBBNE5","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_8","alias_value":"WUZ6RXFI","created_at":"2026-07-05T00:29:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WUZ6RXFIAEIBBNE5UWKNPDL2OA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03819","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T05:46:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51337606db137b3ad1099f7ca6f86d583dfa20181efc03bf56e53314c44c971f","abstract_canon_sha256":"e195f0dbc1cdae4cbb4417e5ea1bf35c23b4ca22718d131e0c17702a99c688a5"},"schema_version":"1.0"},"canonical_sha256":"b533e8dca8011010b49da594d78d7a702f5668ea28131fcecebcd4afdfb577d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:35.466907Z","signature_b64":"f5qR7ezk6j4XGAr8cuh+FENdP47q60JNTg7gQzVwMNlCSd+Cj5Vhb6Kr92Oc3R6wwS7pIjsvE/nbWq6kEGlcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b533e8dca8011010b49da594d78d7a702f5668ea28131fcecebcd4afdfb577d0","last_reissued_at":"2026-07-05T00:29:35.466332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:35.466332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03819","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-07-05T00:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPjmzYCpnbkQtzFrG41Zff6MBuHuGEN0pkxqC6EHf3tCcc+XmkNJz5ZkqDr0Nynec3kjWA7nfa/PoTWKK02BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:31:36.694581Z"},"content_sha256":"c0f02370e99a6d304e33d9ee0909324812f8bff02b337d9c5c02dcf29ffb8fd7","schema_version":"1.0","event_id":"sha256:c0f02370e99a6d304e33d9ee0909324812f8bff02b337d9c5c02dcf29ffb8fd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WUZ6RXFIAEIBBNE5UWKNPDL2OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient (nonrandom) construction and decoding for non-adaptive group testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Minoru Kuribayashi, Roghayyeh Haghvirdinezhad, Tetsuya Kojima, Thach V. Bui","submitted_at":"2018-04-11T05:46:17Z","abstract_excerpt":"The task of non-adaptive group testing is to identify up to $d$ defective items from $N$ items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are $t$ tests, they can be represented as a $t \\times N$ measurement matrix. We have answered the question of whether there exists a scheme such that a larger measurement matrix, built from a given $t\\times N$ measurement matrix, can be used to identify up to $d$ defective items in time $O(t \\log_2{N})$. In the meantime, a $t \\times N$ nonrandom measurement matrix with $t = O \\left(\\frac{d^2 \\log_2^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.03819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vxyp6PyLQ/K1K2sz0KLXbBgWJNixtM2oOdLM0gOHDceBogvsmL5VoQVkU935Ru4C2HcteJVFWAcJJoTOE7GlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:31:36.695069Z"},"content_sha256":"0455e50d9255b05881b9a634f572f6f445dc83387eec5958a52708dffb3634d6","schema_version":"1.0","event_id":"sha256:0455e50d9255b05881b9a634f572f6f445dc83387eec5958a52708dffb3634d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/bundle.json","state_url":"https://pith.science/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/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-08-06T08:31:36Z","links":{"resolver":"https://pith.science/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA","bundle":"https://pith.science/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/bundle.json","state":"https://pith.science/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUZ6RXFIAEIBBNE5UWKNPDL2OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WUZ6RXFIAEIBBNE5UWKNPDL2OA","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":"e195f0dbc1cdae4cbb4417e5ea1bf35c23b4ca22718d131e0c17702a99c688a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T05:46:17Z","title_canon_sha256":"51337606db137b3ad1099f7ca6f86d583dfa20181efc03bf56e53314c44c971f"},"schema_version":"1.0","source":{"id":"1804.03819","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03819","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03819v4","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03819","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUZ6RXFIAEIB","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_16","alias_value":"WUZ6RXFIAEIBBNE5","created_at":"2026-07-05T00:29:35Z"},{"alias_kind":"pith_short_8","alias_value":"WUZ6RXFI","created_at":"2026-07-05T00:29:35Z"}],"graph_snapshots":[{"event_id":"sha256:0455e50d9255b05881b9a634f572f6f445dc83387eec5958a52708dffb3634d6","target":"graph","created_at":"2026-07-05T00:29:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1804.03819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The task of non-adaptive group testing is to identify up to $d$ defective items from $N$ items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are $t$ tests, they can be represented as a $t \\times N$ measurement matrix. We have answered the question of whether there exists a scheme such that a larger measurement matrix, built from a given $t\\times N$ measurement matrix, can be used to identify up to $d$ defective items in time $O(t \\log_2{N})$. In the meantime, a $t \\times N$ nonrandom measurement matrix with $t = O \\left(\\frac{d^2 \\log_2^","authors_text":"Isao Echizen, Minoru Kuribayashi, Roghayyeh Haghvirdinezhad, Tetsuya Kojima, Thach V. Bui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T05:46:17Z","title":"Efficient (nonrandom) construction and decoding for non-adaptive group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03819","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:c0f02370e99a6d304e33d9ee0909324812f8bff02b337d9c5c02dcf29ffb8fd7","target":"record","created_at":"2026-07-05T00:29:35Z","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":"e195f0dbc1cdae4cbb4417e5ea1bf35c23b4ca22718d131e0c17702a99c688a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T05:46:17Z","title_canon_sha256":"51337606db137b3ad1099f7ca6f86d583dfa20181efc03bf56e53314c44c971f"},"schema_version":"1.0","source":{"id":"1804.03819","kind":"arxiv","version":4}},"canonical_sha256":"b533e8dca8011010b49da594d78d7a702f5668ea28131fcecebcd4afdfb577d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b533e8dca8011010b49da594d78d7a702f5668ea28131fcecebcd4afdfb577d0","first_computed_at":"2026-07-05T00:29:35.466332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:35.466332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f5qR7ezk6j4XGAr8cuh+FENdP47q60JNTg7gQzVwMNlCSd+Cj5Vhb6Kr92Oc3R6wwS7pIjsvE/nbWq6kEGlcCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:35.466907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03819","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0f02370e99a6d304e33d9ee0909324812f8bff02b337d9c5c02dcf29ffb8fd7","sha256:0455e50d9255b05881b9a634f572f6f445dc83387eec5958a52708dffb3634d6"],"state_sha256":"fd082d5d467f1fa6a5b79365b89897b8353c3bd17dbf8d01ca42edf143d2ae2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMJnovFRZ0+FFUgiU1dJOtraXwRXZtGQciWCUyiNxZ11EI/0PaTPy/LuBy1FaHVOBBjaS5BZ+E/Rw2Y1QckkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:31:36.698498Z","bundle_sha256":"838bfe4d223087d9a1645649629befe9a645064bec421d896cf5b70bb5f5c417"}}