{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QIF37T7Y7AE25ODOYICD3YTQXO","short_pith_number":"pith:QIF37T7Y","canonical_record":{"source":{"id":"2607.14448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"3751b02dd9e70bccd559332bf87a0d467263aee6e9a90eb8e0da98a4267779d5","abstract_canon_sha256":"c1c9d223fc418c02279de6b22d9017e30cf88b9b954df4eb2ab12f1ae79ac818"},"schema_version":"1.0"},"canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","source":{"kind":"arxiv","id":"2607.14448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14448","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14448v1","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14448","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIF37T7Y7AE2","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"QIF37T7Y7AE25ODO","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"QIF37T7Y","created_at":"2026-07-17T00:21:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QIF37T7Y7AE25ODOYICD3YTQXO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.14448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"3751b02dd9e70bccd559332bf87a0d467263aee6e9a90eb8e0da98a4267779d5","abstract_canon_sha256":"c1c9d223fc418c02279de6b22d9017e30cf88b9b954df4eb2ab12f1ae79ac818"},"schema_version":"1.0"},"canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T00:21:12.925700Z","signature_b64":"CUT6yiFqaaIzhkO2SfDgz9Ep6EB5X9Hx1pn7JFH0LY1mxd1ZHj2e7UbFMVnYMs4uLJtIBsUIfC5UDZrqJpthCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","last_reissued_at":"2026-07-17T00:21:12.924825Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T00:21:12.924825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.14448","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-07-17T00:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHHTGJSDGAWPHqfwE4vEkkOolYytFo5JxA3AmGPqWm4uqlfhfFE5TkyBDMXZk17vm3o9XjFuqeeGdWf35HQ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:05:11.298723Z"},"content_sha256":"af67470e5cac4cfe3e5dcc417c8ebdef31a08da7c15c1680fdb5d7681a7c8dbb","schema_version":"1.0","event_id":"sha256:af67470e5cac4cfe3e5dcc417c8ebdef31a08da7c15c1680fdb5d7681a7c8dbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QIF37T7Y7AE25ODOYICD3YTQXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Testing with Selectable Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Daniel McMorrow, Jonathan Scarlett, Trung-Khang Tran","submitted_at":"2026-07-16T00:46:31Z","abstract_excerpt":"We consider the problem of group testing, in which one seeks to identify a subset of defective items of size $k$ from a larger set of $n$ items based on pooled tests. We introduce a selectable threshold model, in which each test has an associated threshold that can be chosen, such that the test outcome is 1 if and only if the number of defectives in the test is no smaller than that threshold. In settings with a large or unbounded maximum threshold, we establish conditions under which high-probability recovery can be attained with a rate (i.e., the asymptotic ratio of $\\log_2{n \\choose k}$ to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14448","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.14448/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-17T00:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hEsOS+MAtYuo4fK1h6P/6CgCFmn4deAadBRMLTHvfzpvFp9bMjG9AYSLwSzPD8K2E2uczj/3mNmoAyiUeUOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:05:11.299316Z"},"content_sha256":"2126b3fba3e9bbe909b0fcbb213a75639f40c3cd81dff6e3a9adf80b54e79009","schema_version":"1.0","event_id":"sha256:2126b3fba3e9bbe909b0fcbb213a75639f40c3cd81dff6e3a9adf80b54e79009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/bundle.json","state_url":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIF37T7Y7AE25ODOYICD3YTQXO/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-08-06T08:05:11Z","links":{"resolver":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO","bundle":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/bundle.json","state":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIF37T7Y7AE25ODOYICD3YTQXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QIF37T7Y7AE25ODOYICD3YTQXO","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":"c1c9d223fc418c02279de6b22d9017e30cf88b9b954df4eb2ab12f1ae79ac818","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","title_canon_sha256":"3751b02dd9e70bccd559332bf87a0d467263aee6e9a90eb8e0da98a4267779d5"},"schema_version":"1.0","source":{"id":"2607.14448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14448","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14448v1","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14448","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIF37T7Y7AE2","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"QIF37T7Y7AE25ODO","created_at":"2026-07-17T00:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"QIF37T7Y","created_at":"2026-07-17T00:21:12Z"}],"graph_snapshots":[{"event_id":"sha256:2126b3fba3e9bbe909b0fcbb213a75639f40c3cd81dff6e3a9adf80b54e79009","target":"graph","created_at":"2026-07-17T00:21:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.14448/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of group testing, in which one seeks to identify a subset of defective items of size $k$ from a larger set of $n$ items based on pooled tests. We introduce a selectable threshold model, in which each test has an associated threshold that can be chosen, such that the test outcome is 1 if and only if the number of defectives in the test is no smaller than that threshold. In settings with a large or unbounded maximum threshold, we establish conditions under which high-probability recovery can be attained with a rate (i.e., the asymptotic ratio of $\\log_2{n \\choose k}$ to t","authors_text":"Daniel McMorrow, Jonathan Scarlett, Trung-Khang Tran","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","title":"Group Testing with Selectable Thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14448","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:af67470e5cac4cfe3e5dcc417c8ebdef31a08da7c15c1680fdb5d7681a7c8dbb","target":"record","created_at":"2026-07-17T00:21:12Z","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":"c1c9d223fc418c02279de6b22d9017e30cf88b9b954df4eb2ab12f1ae79ac818","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","title_canon_sha256":"3751b02dd9e70bccd559332bf87a0d467263aee6e9a90eb8e0da98a4267779d5"},"schema_version":"1.0","source":{"id":"2607.14448","kind":"arxiv","version":1}},"canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","first_computed_at":"2026-07-17T00:21:12.924825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T00:21:12.924825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CUT6yiFqaaIzhkO2SfDgz9Ep6EB5X9Hx1pn7JFH0LY1mxd1ZHj2e7UbFMVnYMs4uLJtIBsUIfC5UDZrqJpthCQ==","signature_status":"signed_v1","signed_at":"2026-07-17T00:21:12.925700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af67470e5cac4cfe3e5dcc417c8ebdef31a08da7c15c1680fdb5d7681a7c8dbb","sha256:2126b3fba3e9bbe909b0fcbb213a75639f40c3cd81dff6e3a9adf80b54e79009"],"state_sha256":"6048f8a94490e13caaf5dbd545d5a9dec5008c7a648734916766faae44355f0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+T9c+UmtPEEjwcYIwdSxADsB71ixiUkITQEunSwtjn66zgxbnM8+qNNnZ2iCg+aWW4eHZ1DsyzGT+6w+dyrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:05:11.304001Z","bundle_sha256":"29130c23eecb6a4c1aeeda84d1acb35e91df1aefeda39cadb93bb335e7d9086b"}}