{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LQAD6KYZQ3L65AAUXVVK56XGI6","short_pith_number":"pith:LQAD6KYZ","canonical_record":{"source":{"id":"1301.7023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T19:08:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"920959e03d28cedc4e4dd3737d0f7ce6a7e41cd9ad326f0bf7042c85ede74519","abstract_canon_sha256":"b1eeb2c1d8b12d7182bded63862d9fe331cafee7a74a31564c6d882156a2da9d"},"schema_version":"1.0"},"canonical_sha256":"5c003f2b1986d7ee8014bd6aaefae647925bf47df08157995c5ece1068525bad","source":{"kind":"arxiv","id":"1301.7023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7023","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7023v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7023","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"LQAD6KYZQ3L6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQAD6KYZQ3L65AAU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQAD6KYZ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LQAD6KYZQ3L65AAUXVVK56XGI6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T19:08:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"920959e03d28cedc4e4dd3737d0f7ce6a7e41cd9ad326f0bf7042c85ede74519","abstract_canon_sha256":"b1eeb2c1d8b12d7182bded63862d9fe331cafee7a74a31564c6d882156a2da9d"},"schema_version":"1.0"},"canonical_sha256":"5c003f2b1986d7ee8014bd6aaefae647925bf47df08157995c5ece1068525bad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.974940Z","signature_b64":"gGlXfpc5Zq5iSvwn2h6KVl8vbwardHqLvZVb/+MVb1woexffeoLCRPLvE1aUxSCJYYIiuB7sivZ1w+arEFIVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c003f2b1986d7ee8014bd6aaefae647925bf47df08157995c5ece1068525bad","last_reissued_at":"2026-05-18T00:05:00.974447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.974447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7023","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TynI0925VYs6QOapIMON2ulv2OAx1bPag1QbFWDpx/QuTwRb0UtzTWToYep80hoGccJU24tE2RDvv7C/IvO0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:20.401099Z"},"content_sha256":"527a18090f58173d8833e3befeb48b660e7b8c9b7dd703fa4e575d0e53f5b96e","schema_version":"1.0","event_id":"sha256:527a18090f58173d8833e3befeb48b660e7b8c9b7dd703fa4e575d0e53f5b96e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LQAD6KYZQ3L65AAUXVVK56XGI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Adaptive Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Leonardo Baldassini, Matthew Aldridge, Oliver Johnson","submitted_at":"2013-01-29T19:08:19Z","abstract_excerpt":"We define capacity for group testing problems and deduce bounds for the capacity of a variety of noisy models, based on the capacity of equivalent noisy communication channels. For noiseless adaptive group testing we prove an information-theoretic lower bound which tightens a bound of Chan et al. This can be combined with a performance analysis of a version of Hwang's adaptive group testing algorithm, in order to deduce the capacity of noiseless and erasure group testing models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7023","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-18T00:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNwwfWEqYJOoSFwUDsNBf3IhOhY/s9uzRD9SJIaTOwcQ01S1E3miNjHgGfGiz1fyQnjqckI52v42CUg7bYhIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:20.401528Z"},"content_sha256":"d3899e9036239aeb8e16b45ad8f257b7217c6ee6e06979e95a3c232dd5bf5a3f","schema_version":"1.0","event_id":"sha256:d3899e9036239aeb8e16b45ad8f257b7217c6ee6e06979e95a3c232dd5bf5a3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/bundle.json","state_url":"https://pith.science/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/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-03T09:58:20Z","links":{"resolver":"https://pith.science/pith/LQAD6KYZQ3L65AAUXVVK56XGI6","bundle":"https://pith.science/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/bundle.json","state":"https://pith.science/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQAD6KYZQ3L65AAUXVVK56XGI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LQAD6KYZQ3L65AAUXVVK56XGI6","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":"b1eeb2c1d8b12d7182bded63862d9fe331cafee7a74a31564c6d882156a2da9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T19:08:19Z","title_canon_sha256":"920959e03d28cedc4e4dd3737d0f7ce6a7e41cd9ad326f0bf7042c85ede74519"},"schema_version":"1.0","source":{"id":"1301.7023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7023","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7023v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7023","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"LQAD6KYZQ3L6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQAD6KYZQ3L65AAU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQAD6KYZ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d3899e9036239aeb8e16b45ad8f257b7217c6ee6e06979e95a3c232dd5bf5a3f","target":"graph","created_at":"2026-05-18T00:05:00Z","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 define capacity for group testing problems and deduce bounds for the capacity of a variety of noisy models, based on the capacity of equivalent noisy communication channels. For noiseless adaptive group testing we prove an information-theoretic lower bound which tightens a bound of Chan et al. This can be combined with a performance analysis of a version of Hwang's adaptive group testing algorithm, in order to deduce the capacity of noiseless and erasure group testing models.","authors_text":"Leonardo Baldassini, Matthew Aldridge, Oliver Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T19:08:19Z","title":"The Capacity of Adaptive Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7023","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:527a18090f58173d8833e3befeb48b660e7b8c9b7dd703fa4e575d0e53f5b96e","target":"record","created_at":"2026-05-18T00:05:00Z","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":"b1eeb2c1d8b12d7182bded63862d9fe331cafee7a74a31564c6d882156a2da9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T19:08:19Z","title_canon_sha256":"920959e03d28cedc4e4dd3737d0f7ce6a7e41cd9ad326f0bf7042c85ede74519"},"schema_version":"1.0","source":{"id":"1301.7023","kind":"arxiv","version":2}},"canonical_sha256":"5c003f2b1986d7ee8014bd6aaefae647925bf47df08157995c5ece1068525bad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c003f2b1986d7ee8014bd6aaefae647925bf47df08157995c5ece1068525bad","first_computed_at":"2026-05-18T00:05:00.974447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.974447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gGlXfpc5Zq5iSvwn2h6KVl8vbwardHqLvZVb/+MVb1woexffeoLCRPLvE1aUxSCJYYIiuB7sivZ1w+arEFIVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.974940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:527a18090f58173d8833e3befeb48b660e7b8c9b7dd703fa4e575d0e53f5b96e","sha256:d3899e9036239aeb8e16b45ad8f257b7217c6ee6e06979e95a3c232dd5bf5a3f"],"state_sha256":"701021b2682b194062aab47f7cc9a2a37600eca629f99271d48f9833fbe6ca7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpBdiiE0Ubj6GsPuRtPtWbuJA3YNyIQxQxuDhbXMHKXEnPEhY6rQ8Wfp4pHnsxfmkZ9opp2ySbIaQPvOuhkzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:58:20.403594Z","bundle_sha256":"5fbd8609f9a0d4ea57f33bbf1c03130e0b98a392a038b3c5dc7bd648834093f4"}}