{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DBTG2TGSZYIQMCNAJNU6SJ67EC","short_pith_number":"pith:DBTG2TGS","schema_version":"1.0","canonical_sha256":"18666d4cd2ce110609a04b69e927df20ab00b6bec2769cfa045c9ca4eeff0540","source":{"kind":"arxiv","id":"1601.04810","version":2},"attestation_state":"computed","paper":{"title":"Good traceability codes do exist","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2016-01-19T07:09:31Z","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"},"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":"1601.04810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T07:09:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ef52239c45cd00e458deb2cd862abee7519f57322a5a6ca4de511725f0b9296","abstract_canon_sha256":"c13746c1f83c8ca2a9e47ac06d74ca2f3895eb7735712cb1bcb03dc3d892d230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.963584Z","signature_b64":"rOOPfNpxfZnQGaisICbrzWLXM84C+am8PwXl66j3noF8Mmmxs8IoUc5dFI+loi2n/gDe8IihEet0Sk04LmTsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18666d4cd2ce110609a04b69e927df20ab00b6bec2769cfa045c9ca4eeff0540","last_reissued_at":"2026-05-18T01:19:56.962905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.962905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good traceability codes do exist","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2016-01-19T07:09:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04810","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04810","created_at":"2026-05-18T01:19:56.963005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04810v2","created_at":"2026-05-18T01:19:56.963005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04810","created_at":"2026-05-18T01:19:56.963005+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBTG2TGSZYIQ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBTG2TGSZYIQMCNA","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBTG2TGS","created_at":"2026-05-18T12:30:09.641336+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/DBTG2TGSZYIQMCNAJNU6SJ67EC","json":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC.json","graph_json":"https://pith.science/api/pith-number/DBTG2TGSZYIQMCNAJNU6SJ67EC/graph.json","events_json":"https://pith.science/api/pith-number/DBTG2TGSZYIQMCNAJNU6SJ67EC/events.json","paper":"https://pith.science/paper/DBTG2TGS"},"agent_actions":{"view_html":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC","download_json":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC.json","view_paper":"https://pith.science/paper/DBTG2TGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04810&json=true","fetch_graph":"https://pith.science/api/pith-number/DBTG2TGSZYIQMCNAJNU6SJ67EC/graph.json","fetch_events":"https://pith.science/api/pith-number/DBTG2TGSZYIQMCNAJNU6SJ67EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC/action/storage_attestation","attest_author":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC/action/author_attestation","sign_citation":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC/action/citation_signature","submit_replication":"https://pith.science/pith/DBTG2TGSZYIQMCNAJNU6SJ67EC/action/replication_record"}},"created_at":"2026-05-18T01:19:56.963005+00:00","updated_at":"2026-05-18T01:19:56.963005+00:00"}