{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:O3M4YGJ5LCE5NBITBDYFZMMA7H","short_pith_number":"pith:O3M4YGJ5","canonical_record":{"source":{"id":"2312.14588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-22T10:24:51Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"84b52d7258a6bda0140c108e453cd2a5c62c98231d3eb684fca47acc9d3cd043","abstract_canon_sha256":"ac6a0d8f67dd7b3b6692bdbade4022a3ad2f9be18640fcd022a285c5a2993c84"},"schema_version":"1.0"},"canonical_sha256":"76d9cc193d5889d6851308f05cb180f9c0017a4dfd59e610b30b54d7662846ea","source":{"kind":"arxiv","id":"2312.14588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14588","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14588v1","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14588","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"O3M4YGJ5LCE5","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"O3M4YGJ5LCE5NBIT","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"O3M4YGJ5","created_at":"2026-07-05T07:27:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:O3M4YGJ5LCE5NBITBDYFZMMA7H","target":"record","payload":{"canonical_record":{"source":{"id":"2312.14588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-22T10:24:51Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"84b52d7258a6bda0140c108e453cd2a5c62c98231d3eb684fca47acc9d3cd043","abstract_canon_sha256":"ac6a0d8f67dd7b3b6692bdbade4022a3ad2f9be18640fcd022a285c5a2993c84"},"schema_version":"1.0"},"canonical_sha256":"76d9cc193d5889d6851308f05cb180f9c0017a4dfd59e610b30b54d7662846ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:17.405253Z","signature_b64":"UUHGY8tIK1CZ0mdDSoqYGyWbtw2eTd0M96DRhoUgvs7Fb6wjnzUC26Dpj1AZ4OdyCqXgw8AB3/S84uMy50uAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d9cc193d5889d6851308f05cb180f9c0017a4dfd59e610b30b54d7662846ea","last_reissued_at":"2026-07-05T07:27:17.404836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:17.404836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.14588","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-05T07:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cluo+dT53BHmsmZvr5/qw8xZtSeez3zXSdyKY2bOY2UtUQOULdyuPCwEjdhAXJ63OF3x9wooksiLUvf+JL/qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:47:58.064618Z"},"content_sha256":"80454f367e560fad8bc1a03b027f8aa561f5d568c13610bb3647f7763aec5d1a","schema_version":"1.0","event_id":"sha256:80454f367e560fad8bc1a03b027f8aa561f5d568c13610bb3647f7763aec5d1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:O3M4YGJ5LCE5NBITBDYFZMMA7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Near-Optimal \\& Efficient Algorithm for the Sparse Pooled Data Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT","stat.ML"],"primary_cat":"math.PR","authors_text":"Connor Riddlesden, Max Hahn-Klimroth, Noela M\\\"uller, Remco van der Hofstad","submitted_at":"2023-12-22T10:24:51Z","abstract_excerpt":"The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given $n$ items, assume that each item has a label in $\\cbc{0,1,\\ldots, d}$, encoded via the ground-truth $\\SIGMA$. We call the pooled data problem sparse if the number of non-zero entries of $\\SIGMA$ scales as $k \\sim n^{\\theta}$ for $\\theta \\in (0,1)$. The information that is revealed about $\\SIGMA$ comes from pooled measurements, each indicating how many items of each label are contained in the pool. The most basic question is to design a pooling scheme that uses as few"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14588","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/2312.14588/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-05T07:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2vJXF6Ifb2gZvXWARH4k3WMh2509pYuVPzS/JSy4CQnDzZEII4Y4PRqidF3gBrneMrlAlBsH/U6Lbhd0RzLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:47:58.065424Z"},"content_sha256":"b2d85fde4411fa5bf3959bf0f6e11ee49a03d1a1f055810e9f45b6b68ffc6806","schema_version":"1.0","event_id":"sha256:b2d85fde4411fa5bf3959bf0f6e11ee49a03d1a1f055810e9f45b6b68ffc6806"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/bundle.json","state_url":"https://pith.science/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/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-07T03:47:58Z","links":{"resolver":"https://pith.science/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H","bundle":"https://pith.science/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/bundle.json","state":"https://pith.science/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3M4YGJ5LCE5NBITBDYFZMMA7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O3M4YGJ5LCE5NBITBDYFZMMA7H","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":"ac6a0d8f67dd7b3b6692bdbade4022a3ad2f9be18640fcd022a285c5a2993c84","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-22T10:24:51Z","title_canon_sha256":"84b52d7258a6bda0140c108e453cd2a5c62c98231d3eb684fca47acc9d3cd043"},"schema_version":"1.0","source":{"id":"2312.14588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14588","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14588v1","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14588","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"O3M4YGJ5LCE5","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"O3M4YGJ5LCE5NBIT","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"O3M4YGJ5","created_at":"2026-07-05T07:27:17Z"}],"graph_snapshots":[{"event_id":"sha256:b2d85fde4411fa5bf3959bf0f6e11ee49a03d1a1f055810e9f45b6b68ffc6806","target":"graph","created_at":"2026-07-05T07:27:17Z","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/2312.14588/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given $n$ items, assume that each item has a label in $\\cbc{0,1,\\ldots, d}$, encoded via the ground-truth $\\SIGMA$. We call the pooled data problem sparse if the number of non-zero entries of $\\SIGMA$ scales as $k \\sim n^{\\theta}$ for $\\theta \\in (0,1)$. The information that is revealed about $\\SIGMA$ comes from pooled measurements, each indicating how many items of each label are contained in the pool. The most basic question is to design a pooling scheme that uses as few","authors_text":"Connor Riddlesden, Max Hahn-Klimroth, Noela M\\\"uller, Remco van der Hofstad","cross_cats":["cs.DM","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-22T10:24:51Z","title":"On a Near-Optimal \\& Efficient Algorithm for the Sparse Pooled Data Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14588","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:80454f367e560fad8bc1a03b027f8aa561f5d568c13610bb3647f7763aec5d1a","target":"record","created_at":"2026-07-05T07:27:17Z","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":"ac6a0d8f67dd7b3b6692bdbade4022a3ad2f9be18640fcd022a285c5a2993c84","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-22T10:24:51Z","title_canon_sha256":"84b52d7258a6bda0140c108e453cd2a5c62c98231d3eb684fca47acc9d3cd043"},"schema_version":"1.0","source":{"id":"2312.14588","kind":"arxiv","version":1}},"canonical_sha256":"76d9cc193d5889d6851308f05cb180f9c0017a4dfd59e610b30b54d7662846ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76d9cc193d5889d6851308f05cb180f9c0017a4dfd59e610b30b54d7662846ea","first_computed_at":"2026-07-05T07:27:17.404836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:17.404836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUHGY8tIK1CZ0mdDSoqYGyWbtw2eTd0M96DRhoUgvs7Fb6wjnzUC26Dpj1AZ4OdyCqXgw8AB3/S84uMy50uAAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:17.405253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80454f367e560fad8bc1a03b027f8aa561f5d568c13610bb3647f7763aec5d1a","sha256:b2d85fde4411fa5bf3959bf0f6e11ee49a03d1a1f055810e9f45b6b68ffc6806"],"state_sha256":"7703e05f472109a0c0bf2fc7117a1fd12dd4261af02d1bc3a2a165cdc1b76982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahxWXmdKoXbmeG8KNEGsG7UWp8F0g40vhCaIOqVwTSyBrvaFrRnzyCsDUs3nsw1McDu4T/DDYyilqK8cErGRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:47:58.073443Z","bundle_sha256":"6cd1daf47d9235315f572f0c0be0802749db5f9a19731e0cd1c21bf01886f600"}}