{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MSUNQ3O2PMKIL6BGL37PZIOEKZ","short_pith_number":"pith:MSUNQ3O2","canonical_record":{"source":{"id":"1401.7505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T13:16:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53edd9f5d5232ec59cb5870a8dfbe7be954291bc02f61686ece44cc81b68cc61","abstract_canon_sha256":"6b655ff68422dc8b9c2756a83fa341964ed5263472da586dac465af10ffcc12f"},"schema_version":"1.0"},"canonical_sha256":"64a8d86dda7b1485f8265efefca1c45663f452f1d1d4acc661102dd77d4b35c5","source":{"kind":"arxiv","id":"1401.7505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7505","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7505v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7505","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"MSUNQ3O2PMKI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSUNQ3O2PMKIL6BG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSUNQ3O2","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MSUNQ3O2PMKIL6BGL37PZIOEKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T13:16:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53edd9f5d5232ec59cb5870a8dfbe7be954291bc02f61686ece44cc81b68cc61","abstract_canon_sha256":"6b655ff68422dc8b9c2756a83fa341964ed5263472da586dac465af10ffcc12f"},"schema_version":"1.0"},"canonical_sha256":"64a8d86dda7b1485f8265efefca1c45663f452f1d1d4acc661102dd77d4b35c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.134060Z","signature_b64":"sZBxo5L+vBFoBGPZ3ef0nNNtz5MdNjyKbexhS1xILlEfPK1CsyETh3D+7ZLe3W8e4ZzaC7Td1q4752mlFigtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a8d86dda7b1485f8265efefca1c45663f452f1d1d4acc661102dd77d4b35c5","last_reissued_at":"2026-05-18T03:00:48.133311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.133311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7505","source_version":1,"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-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUvdJcLVgsCj2Oi4M4nfmO6AX2wPWK6ftbHxXBM+JcBcNATxze48ii9wmxtgOF8Ox2vIM0xaYdxwNQjYn11NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:17:02.108606Z"},"content_sha256":"a5c66352a971eb081879d635fce08b9a5b2bb4d24da7a0a7c5c171c5d3c9ff1d","schema_version":"1.0","event_id":"sha256:a5c66352a971eb081879d635fce08b9a5b2bb4d24da7a0a7c5c171c5d3c9ff1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MSUNQ3O2PMKIL6BGL37PZIOEKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lectures on Designing Screening Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arkadii G. D'yachkov","submitted_at":"2014-01-29T13:16:40Z","abstract_excerpt":"Designing Screening Experiments (DSE) is a class of information - theoretical models for multiple - access channels (MAC). We discuss the combinatorial model of DSE called a disjunct channel model. This model is the most important for applications and closely connected with the superimposed code concept. We give a detailed survey of lower and upper bounds on the rate of superimposed codes. The best known constructions of superimposed codes are considered in paper. We also discuss the development of these codes (non-adaptive pooling designs) intended for the clone - library screening problem. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7505","kind":"arxiv","version":1},"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-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sR4MGbQdGCHhYK0wjHqN3NOCqrY8kL37GqDvVGgMwVoPIJZuIyfc1eSq2b6Px7ZACP/ftto3HdcSaqpuF1wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:17:02.109055Z"},"content_sha256":"fff5dc4561c8e2cf47f07ef1d68963a013c1f7ab65331abc3406716095cc060f","schema_version":"1.0","event_id":"sha256:fff5dc4561c8e2cf47f07ef1d68963a013c1f7ab65331abc3406716095cc060f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/bundle.json","state_url":"https://pith.science/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/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-02T10:17:02Z","links":{"resolver":"https://pith.science/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ","bundle":"https://pith.science/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/bundle.json","state":"https://pith.science/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSUNQ3O2PMKIL6BGL37PZIOEKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MSUNQ3O2PMKIL6BGL37PZIOEKZ","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":"6b655ff68422dc8b9c2756a83fa341964ed5263472da586dac465af10ffcc12f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T13:16:40Z","title_canon_sha256":"53edd9f5d5232ec59cb5870a8dfbe7be954291bc02f61686ece44cc81b68cc61"},"schema_version":"1.0","source":{"id":"1401.7505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7505","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7505v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7505","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"MSUNQ3O2PMKI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSUNQ3O2PMKIL6BG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSUNQ3O2","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:fff5dc4561c8e2cf47f07ef1d68963a013c1f7ab65331abc3406716095cc060f","target":"graph","created_at":"2026-05-18T03:00:48Z","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":"Designing Screening Experiments (DSE) is a class of information - theoretical models for multiple - access channels (MAC). We discuss the combinatorial model of DSE called a disjunct channel model. This model is the most important for applications and closely connected with the superimposed code concept. We give a detailed survey of lower and upper bounds on the rate of superimposed codes. The best known constructions of superimposed codes are considered in paper. We also discuss the development of these codes (non-adaptive pooling designs) intended for the clone - library screening problem. W","authors_text":"Arkadii G. D'yachkov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T13:16:40Z","title":"Lectures on Designing Screening Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7505","kind":"arxiv","version":1},"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:a5c66352a971eb081879d635fce08b9a5b2bb4d24da7a0a7c5c171c5d3c9ff1d","target":"record","created_at":"2026-05-18T03:00:48Z","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":"6b655ff68422dc8b9c2756a83fa341964ed5263472da586dac465af10ffcc12f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T13:16:40Z","title_canon_sha256":"53edd9f5d5232ec59cb5870a8dfbe7be954291bc02f61686ece44cc81b68cc61"},"schema_version":"1.0","source":{"id":"1401.7505","kind":"arxiv","version":1}},"canonical_sha256":"64a8d86dda7b1485f8265efefca1c45663f452f1d1d4acc661102dd77d4b35c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64a8d86dda7b1485f8265efefca1c45663f452f1d1d4acc661102dd77d4b35c5","first_computed_at":"2026-05-18T03:00:48.133311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:48.133311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZBxo5L+vBFoBGPZ3ef0nNNtz5MdNjyKbexhS1xILlEfPK1CsyETh3D+7ZLe3W8e4ZzaC7Td1q4752mlFigtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:48.134060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5c66352a971eb081879d635fce08b9a5b2bb4d24da7a0a7c5c171c5d3c9ff1d","sha256:fff5dc4561c8e2cf47f07ef1d68963a013c1f7ab65331abc3406716095cc060f"],"state_sha256":"a089d9e0c9d2a4ac81dd2197946564af33ec34f2efa9da0f60b333254c43f5e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a173zSFzxs6oQFwVQTtVnoyN65oLaFkAWJSg4EQ4UObF5xSo+U6Wr9NFJwXtCIN/+YfiPb1rSUSsJ2CVdNy/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:17:02.111500Z","bundle_sha256":"0ecae9fafa54efc4e5344bcf5d0fdad792ca52e51022243347eeb59494762358"}}