{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTSDKUU6HZDFJNE5LSTDK6RD42","short_pith_number":"pith:BTSDKUU6","canonical_record":{"source":{"id":"1206.6720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-28T15:06:54Z","cross_cats_sorted":[],"title_canon_sha256":"0a054896c0aa16f26c2e247a19d5a6f8505ba5c6a8b8d898001fdb736645b90b","abstract_canon_sha256":"bba7c7477690dd2d1b241bbaca05e022567cf7203e423605e5f9d3f9486f3e9e"},"schema_version":"1.0"},"canonical_sha256":"0ce435529e3e4654b49d5ca6357a23e683414ed7175cba2edfdb1a222fd2270d","source":{"kind":"arxiv","id":"1206.6720","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6720","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6720v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6720","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"BTSDKUU6HZDF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTSDKUU6HZDFJNE5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTSDKUU6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTSDKUU6HZDFJNE5LSTDK6RD42","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-28T15:06:54Z","cross_cats_sorted":[],"title_canon_sha256":"0a054896c0aa16f26c2e247a19d5a6f8505ba5c6a8b8d898001fdb736645b90b","abstract_canon_sha256":"bba7c7477690dd2d1b241bbaca05e022567cf7203e423605e5f9d3f9486f3e9e"},"schema_version":"1.0"},"canonical_sha256":"0ce435529e3e4654b49d5ca6357a23e683414ed7175cba2edfdb1a222fd2270d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.447203Z","signature_b64":"bCBwiu9iHi38Q6m/7rSB421yXiRtYLlM/1v8PcbS5gLg0TOoS/MWFHLMnxlG1IY6ey09xKusqPpCyIC9eaWhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce435529e3e4654b49d5ca6357a23e683414ed7175cba2edfdb1a222fd2270d","last_reissued_at":"2026-05-18T03:35:38.446410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.446410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6720","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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6n+rn1zZb/WUfVEoZbtmCuoKRzF9ReAQ5PHs3s+B9eWlgRDVdsHCgUZNbYamjDh0sljd2xkKIvki5xCa4DMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:37.068336Z"},"content_sha256":"855f072ff64a405e09204808fe267f11ecc4e11a78f4d7266491a1b649969025","schema_version":"1.0","event_id":"sha256:855f072ff64a405e09204808fe267f11ecc4e11a78f4d7266491a1b649969025"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTSDKUU6HZDFJNE5LSTDK6RD42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven","submitted_at":"2012-06-28T15:06:54Z","abstract_excerpt":"We give a generic divide-and-conquer approach for constructing collusion-resistant probabilistic dynamic traitor tracing schemes with larger alphabets from schemes with smaller alphabets. This construction offers a linear tradeoff between the alphabet size and the codelength. In particular, we show that applying our results to the binary dynamic Tardos scheme of Laarhoven et al. leads to schemes that are shorter by a factor equal to half the alphabet size. Asymptotically, these codelengths correspond, up to a constant factor, to the fingerprinting capacity for static probabilistic schemes. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6720","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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzNzRPa7awHzhEu0CjmA3IU81epxGRjb34k/A2ARq1HiRWdmOc6DOQBgtdXG19OFpi7BpBMbLFC1poAPCx8ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:37.068724Z"},"content_sha256":"c183dc8bc8ba2b68cc2e195a263faa09ef0826997d58ad2666e3602030c0f8f0","schema_version":"1.0","event_id":"sha256:c183dc8bc8ba2b68cc2e195a263faa09ef0826997d58ad2666e3602030c0f8f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/bundle.json","state_url":"https://pith.science/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/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-26T04:06:37Z","links":{"resolver":"https://pith.science/pith/BTSDKUU6HZDFJNE5LSTDK6RD42","bundle":"https://pith.science/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/bundle.json","state":"https://pith.science/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTSDKUU6HZDFJNE5LSTDK6RD42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTSDKUU6HZDFJNE5LSTDK6RD42","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":"bba7c7477690dd2d1b241bbaca05e022567cf7203e423605e5f9d3f9486f3e9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-28T15:06:54Z","title_canon_sha256":"0a054896c0aa16f26c2e247a19d5a6f8505ba5c6a8b8d898001fdb736645b90b"},"schema_version":"1.0","source":{"id":"1206.6720","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6720","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6720v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6720","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"BTSDKUU6HZDF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTSDKUU6HZDFJNE5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTSDKUU6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c183dc8bc8ba2b68cc2e195a263faa09ef0826997d58ad2666e3602030c0f8f0","target":"graph","created_at":"2026-05-18T03:35:38Z","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 give a generic divide-and-conquer approach for constructing collusion-resistant probabilistic dynamic traitor tracing schemes with larger alphabets from schemes with smaller alphabets. This construction offers a linear tradeoff between the alphabet size and the codelength. In particular, we show that applying our results to the binary dynamic Tardos scheme of Laarhoven et al. leads to schemes that are shorter by a factor equal to half the alphabet size. Asymptotically, these codelengths correspond, up to a constant factor, to the fingerprinting capacity for static probabilistic schemes. Thi","authors_text":"Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-28T15:06:54Z","title":"Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6720","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:855f072ff64a405e09204808fe267f11ecc4e11a78f4d7266491a1b649969025","target":"record","created_at":"2026-05-18T03:35:38Z","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":"bba7c7477690dd2d1b241bbaca05e022567cf7203e423605e5f9d3f9486f3e9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-28T15:06:54Z","title_canon_sha256":"0a054896c0aa16f26c2e247a19d5a6f8505ba5c6a8b8d898001fdb736645b90b"},"schema_version":"1.0","source":{"id":"1206.6720","kind":"arxiv","version":2}},"canonical_sha256":"0ce435529e3e4654b49d5ca6357a23e683414ed7175cba2edfdb1a222fd2270d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ce435529e3e4654b49d5ca6357a23e683414ed7175cba2edfdb1a222fd2270d","first_computed_at":"2026-05-18T03:35:38.446410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.446410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCBwiu9iHi38Q6m/7rSB421yXiRtYLlM/1v8PcbS5gLg0TOoS/MWFHLMnxlG1IY6ey09xKusqPpCyIC9eaWhAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.447203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6720","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855f072ff64a405e09204808fe267f11ecc4e11a78f4d7266491a1b649969025","sha256:c183dc8bc8ba2b68cc2e195a263faa09ef0826997d58ad2666e3602030c0f8f0"],"state_sha256":"5d5eaba4921c59868b1a398811ffaec0383df5b603eba97a9af86ef63caf1c52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUcseR/vrIe/fglIbQ+4QwlFPg1t3wKtz0s2NPG7U2Ap8+ZEaMD6upwFljPJySBaGnCkbacy7iZ/vlDUDCcXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:06:37.071730Z","bundle_sha256":"3b5847747c0d82f06d8987a17f27a4e4ebe5ff32cd837fb7fb5ea645a3c12931"}}