{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I747LA7TRUDWCFX5W5YWDTNNBP","short_pith_number":"pith:I747LA7T","canonical_record":{"source":{"id":"1404.2825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:59Z","cross_cats_sorted":["cs.CR","math.IT","math.ST","stat.TH"],"title_canon_sha256":"0736d100243147aebf2ed40d461e4de454553c4d02d3c7007c21ccad5b34f859","abstract_canon_sha256":"7877da4f0874fa0c5ab5d1f89732c013919aadf8cf27d9c0e6f56d2ab609ef21"},"schema_version":"1.0"},"canonical_sha256":"47f9f583f38d076116fdb77161cdad0bc9aac893e7cac2b13adfaf064ad5531c","source":{"kind":"arxiv","id":"1404.2825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2825","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2825v1","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2825","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"I747LA7TRUDW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I747LA7TRUDWCFX5","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I747LA7T","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I747LA7TRUDWCFX5W5YWDTNNBP","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:59Z","cross_cats_sorted":["cs.CR","math.IT","math.ST","stat.TH"],"title_canon_sha256":"0736d100243147aebf2ed40d461e4de454553c4d02d3c7007c21ccad5b34f859","abstract_canon_sha256":"7877da4f0874fa0c5ab5d1f89732c013919aadf8cf27d9c0e6f56d2ab609ef21"},"schema_version":"1.0"},"canonical_sha256":"47f9f583f38d076116fdb77161cdad0bc9aac893e7cac2b13adfaf064ad5531c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.770689Z","signature_b64":"ZS549f/ZasA8CuzL8nmcILbo2D9sae7vvZgCpSNO6MirFHd94VatpG0AhBDAlzgStvHEsMQVWEuB54zzCwtlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47f9f583f38d076116fdb77161cdad0bc9aac893e7cac2b13adfaf064ad5531c","last_reissued_at":"2026-05-18T01:04:50.770263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.770263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2825","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-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3ZqKfJlb485BZG2xNH6j/aefo7GK8FYjnk0gUS+a4MPIkoNzkJSAWAJVzCmda//CEOGQd2u9ecXOiOfNJ/PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:07:29.958710Z"},"content_sha256":"9ee3ae97406c8400fc0a7d96421e815fa59ed9be092725223d803069dca09292","schema_version":"1.0","event_id":"sha256:9ee3ae97406c8400fc0a7d96421e815fa59ed9be092725223d803069dca09292"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I747LA7TRUDWCFX5W5YWDTNNBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Thijs Laarhoven","submitted_at":"2014-04-09T19:03:59Z","abstract_excerpt":"We study the large-coalition asymptotics of fingerprinting and group testing, and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal), and both for informed and uninformed settings.\n  For fingerprinting, we show that if the pirate strategy is known, the Neyman-Pearson-based log-likelihood decoders provably achieve capacity, regardless of the strategy. The decoder built against the interleaving attack is further shown to be a universal decoder, able to deal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2825","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-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjkfnYj2acqwP1QfeC+AjVHgZF3gNBYd6qQJpWX7KjCKJ/JkojnlKvXmNBRRdezQgI1iniRAUx1A6dIK3H7dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:07:29.959719Z"},"content_sha256":"3719616a0af614c682daf1b217a0c371942ab8cb8a2e17e5ddadff156a30203c","schema_version":"1.0","event_id":"sha256:3719616a0af614c682daf1b217a0c371942ab8cb8a2e17e5ddadff156a30203c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I747LA7TRUDWCFX5W5YWDTNNBP/bundle.json","state_url":"https://pith.science/pith/I747LA7TRUDWCFX5W5YWDTNNBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I747LA7TRUDWCFX5W5YWDTNNBP/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-25T16:07:29Z","links":{"resolver":"https://pith.science/pith/I747LA7TRUDWCFX5W5YWDTNNBP","bundle":"https://pith.science/pith/I747LA7TRUDWCFX5W5YWDTNNBP/bundle.json","state":"https://pith.science/pith/I747LA7TRUDWCFX5W5YWDTNNBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I747LA7TRUDWCFX5W5YWDTNNBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I747LA7TRUDWCFX5W5YWDTNNBP","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":"7877da4f0874fa0c5ab5d1f89732c013919aadf8cf27d9c0e6f56d2ab609ef21","cross_cats_sorted":["cs.CR","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:59Z","title_canon_sha256":"0736d100243147aebf2ed40d461e4de454553c4d02d3c7007c21ccad5b34f859"},"schema_version":"1.0","source":{"id":"1404.2825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2825","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2825v1","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2825","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"I747LA7TRUDW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I747LA7TRUDWCFX5","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I747LA7T","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:3719616a0af614c682daf1b217a0c371942ab8cb8a2e17e5ddadff156a30203c","target":"graph","created_at":"2026-05-18T01:04:50Z","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 study the large-coalition asymptotics of fingerprinting and group testing, and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal), and both for informed and uninformed settings.\n  For fingerprinting, we show that if the pirate strategy is known, the Neyman-Pearson-based log-likelihood decoders provably achieve capacity, regardless of the strategy. The decoder built against the interleaving attack is further shown to be a universal decoder, able to deal ","authors_text":"Thijs Laarhoven","cross_cats":["cs.CR","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:59Z","title":"Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2825","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:9ee3ae97406c8400fc0a7d96421e815fa59ed9be092725223d803069dca09292","target":"record","created_at":"2026-05-18T01:04:50Z","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":"7877da4f0874fa0c5ab5d1f89732c013919aadf8cf27d9c0e6f56d2ab609ef21","cross_cats_sorted":["cs.CR","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:59Z","title_canon_sha256":"0736d100243147aebf2ed40d461e4de454553c4d02d3c7007c21ccad5b34f859"},"schema_version":"1.0","source":{"id":"1404.2825","kind":"arxiv","version":1}},"canonical_sha256":"47f9f583f38d076116fdb77161cdad0bc9aac893e7cac2b13adfaf064ad5531c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47f9f583f38d076116fdb77161cdad0bc9aac893e7cac2b13adfaf064ad5531c","first_computed_at":"2026-05-18T01:04:50.770263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:50.770263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS549f/ZasA8CuzL8nmcILbo2D9sae7vvZgCpSNO6MirFHd94VatpG0AhBDAlzgStvHEsMQVWEuB54zzCwtlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:50.770689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ee3ae97406c8400fc0a7d96421e815fa59ed9be092725223d803069dca09292","sha256:3719616a0af614c682daf1b217a0c371942ab8cb8a2e17e5ddadff156a30203c"],"state_sha256":"5294c764644863d029e26fa4133127c9bb473c8215c608c9255e69f140657b61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSgMO8lvUPIu04Kl/Rou/Rj6s5LPqH9IUzIL6aBky0cd3Ioc5IIyM36LFhlXHHAcbhg1zMrAPbJG6wEkIHueBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:07:29.963421Z","bundle_sha256":"940fdf48f275f17f5d853196053dbba36b111142bb8a4f17cdc9eaac4a43b525"}}