{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DBTG2TGSZYIQMCNAJNU6SJ67EC","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":"c13746c1f83c8ca2a9e47ac06d74ca2f3895eb7735712cb1bcb03dc3d892d230","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T07:09:31Z","title_canon_sha256":"8ef52239c45cd00e458deb2cd862abee7519f57322a5a6ca4de511725f0b9296"},"schema_version":"1.0","source":{"id":"1601.04810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04810","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04810v2","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04810","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"DBTG2TGSZYIQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DBTG2TGSZYIQMCNA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DBTG2TGS","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5d46e8afc13c046b873ef6610f0c4ef3d164c8af16538294dd0a2c5812574e96","target":"graph","created_at":"2026-05-18T01:19:56Z","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":"Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used to trace the origin of digital content in traitor tracing schemes.\n  Let $F$ be an alphabet set of size $q$ and $n$ be a positive integer. A $t$-traceability code is a code $\\mathscr{C}\\subseteq F^n$ which can be used to catch at least one colluder from a collusion of at most $t$ traitors. It has been shown that $t$-traceability codes do not exist for $q\\le t$. When $q>t^2$, $t$-traceability codes with positive code rate can be constructed from error correcting codes with large minimum distance. T","authors_text":"Chong Shangguan, Gennian Ge","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T07:09:31Z","title":"Good traceability codes do exist"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04810","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:fffa9c9831106b91cd957211fbb4058b148580fac389722ba582382937d58366","target":"record","created_at":"2026-05-18T01:19:56Z","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":"c13746c1f83c8ca2a9e47ac06d74ca2f3895eb7735712cb1bcb03dc3d892d230","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T07:09:31Z","title_canon_sha256":"8ef52239c45cd00e458deb2cd862abee7519f57322a5a6ca4de511725f0b9296"},"schema_version":"1.0","source":{"id":"1601.04810","kind":"arxiv","version":2}},"canonical_sha256":"18666d4cd2ce110609a04b69e927df20ab00b6bec2769cfa045c9ca4eeff0540","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18666d4cd2ce110609a04b69e927df20ab00b6bec2769cfa045c9ca4eeff0540","first_computed_at":"2026-05-18T01:19:56.962905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.962905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOOPfNpxfZnQGaisICbrzWLXM84C+am8PwXl66j3noF8Mmmxs8IoUc5dFI+loi2n/gDe8IihEet0Sk04LmTsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.963584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fffa9c9831106b91cd957211fbb4058b148580fac389722ba582382937d58366","sha256:5d46e8afc13c046b873ef6610f0c4ef3d164c8af16538294dd0a2c5812574e96"],"state_sha256":"87f4885cc480923e4166aacfdc1adee11b9614392ae313cea4ba59bc127fddbc"}