{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OXJ5P22V26TUJFLRVVBGNACCBV","short_pith_number":"pith:OXJ5P22V","schema_version":"1.0","canonical_sha256":"75d3d7eb55d7a7449571ad426680420d7e94cc977ecef36e54f5cb2f6d4ac533","source":{"kind":"arxiv","id":"1505.02597","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic existence results for separable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Simon R. Blackburn","submitted_at":"2015-05-11T13:22:09Z","abstract_excerpt":"Separable codes were defined by Cheng and Miao in 2011, motivated by applications to the identification of pirates in a multimedia setting. Combinatorially, $\\overline{t}$-separable codes lie somewhere between $t$-frameproof and $(t-1)$-frameproof codes: all $t$-frameproof codes are $\\overline{t}$-separable, and all $\\overline{t}$-separable codes are $(t-1)$-frameproof. Results for frameproof codes show that (when $q$ is large) there are $q$-ary $\\overline{t}$-separable codes of length $n$ with approximately $q^{\\lceil n/t\\rceil}$ codewords, and that no $q$-ary $\\overline{t}$-separable codes o"},"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":"1505.02597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-11T13:22:09Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"2b237ada84dbbaaed2fd43f943d60f0d6a6477af170a20d68ad28082402812be","abstract_canon_sha256":"6fdd61e70c78b473b6bb5b4d3c41f5057591898f7ace8d7b4d566e044e1db8b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.798915Z","signature_b64":"parnIFbT50hyq6W2jmTgjqvDefqsLbzOhBC1nRspHoNVujEuoJqNnuIH6WqkWeIkMHMQCMZhuGyJSN6OL3eeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75d3d7eb55d7a7449571ad426680420d7e94cc977ecef36e54f5cb2f6d4ac533","last_reissued_at":"2026-05-18T00:58:10.798273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.798273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic existence results for separable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Simon R. Blackburn","submitted_at":"2015-05-11T13:22:09Z","abstract_excerpt":"Separable codes were defined by Cheng and Miao in 2011, motivated by applications to the identification of pirates in a multimedia setting. Combinatorially, $\\overline{t}$-separable codes lie somewhere between $t$-frameproof and $(t-1)$-frameproof codes: all $t$-frameproof codes are $\\overline{t}$-separable, and all $\\overline{t}$-separable codes are $(t-1)$-frameproof. Results for frameproof codes show that (when $q$ is large) there are $q$-ary $\\overline{t}$-separable codes of length $n$ with approximately $q^{\\lceil n/t\\rceil}$ codewords, and that no $q$-ary $\\overline{t}$-separable codes o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02597","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":"1505.02597","created_at":"2026-05-18T00:58:10.798369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02597v2","created_at":"2026-05-18T00:58:10.798369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02597","created_at":"2026-05-18T00:58:10.798369+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXJ5P22V26TU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXJ5P22V26TUJFLR","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXJ5P22V","created_at":"2026-05-18T12:29:34.919912+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/OXJ5P22V26TUJFLRVVBGNACCBV","json":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV.json","graph_json":"https://pith.science/api/pith-number/OXJ5P22V26TUJFLRVVBGNACCBV/graph.json","events_json":"https://pith.science/api/pith-number/OXJ5P22V26TUJFLRVVBGNACCBV/events.json","paper":"https://pith.science/paper/OXJ5P22V"},"agent_actions":{"view_html":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV","download_json":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV.json","view_paper":"https://pith.science/paper/OXJ5P22V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02597&json=true","fetch_graph":"https://pith.science/api/pith-number/OXJ5P22V26TUJFLRVVBGNACCBV/graph.json","fetch_events":"https://pith.science/api/pith-number/OXJ5P22V26TUJFLRVVBGNACCBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV/action/storage_attestation","attest_author":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV/action/author_attestation","sign_citation":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV/action/citation_signature","submit_replication":"https://pith.science/pith/OXJ5P22V26TUJFLRVVBGNACCBV/action/replication_record"}},"created_at":"2026-05-18T00:58:10.798369+00:00","updated_at":"2026-05-18T00:58:10.798369+00:00"}