{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5XPVXO34LETP5DOLTSA7XGEJXI","short_pith_number":"pith:5XPVXO34","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"},"canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","source":{"kind":"arxiv","id":"1507.00954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00954","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00954v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00954","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"5XPVXO34LETP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5XPVXO34LETP5DOL","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5XPVXO34","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5XPVXO34LETP5DOLTSA7XGEJXI","target":"record","payload":{"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"},"canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","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"},"source_kind":"arxiv","source_id":"1507.00954","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bz7eVsjd1DSgedZSPyFyc1KXe3qvr2mLs5bxIf+OpNcU2EsoYcHC2sMpGgil/8zXI3o9+BiN3b/nYEX4dk+iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:57.934410Z"},"content_sha256":"d6baf4781fe1d1a88477999dff41b4a6593c7228afaff3da4b9b325b21725917","schema_version":"1.0","event_id":"sha256:d6baf4781fe1d1a88477999dff41b4a6593c7228afaff3da4b9b325b21725917"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5XPVXO34LETP5DOLTSA7XGEJXI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHrDDuvc/yHdazwT6w+/CGLGwvAjujqpWuO0il2rI4COUU/N0MDB18QZvvCo4Aatvn9B8lO+TiyBzhOdc86ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:57.934783Z"},"content_sha256":"a9abd74d2471b360a8e6f6bcf3f86a931fb04d5874b5e5f7c85f4e50b01e555c","schema_version":"1.0","event_id":"sha256:a9abd74d2471b360a8e6f6bcf3f86a931fb04d5874b5e5f7c85f4e50b01e555c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/bundle.json","state_url":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XPVXO34LETP5DOLTSA7XGEJXI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T05:52:57Z","links":{"resolver":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI","bundle":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/bundle.json","state":"https://pith.science/pith/5XPVXO34LETP5DOLTSA7XGEJXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XPVXO34LETP5DOLTSA7XGEJXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5XPVXO34LETP5DOLTSA7XGEJXI","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":"a7029b5a2cbebdfff71263c687066abec1c3b6f04fe556a46fab4ae1fac53138","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-03T15:46:31Z","title_canon_sha256":"bc6112222e02141874c22735c6d04ae836e5da02fa5303d9de7cff5b62558a9a"},"schema_version":"1.0","source":{"id":"1507.00954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00954","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00954v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00954","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"5XPVXO34LETP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5XPVXO34LETP5DOL","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5XPVXO34","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a9abd74d2471b360a8e6f6bcf3f86a931fb04d5874b5e5f7c85f4e50b01e555c","target":"graph","created_at":"2026-05-18T01:37:22Z","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":"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","authors_text":"Haiyan Li, Jing Jiang, Minquan Cheng, Xiaohu Tang, Ying Miao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-03T15:46:31Z","title":"Bounds and Constructions for $\\overline{3}$-Separable Codes with Length $3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00954","kind":"arxiv","version":1},"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:d6baf4781fe1d1a88477999dff41b4a6593c7228afaff3da4b9b325b21725917","target":"record","created_at":"2026-05-18T01:37:22Z","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":"a7029b5a2cbebdfff71263c687066abec1c3b6f04fe556a46fab4ae1fac53138","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-03T15:46:31Z","title_canon_sha256":"bc6112222e02141874c22735c6d04ae836e5da02fa5303d9de7cff5b62558a9a"},"schema_version":"1.0","source":{"id":"1507.00954","kind":"arxiv","version":1}},"canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eddf5bbb7c5926fe8dcb9c81fb9889ba15b891f3d0c607de3028e65e77461429","first_computed_at":"2026-05-18T01:37:22.179492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:22.179492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PXnUDwCiUfyGyB6uYetmIhCeEJApoaVJuVzgq4hcNcRAhHeBLMax1+BzbeS+LzM6fhIdNxExQVk7GWZZ1rl4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:22.180064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6baf4781fe1d1a88477999dff41b4a6593c7228afaff3da4b9b325b21725917","sha256:a9abd74d2471b360a8e6f6bcf3f86a931fb04d5874b5e5f7c85f4e50b01e555c"],"state_sha256":"56a27d6568704314a91fe37cff9c524f18bd3843f855bc75c3151852aaa99986"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aScanq6WD99nHPhk6UeRrUQX09KM7F2XXGSMH+J//+Sa+qSIOeAb41/9C2lIgEmp/qf8O9fgKs+Fep8ccz5bAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:52:57.936780Z","bundle_sha256":"aa9a0c4f8ee7f9fee33f0beb98e57046a74f68f272f3f80751dd58ba36f68ee5"}}