{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KXLNIIQZUDMXUBIQ5Z73SOUB44","short_pith_number":"pith:KXLNIIQZ","canonical_record":{"source":{"id":"1108.2996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T13:55:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"960827ca1e35303ecd2936e1ea91dcfbdc07f830d62ed2b9da830d5a0a381dc9","abstract_canon_sha256":"f923c69f48e8839ab2ad75dcdc6a73e085485cb2dc7cb00f10c6880951d9e3ac"},"schema_version":"1.0"},"canonical_sha256":"55d6d42219a0d97a0510ee7fb93a81e735242d174385a59fca8e867e05664f29","source":{"kind":"arxiv","id":"1108.2996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2996","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2996v1","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2996","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"KXLNIIQZUDMX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KXLNIIQZUDMXUBIQ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KXLNIIQZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KXLNIIQZUDMXUBIQ5Z73SOUB44","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T13:55:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"960827ca1e35303ecd2936e1ea91dcfbdc07f830d62ed2b9da830d5a0a381dc9","abstract_canon_sha256":"f923c69f48e8839ab2ad75dcdc6a73e085485cb2dc7cb00f10c6880951d9e3ac"},"schema_version":"1.0"},"canonical_sha256":"55d6d42219a0d97a0510ee7fb93a81e735242d174385a59fca8e867e05664f29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:28.868473Z","signature_b64":"6oSAcMTK8on+PfRoXX9cabJrp9CY52djLfbbaI9WW+JMTyAV7UXBhyD4l/+m0oHeXfDroLHBhGujLhfir/+zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55d6d42219a0d97a0510ee7fb93a81e735242d174385a59fca8e867e05664f29","last_reissued_at":"2026-05-18T04:15:28.867909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:28.867909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2996","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-18T04:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTG2hQjFCPoROWlWWx3Lj/kkc3z/1TiiVQ7uPooqQixLMoCk1cLKR+dX9NxLOa0/C6d0hOlxbTjA5DauXyoLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:36.966745Z"},"content_sha256":"f849452db0a0476e6b29b99c378329c2d735e9a0914b659a7639e0f53f389532","schema_version":"1.0","event_id":"sha256:f849452db0a0476e6b29b99c378329c2d735e9a0914b659a7639e0f53f389532"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KXLNIIQZUDMXUBIQ5Z73SOUB44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric Group Testing and Superimposed Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Emad, Jun Shen, Olgica Milenkovic","submitted_at":"2011-08-15T13:55:12Z","abstract_excerpt":"We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are \"symmetric\" while the outputs are drawn from a ternary alphabet. Using an information-theoretic approach, we derive sufficient and necessary conditions for the number of tests required for noise-free and noisy reconstructions. Furthermore, we extend the notion of disjunct (zero-false-drop) and separable (uniquely decipherable) codes to the case of symmetric group testing. For the new family of codes, we derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2996","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-18T04:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWwqcBJi5kLrQzXy05h57xiQERxEy+WKLbiO9YiRvjNpYOojgZ0/bU1dgcANhhpBhQ4mC9EJ1BpjIUpWwRBFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:36.967614Z"},"content_sha256":"6b47d460074300fb6cba51e851ca48bb0a5c30085142f284d016ff4fad5002ef","schema_version":"1.0","event_id":"sha256:6b47d460074300fb6cba51e851ca48bb0a5c30085142f284d016ff4fad5002ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/bundle.json","state_url":"https://pith.science/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/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-31T02:13:36Z","links":{"resolver":"https://pith.science/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44","bundle":"https://pith.science/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/bundle.json","state":"https://pith.science/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXLNIIQZUDMXUBIQ5Z73SOUB44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KXLNIIQZUDMXUBIQ5Z73SOUB44","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":"f923c69f48e8839ab2ad75dcdc6a73e085485cb2dc7cb00f10c6880951d9e3ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T13:55:12Z","title_canon_sha256":"960827ca1e35303ecd2936e1ea91dcfbdc07f830d62ed2b9da830d5a0a381dc9"},"schema_version":"1.0","source":{"id":"1108.2996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2996","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2996v1","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2996","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"KXLNIIQZUDMX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KXLNIIQZUDMXUBIQ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KXLNIIQZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6b47d460074300fb6cba51e851ca48bb0a5c30085142f284d016ff4fad5002ef","target":"graph","created_at":"2026-05-18T04:15:28Z","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 describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are \"symmetric\" while the outputs are drawn from a ternary alphabet. Using an information-theoretic approach, we derive sufficient and necessary conditions for the number of tests required for noise-free and noisy reconstructions. Furthermore, we extend the notion of disjunct (zero-false-drop) and separable (uniquely decipherable) codes to the case of symmetric group testing. For the new family of codes, we derive","authors_text":"Amin Emad, Jun Shen, Olgica Milenkovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T13:55:12Z","title":"Symmetric Group Testing and Superimposed Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2996","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:f849452db0a0476e6b29b99c378329c2d735e9a0914b659a7639e0f53f389532","target":"record","created_at":"2026-05-18T04:15:28Z","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":"f923c69f48e8839ab2ad75dcdc6a73e085485cb2dc7cb00f10c6880951d9e3ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T13:55:12Z","title_canon_sha256":"960827ca1e35303ecd2936e1ea91dcfbdc07f830d62ed2b9da830d5a0a381dc9"},"schema_version":"1.0","source":{"id":"1108.2996","kind":"arxiv","version":1}},"canonical_sha256":"55d6d42219a0d97a0510ee7fb93a81e735242d174385a59fca8e867e05664f29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55d6d42219a0d97a0510ee7fb93a81e735242d174385a59fca8e867e05664f29","first_computed_at":"2026-05-18T04:15:28.867909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:28.867909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6oSAcMTK8on+PfRoXX9cabJrp9CY52djLfbbaI9WW+JMTyAV7UXBhyD4l/+m0oHeXfDroLHBhGujLhfir/+zBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:28.868473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f849452db0a0476e6b29b99c378329c2d735e9a0914b659a7639e0f53f389532","sha256:6b47d460074300fb6cba51e851ca48bb0a5c30085142f284d016ff4fad5002ef"],"state_sha256":"b63124a5cbea200bb0a74d45cfa954e98dfe5fcf9795326b8a7d47910a1f641f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aEmhCJ69reIkMQRrcmf6UMBWh/XX5l9NkRiiZBvItv4rJhxh12u4fTWowwLCaPykRhFoAZ0DICFi2Z0LcBZtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:13:36.972548Z","bundle_sha256":"5792a7e56888d08531ee8bbc4265e510faab709a42dfe341b40a41c0b9b3007e"}}