{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IZWWAOY4YVJHORFRHDCQLF2DLL","short_pith_number":"pith:IZWWAOY4","canonical_record":{"source":{"id":"1410.4986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T18:20:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca2c410c17e61794cdd61388532e28bed22d73af6cf230d7aa0119a68c4968cf","abstract_canon_sha256":"0976779539b40c87aff3a4eeb9a23f025b262f7b68b0cbfbf6be9e1a9128945d"},"schema_version":"1.0"},"canonical_sha256":"466d603b1cc5527744b138c50597435ad576326d61162c54e062476c207376cd","source":{"kind":"arxiv","id":"1410.4986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4986","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4986v2","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4986","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"IZWWAOY4YVJH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZWWAOY4YVJHORFR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZWWAOY4","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IZWWAOY4YVJHORFRHDCQLF2DLL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T18:20:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca2c410c17e61794cdd61388532e28bed22d73af6cf230d7aa0119a68c4968cf","abstract_canon_sha256":"0976779539b40c87aff3a4eeb9a23f025b262f7b68b0cbfbf6be9e1a9128945d"},"schema_version":"1.0"},"canonical_sha256":"466d603b1cc5527744b138c50597435ad576326d61162c54e062476c207376cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:54.107161Z","signature_b64":"M06L0ve7orxEhypgASBFXm7JpSW5roiz64pLMbNFYfIeZt6xDo+Q/6Ig8IFRrXFFoP/oE7K3NkflxmrP1tiQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"466d603b1cc5527744b138c50597435ad576326d61162c54e062476c207376cd","last_reissued_at":"2026-05-18T01:38:54.106450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:54.106450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4986","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-18T01:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgX1AEn+HleuX4fd8x+fAxh+KYXWdQ1ICCvlJDCJ95Txnv16W5ilDffI/iLBHzND/CJDTU5GqYtWwBGedKU/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:19:43.654531Z"},"content_sha256":"bc91c8528193aff2f90604f75c164479d2989a2461e6240fca83ea8fefca9b27","schema_version":"1.0","event_id":"sha256:bc91c8528193aff2f90604f75c164479d2989a2461e6240fca83ea8fefca9b27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IZWWAOY4YVJHORFRHDCQLF2DLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Emad, Olgica Milenkovic","submitted_at":"2014-10-18T18:20:15Z","abstract_excerpt":"We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the most general semi-quantitative group testing model, we define three new families of sequences capturing the constraints on the code design imposed by the choice of the thresholds. The sequences represent extensions and generalizations of Bh and certain types of super-increasing and lexicographically ordered sequences, and they lead to code structures amenable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4986","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-18T01:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NF2qXvgLnWOxWWEZJ/xq3oYZ7BfaHUqLcGglNTXr9bsysZx55lrChbix8a70ULAVmN+LagSi+7ylIwiOV2HlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:19:43.655069Z"},"content_sha256":"e66953b881c3048e3271c04e819898d33853bbcd02c7774294be1a9a5d39f0dd","schema_version":"1.0","event_id":"sha256:e66953b881c3048e3271c04e819898d33853bbcd02c7774294be1a9a5d39f0dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/bundle.json","state_url":"https://pith.science/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/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-31T15:19:43Z","links":{"resolver":"https://pith.science/pith/IZWWAOY4YVJHORFRHDCQLF2DLL","bundle":"https://pith.science/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/bundle.json","state":"https://pith.science/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZWWAOY4YVJHORFRHDCQLF2DLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IZWWAOY4YVJHORFRHDCQLF2DLL","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":"0976779539b40c87aff3a4eeb9a23f025b262f7b68b0cbfbf6be9e1a9128945d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T18:20:15Z","title_canon_sha256":"ca2c410c17e61794cdd61388532e28bed22d73af6cf230d7aa0119a68c4968cf"},"schema_version":"1.0","source":{"id":"1410.4986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4986","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4986v2","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4986","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"IZWWAOY4YVJH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZWWAOY4YVJHORFR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZWWAOY4","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:e66953b881c3048e3271c04e819898d33853bbcd02c7774294be1a9a5d39f0dd","target":"graph","created_at":"2026-05-18T01:38:54Z","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 analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the most general semi-quantitative group testing model, we define three new families of sequences capturing the constraints on the code design imposed by the choice of the thresholds. The sequences represent extensions and generalizations of Bh and certain types of super-increasing and lexicographically ordered sequences, and they lead to code structures amenable ","authors_text":"Amin Emad, Olgica Milenkovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T18:20:15Z","title":"Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4986","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:bc91c8528193aff2f90604f75c164479d2989a2461e6240fca83ea8fefca9b27","target":"record","created_at":"2026-05-18T01:38:54Z","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":"0976779539b40c87aff3a4eeb9a23f025b262f7b68b0cbfbf6be9e1a9128945d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T18:20:15Z","title_canon_sha256":"ca2c410c17e61794cdd61388532e28bed22d73af6cf230d7aa0119a68c4968cf"},"schema_version":"1.0","source":{"id":"1410.4986","kind":"arxiv","version":2}},"canonical_sha256":"466d603b1cc5527744b138c50597435ad576326d61162c54e062476c207376cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"466d603b1cc5527744b138c50597435ad576326d61162c54e062476c207376cd","first_computed_at":"2026-05-18T01:38:54.106450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:38:54.106450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M06L0ve7orxEhypgASBFXm7JpSW5roiz64pLMbNFYfIeZt6xDo+Q/6Ig8IFRrXFFoP/oE7K3NkflxmrP1tiQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:38:54.107161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc91c8528193aff2f90604f75c164479d2989a2461e6240fca83ea8fefca9b27","sha256:e66953b881c3048e3271c04e819898d33853bbcd02c7774294be1a9a5d39f0dd"],"state_sha256":"16c5750f659a7c648d247e301d13589558400f33cb844372812a4e3043f9bb34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeiROpPx0laNJNUjw914CD+w1lWLnjYSa0krgP2V1IeeymlLB7hH56utl2dhnXzPrcWai93aBT3Qgi6PLwADDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:19:43.658629Z","bundle_sha256":"b2ae02393c9e09b4bf5561c4e5caf504ef8934aec5a016e2c722a1873ce47ded"}}