{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KECHFSHNSYBJCNASH6TGHFO667","short_pith_number":"pith:KECHFSHN","schema_version":"1.0","canonical_sha256":"510472c8ed96029134123fa66395def7c0ff2d6d68b59016e22ed1b918f2e4a2","source":{"kind":"arxiv","id":"1102.0451","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically false-positive-maximizing attack on non-binary Tardos codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Antonino Simone, Boris Skoric","submitted_at":"2011-02-02T14:49:58Z","abstract_excerpt":"We use a method recently introduced by Simone and Skoric to study accusation probabilities for non-binary Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to include a broad class of collusion attack strategies. We analytically derive properties of a special attack that asymptotically maximizes false accusation probabilities. We present numerical results on sufficient code lengths for this attack, and explain the abrupt transitions that occur in these results."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1102.0451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-02T14:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"d92dfa6710e084e6975acaf2bbb47375f4ea47eaa01c77390aaf772923270baa","abstract_canon_sha256":"7fb65985c839050e6a0f913742d337f161715c9a5a54401fe421deb0b6ec3f5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:04.890643Z","signature_b64":"XZFREwJeWMQRa9Dg/42W6sV5nSDadRo9RWvcr7GouA1//R0YBFqoySby4asC/B3eiqdnOEcY7bcJ3x7VLXpbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510472c8ed96029134123fa66395def7c0ff2d6d68b59016e22ed1b918f2e4a2","last_reissued_at":"2026-05-18T04:30:04.890212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:04.890212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically false-positive-maximizing attack on non-binary Tardos codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Antonino Simone, Boris Skoric","submitted_at":"2011-02-02T14:49:58Z","abstract_excerpt":"We use a method recently introduced by Simone and Skoric to study accusation probabilities for non-binary Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to include a broad class of collusion attack strategies. We analytically derive properties of a special attack that asymptotically maximizes false accusation probabilities. We present numerical results on sufficient code lengths for this attack, and explain the abrupt transitions that occur in these results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0451","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.0451","created_at":"2026-05-18T04:30:04.890271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0451v1","created_at":"2026-05-18T04:30:04.890271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0451","created_at":"2026-05-18T04:30:04.890271+00:00"},{"alias_kind":"pith_short_12","alias_value":"KECHFSHNSYBJ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KECHFSHNSYBJCNAS","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KECHFSHN","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667","json":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667.json","graph_json":"https://pith.science/api/pith-number/KECHFSHNSYBJCNASH6TGHFO667/graph.json","events_json":"https://pith.science/api/pith-number/KECHFSHNSYBJCNASH6TGHFO667/events.json","paper":"https://pith.science/paper/KECHFSHN"},"agent_actions":{"view_html":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667","download_json":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667.json","view_paper":"https://pith.science/paper/KECHFSHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0451&json=true","fetch_graph":"https://pith.science/api/pith-number/KECHFSHNSYBJCNASH6TGHFO667/graph.json","fetch_events":"https://pith.science/api/pith-number/KECHFSHNSYBJCNASH6TGHFO667/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667/action/storage_attestation","attest_author":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667/action/author_attestation","sign_citation":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667/action/citation_signature","submit_replication":"https://pith.science/pith/KECHFSHNSYBJCNASH6TGHFO667/action/replication_record"}},"created_at":"2026-05-18T04:30:04.890271+00:00","updated_at":"2026-05-18T04:30:04.890271+00:00"}