{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DWXNIEGCUNU7B4RBTQGZEZSSM","short_pith_number":"pith:4DWXNIEG","canonical_record":{"source":{"id":"1404.2576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:53Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"68fdec835797a6a1b41c967b008662f63499b92e7d93e397c0bedde56740ebfd","abstract_canon_sha256":"88b7553a9ccede1bfe342ca2f147207d20be22e1ec861b56b16befc7f956baab"},"schema_version":"1.0"},"canonical_sha256":"e0ed76a086151b4f87910ce06c93329305d00a912c206610be16377067c9577b","source":{"kind":"arxiv","id":"1404.2576","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2576","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2576v1","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2576","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"4DWXNIEGCUNU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DWXNIEGCUNU7B4R","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DWXNIEG","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DWXNIEGCUNU7B4RBTQGZEZSSM","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:53Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"68fdec835797a6a1b41c967b008662f63499b92e7d93e397c0bedde56740ebfd","abstract_canon_sha256":"88b7553a9ccede1bfe342ca2f147207d20be22e1ec861b56b16befc7f956baab"},"schema_version":"1.0"},"canonical_sha256":"e0ed76a086151b4f87910ce06c93329305d00a912c206610be16377067c9577b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:30.291301Z","signature_b64":"KisfaEn2adfFaAeszXTWMAj6dnEzSzuiqAMHQzgkYjc8b0hQq5Q+wpAb4/W43uDAWRrtHUbwuL86V5DbGHODDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0ed76a086151b4f87910ce06c93329305d00a912c206610be16377067c9577b","last_reissued_at":"2026-05-18T01:31:30.290642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:30.290642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2576","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDZ+9UzvCf+/WPIufAoAZTZNyFMqe+D1v/xQF3aXUWa8WBnneb7A+J9JrEH0149oIfiNwSZcp6eJJyr6zPg2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:28:01.270186Z"},"content_sha256":"09f6f04c5fc590a133d49edefbf8b4d0382a25b28adb1f54355cfc60b592cdf5","schema_version":"1.0","event_id":"sha256:09f6f04c5fc590a133d49edefbf8b4d0382a25b28adb1f54355cfc60b592cdf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DWXNIEGCUNU7B4RBTQGZEZSSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotics of Fingerprinting and Group Testing: Tight Bounds from Channel Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Thijs Laarhoven","submitted_at":"2014-04-09T19:03:53Z","abstract_excerpt":"In this work we consider the large-coalition asymptotics of various fingerprinting and group testing games, and derive explicit expressions for the capacities for each of these models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal).\n  For fingerprinting, we show that if the pirate strategy is known, the capacity often decreases linearly with the number of colluders, instead of quadratically as in the uninformed fingerprinting game. For many attacks the joint capacity is further shown to be strictly higher than the simple capacity.\n  For grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2576","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UmsdcACTfG7fBMVheE0L+IRcjEXo+gbWXKgxEIDiJpkY1bRZ0nwxqwP1vRLihTgGZaxdEiRgTdiY+NiwvZyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:28:01.270867Z"},"content_sha256":"056cf913dfae5d7786a728b5484b133c7269776980ab26b15c8cdaf22d1d6ddd","schema_version":"1.0","event_id":"sha256:056cf913dfae5d7786a728b5484b133c7269776980ab26b15c8cdaf22d1d6ddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/bundle.json","state_url":"https://pith.science/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/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-26T09:28:01Z","links":{"resolver":"https://pith.science/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM","bundle":"https://pith.science/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/bundle.json","state":"https://pith.science/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DWXNIEGCUNU7B4RBTQGZEZSSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DWXNIEGCUNU7B4RBTQGZEZSSM","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":"88b7553a9ccede1bfe342ca2f147207d20be22e1ec861b56b16befc7f956baab","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:53Z","title_canon_sha256":"68fdec835797a6a1b41c967b008662f63499b92e7d93e397c0bedde56740ebfd"},"schema_version":"1.0","source":{"id":"1404.2576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2576","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2576v1","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2576","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"4DWXNIEGCUNU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DWXNIEGCUNU7B4R","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DWXNIEG","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:056cf913dfae5d7786a728b5484b133c7269776980ab26b15c8cdaf22d1d6ddd","target":"graph","created_at":"2026-05-18T01:31:30Z","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":"In this work we consider the large-coalition asymptotics of various fingerprinting and group testing games, and derive explicit expressions for the capacities for each of these models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal).\n  For fingerprinting, we show that if the pirate strategy is known, the capacity often decreases linearly with the number of colluders, instead of quadratically as in the uninformed fingerprinting game. For many attacks the joint capacity is further shown to be strictly higher than the simple capacity.\n  For grou","authors_text":"Thijs Laarhoven","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:53Z","title":"Asymptotics of Fingerprinting and Group Testing: Tight Bounds from Channel Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2576","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:09f6f04c5fc590a133d49edefbf8b4d0382a25b28adb1f54355cfc60b592cdf5","target":"record","created_at":"2026-05-18T01:31:30Z","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":"88b7553a9ccede1bfe342ca2f147207d20be22e1ec861b56b16befc7f956baab","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-09T19:03:53Z","title_canon_sha256":"68fdec835797a6a1b41c967b008662f63499b92e7d93e397c0bedde56740ebfd"},"schema_version":"1.0","source":{"id":"1404.2576","kind":"arxiv","version":1}},"canonical_sha256":"e0ed76a086151b4f87910ce06c93329305d00a912c206610be16377067c9577b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0ed76a086151b4f87910ce06c93329305d00a912c206610be16377067c9577b","first_computed_at":"2026-05-18T01:31:30.290642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:30.290642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KisfaEn2adfFaAeszXTWMAj6dnEzSzuiqAMHQzgkYjc8b0hQq5Q+wpAb4/W43uDAWRrtHUbwuL86V5DbGHODDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:30.291301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09f6f04c5fc590a133d49edefbf8b4d0382a25b28adb1f54355cfc60b592cdf5","sha256:056cf913dfae5d7786a728b5484b133c7269776980ab26b15c8cdaf22d1d6ddd"],"state_sha256":"137738d3b00b256e539e9caba642ef7897a1b9bf8fe5471f78e0a9e62442d65d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DT8HfuhFRtHUWilZnEobTv9MrNycSXxz+vxBpLDC4H7RL0/gbbGo2Hnj3H7JotvlfMvy5UptWbj8u1KaVbtkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:28:01.274208Z","bundle_sha256":"d55dd8cbfab5107ad9963c13737c0e55abcedc62e1a5b806a5e86eba0c92a78b"}}