{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PM4CKUDVOJWQ4TQ6DKM4TK4AUU","short_pith_number":"pith:PM4CKUDV","canonical_record":{"source":{"id":"1808.01457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-04T09:30:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0c653320927e423e6228f150217b686b69fb0042fc73ea11a58975c0fb68c2b","abstract_canon_sha256":"8b4cea448c12ef40cde224408d5ef92abee3628780db6dd64d631af3aef5e156"},"schema_version":"1.0"},"canonical_sha256":"7b38255075726d0e4e1e1a99c9ab80a5239eca85ae021735d9b64e53a407731d","source":{"kind":"arxiv","id":"1808.01457","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01457","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01457v2","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01457","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"PM4CKUDVOJWQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PM4CKUDVOJWQ4TQ6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PM4CKUDV","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PM4CKUDVOJWQ4TQ6DKM4TK4AUU","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-04T09:30:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0c653320927e423e6228f150217b686b69fb0042fc73ea11a58975c0fb68c2b","abstract_canon_sha256":"8b4cea448c12ef40cde224408d5ef92abee3628780db6dd64d631af3aef5e156"},"schema_version":"1.0"},"canonical_sha256":"7b38255075726d0e4e1e1a99c9ab80a5239eca85ae021735d9b64e53a407731d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:41.355650Z","signature_b64":"Gf1y4v29UAQMzSHjoPAvdhuPNV+ARa6+mErpxoCwcKMjFSJOqxyxK07cJve9RySPvktlzjQ5nXBixkhFTNBSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b38255075726d0e4e1e1a99c9ab80a5239eca85ae021735d9b64e53a407731d","last_reissued_at":"2026-05-17T23:52:41.354979Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:41.354979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01457","source_version":2,"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:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVi2g4UGKYhwbXI4Ptuz1J5RgZTTXo2cd+TscwXYrGBc+ibTiR0/I3mBgcxC8cmqBKbc4OotQXnq6uqaL95fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:27:45.782096Z"},"content_sha256":"c538a30e7f938086ea1ab7699dff3258d6a3a35584e92456106cf573397afcc2","schema_version":"1.0","event_id":"sha256:c538a30e7f938086ea1ab7699dff3258d6a3a35584e92456106cf573397afcc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PM4CKUDVOJWQ4TQ6DKM4TK4AUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Huseyin A. Inan, Mary Wootters, Peter Kairouz","submitted_at":"2018-08-04T09:30:44Z","abstract_excerpt":"We consider the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $\\Theta(d \\log N)$ tests are necessary and sufficient to recover the defective set with vanishing probability of error when $d = O(N^{\\alpha})$ for some $\\alpha \\in (0, 1)$. However, to the best of our knowledge, there is no explicit (deterministic) construction achieving $\\Theta(d \\log N)$ tests in general. In this work, we show that a famous construction introduced by Kautz and Singleton for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01457","kind":"arxiv","version":2},"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:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3d6jPWKE+o4Dpp9v3mOveGxNbBSXiHWvP7/uF7D5qekhyKjz3sR9YC7HZvF1zOLncq00pWWPDRQSoN0rP0HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:27:45.782745Z"},"content_sha256":"d9b43a308843445353e7b868b9c7caf4bbacc57d4705b92e7918203f9058abca","schema_version":"1.0","event_id":"sha256:d9b43a308843445353e7b868b9c7caf4bbacc57d4705b92e7918203f9058abca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/bundle.json","state_url":"https://pith.science/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/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-07T20:27:45Z","links":{"resolver":"https://pith.science/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU","bundle":"https://pith.science/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/bundle.json","state":"https://pith.science/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PM4CKUDVOJWQ4TQ6DKM4TK4AUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PM4CKUDVOJWQ4TQ6DKM4TK4AUU","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":"8b4cea448c12ef40cde224408d5ef92abee3628780db6dd64d631af3aef5e156","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-04T09:30:44Z","title_canon_sha256":"a0c653320927e423e6228f150217b686b69fb0042fc73ea11a58975c0fb68c2b"},"schema_version":"1.0","source":{"id":"1808.01457","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01457","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01457v2","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01457","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"PM4CKUDVOJWQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PM4CKUDVOJWQ4TQ6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PM4CKUDV","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:d9b43a308843445353e7b868b9c7caf4bbacc57d4705b92e7918203f9058abca","target":"graph","created_at":"2026-05-17T23:52:41Z","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 the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $\\Theta(d \\log N)$ tests are necessary and sufficient to recover the defective set with vanishing probability of error when $d = O(N^{\\alpha})$ for some $\\alpha \\in (0, 1)$. However, to the best of our knowledge, there is no explicit (deterministic) construction achieving $\\Theta(d \\log N)$ tests in general. In this work, we show that a famous construction introduced by Kautz and Singleton for the","authors_text":"Ayfer Ozgur, Huseyin A. Inan, Mary Wootters, Peter Kairouz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-04T09:30:44Z","title":"On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01457","kind":"arxiv","version":2},"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:c538a30e7f938086ea1ab7699dff3258d6a3a35584e92456106cf573397afcc2","target":"record","created_at":"2026-05-17T23:52:41Z","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":"8b4cea448c12ef40cde224408d5ef92abee3628780db6dd64d631af3aef5e156","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-04T09:30:44Z","title_canon_sha256":"a0c653320927e423e6228f150217b686b69fb0042fc73ea11a58975c0fb68c2b"},"schema_version":"1.0","source":{"id":"1808.01457","kind":"arxiv","version":2}},"canonical_sha256":"7b38255075726d0e4e1e1a99c9ab80a5239eca85ae021735d9b64e53a407731d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b38255075726d0e4e1e1a99c9ab80a5239eca85ae021735d9b64e53a407731d","first_computed_at":"2026-05-17T23:52:41.354979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:41.354979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gf1y4v29UAQMzSHjoPAvdhuPNV+ARa6+mErpxoCwcKMjFSJOqxyxK07cJve9RySPvktlzjQ5nXBixkhFTNBSCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:41.355650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01457","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c538a30e7f938086ea1ab7699dff3258d6a3a35584e92456106cf573397afcc2","sha256:d9b43a308843445353e7b868b9c7caf4bbacc57d4705b92e7918203f9058abca"],"state_sha256":"a88fb8083bcbed8946a7d63b6fdd0e0a3998813a75d0fbbaf0a9dc5106febe64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5JxuHbeq9ifGXcGUP9VQXHAdJIfOP8mf82YlhiEOoxFLppJ+SJUzceJjiBrz34jvCIVn/FAyHoVRzZkCtlMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:27:45.786719Z","bundle_sha256":"100088da00cedfbcbed84a1cde4f36ad48d59502b815e1050f17c660088fda8b"}}