{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5XPVXO34LETP5DOLTSA7XGEJXI","short_pith_number":"pith:5XPVXO34","schema_version":"1.0","canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","source":{"kind":"arxiv","id":"1507.00954","version":1},"attestation_state":"computed","paper":{"title":"Bounds and Constructions for $\\overline{3}$-Separable Codes with Length $3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyan Li, Jing Jiang, Minquan Cheng, Xiaohu Tang, Ying Miao","submitted_at":"2015-07-03T15:46:31Z","abstract_excerpt":"Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $\\mathcal{C}$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code ${\\sf desc}(\\mathcal{C}_0)$ of $\\mathcal{C}_0 = \\{{\\bf c}_1, {\\bf c}_2, \\ldots, {\\bf c}_t\\} \\subseteq {\\mathcal{C}}$ is defined to be the set of words ${\\bf x} = (x_1, x_2, \\ldots,x_n)^T$ such that $x_i \\in \\{c_{1,i}, c_{2,i}, \\ldots, c_{t,i}\\}$ for all $i=1, \\ldots, n$, where ${\\bf c}_j=(c_{j,1},c_{j,2},\\ldots,c_{j,n})^T$. $\\mathcal{C}$ is a $\\overline{t}$-separable code if for an"},"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":"1507.00954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-03T15:46:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc6112222e02141874c22735c6d04ae836e5da02fa5303d9de7cff5b62558a9a","abstract_canon_sha256":"a7029b5a2cbebdfff71263c687066abec1c3b6f04fe556a46fab4ae1fac53138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.180064Z","signature_b64":"PXnUDwCiUfyGyB6uYetmIhCeEJApoaVJuVzgq4hcNcRAhHeBLMax1+BzbeS+LzM6fhIdNxExQVk7GWZZ1rl4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","last_reissued_at":"2026-05-18T01:37:22.179492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.179492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and Constructions for $\\overline{3}$-Separable Codes with Length $3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyan Li, Jing Jiang, Minquan Cheng, Xiaohu Tang, Ying Miao","submitted_at":"2015-07-03T15:46:31Z","abstract_excerpt":"Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $\\mathcal{C}$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code ${\\sf desc}(\\mathcal{C}_0)$ of $\\mathcal{C}_0 = \\{{\\bf c}_1, {\\bf c}_2, \\ldots, {\\bf c}_t\\} \\subseteq {\\mathcal{C}}$ is defined to be the set of words ${\\bf x} = (x_1, x_2, \\ldots,x_n)^T$ such that $x_i \\in \\{c_{1,i}, c_{2,i}, \\ldots, c_{t,i}\\}$ for all $i=1, \\ldots, n$, where ${\\bf c}_j=(c_{j,1},c_{j,2},\\ldots,c_{j,n})^T$. $\\mathcal{C}$ is a $\\overline{t}$-separable code if for an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00954","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":"1507.00954","created_at":"2026-05-18T01:37:22.179574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00954v1","created_at":"2026-05-18T01:37:22.179574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00954","created_at":"2026-05-18T01:37:22.179574+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XPVXO34LETP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XPVXO34LETP5DOL","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XPVXO34","created_at":"2026-05-18T12:29:07.941421+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/5XPVXO34LETP5DOLTSA7XGEJXI","json":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI.json","graph_json":"https://pith.science/api/pith-number/5XPVXO34LETP5DOLTSA7XGEJXI/graph.json","events_json":"https://pith.science/api/pith-number/5XPVXO34LETP5DOLTSA7XGEJXI/events.json","paper":"https://pith.science/paper/5XPVXO34"},"agent_actions":{"view_html":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI","download_json":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI.json","view_paper":"https://pith.science/paper/5XPVXO34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00954&json=true","fetch_graph":"https://pith.science/api/pith-number/5XPVXO34LETP5DOLTSA7XGEJXI/graph.json","fetch_events":"https://pith.science/api/pith-number/5XPVXO34LETP5DOLTSA7XGEJXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/action/storage_attestation","attest_author":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/action/author_attestation","sign_citation":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/action/citation_signature","submit_replication":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/action/replication_record"}},"created_at":"2026-05-18T01:37:22.179574+00:00","updated_at":"2026-05-18T01:37:22.179574+00:00"}