{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LHEHFGJGBPOSIJZPR3OL23GSIA","short_pith_number":"pith:LHEHFGJG","canonical_record":{"source":{"id":"1611.04349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-14T12:04:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c88b6b2210aabc0a786a590abb6a3ceb920d6d80aebf3a0b13d983b23d295978","abstract_canon_sha256":"7d28876c975ad360356228b45ab400eeab79c70b47963310bdffed957a6a6656"},"schema_version":"1.0"},"canonical_sha256":"59c87299260bdd24272f8edcbd6cd24004cd06be6b4d2e84659dbabcc7f27abe","source":{"kind":"arxiv","id":"1611.04349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04349","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04349v2","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04349","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"LHEHFGJGBPOS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHEHFGJGBPOSIJZP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHEHFGJG","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LHEHFGJGBPOSIJZPR3OL23GSIA","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-14T12:04:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c88b6b2210aabc0a786a590abb6a3ceb920d6d80aebf3a0b13d983b23d295978","abstract_canon_sha256":"7d28876c975ad360356228b45ab400eeab79c70b47963310bdffed957a6a6656"},"schema_version":"1.0"},"canonical_sha256":"59c87299260bdd24272f8edcbd6cd24004cd06be6b4d2e84659dbabcc7f27abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:06.804534Z","signature_b64":"LPie21FDiLsuB7kuPkG9nwRX1MsUmmRl9EaRqp0OpC2YnhH2g/caatait2JPBG75Px47nYebokkEtWo840D4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c87299260bdd24272f8edcbd6cd24004cd06be6b4d2e84659dbabcc7f27abe","last_reissued_at":"2026-05-18T00:53:06.804156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:06.804156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04349","source_version":2,"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-18T00:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkBaVmuU+tI2QXObfDPtLYaUHQeXaecmh9rE9jQ1cjGvBSKJghYq6shE3IemQeaHssMov8zhGmF4282Q0OnMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:31.580706Z"},"content_sha256":"47b3e9ca08dcd33526bcce202a3df5e324628e76c5978a59d509e2aa3de70310","schema_version":"1.0","event_id":"sha256:47b3e9ca08dcd33526bcce202a3df5e324628e76c5978a59d509e2aa3de70310"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LHEHFGJGBPOSIJZPR3OL23GSIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds and Constructions for $\\overline{3}$-Strongly Separable Codes with Length $3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Jing Jiang, Minquan Cheng, Xuli Zhang","submitted_at":"2016-11-14T12:04:37Z","abstract_excerpt":"As separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes. Furthermore, SSC is better than FPC and SC in the applications for multimedia fingerprinting since SSC has lower tracing complexity than that of SC (the same complexity as FPC) and weaker structure than that of FPC. In this paper, we first derive several upper bounds on the number of codewords of $\\overline{t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04349","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"},"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-18T00:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bb645eQm1F+jnmauH92zZ1byaWIHcLoBDQxRgLuf0sQIXkKBfuESEfMl6rHYoako/OwDx0/trGjp8YNiAGgXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:31.581063Z"},"content_sha256":"1733cbf89bee169c56e03a022394e56e0ced1162dd088a54d0457f2bd10f1bfd","schema_version":"1.0","event_id":"sha256:1733cbf89bee169c56e03a022394e56e0ced1162dd088a54d0457f2bd10f1bfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/bundle.json","state_url":"https://pith.science/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/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-02T18:38:31Z","links":{"resolver":"https://pith.science/pith/LHEHFGJGBPOSIJZPR3OL23GSIA","bundle":"https://pith.science/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/bundle.json","state":"https://pith.science/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHEHFGJGBPOSIJZPR3OL23GSIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LHEHFGJGBPOSIJZPR3OL23GSIA","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":"7d28876c975ad360356228b45ab400eeab79c70b47963310bdffed957a6a6656","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-14T12:04:37Z","title_canon_sha256":"c88b6b2210aabc0a786a590abb6a3ceb920d6d80aebf3a0b13d983b23d295978"},"schema_version":"1.0","source":{"id":"1611.04349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04349","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04349v2","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04349","created_at":"2026-05-18T00:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"LHEHFGJGBPOS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHEHFGJGBPOSIJZP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHEHFGJG","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:1733cbf89bee169c56e03a022394e56e0ced1162dd088a54d0457f2bd10f1bfd","target":"graph","created_at":"2026-05-18T00:53:06Z","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":"As separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes. Furthermore, SSC is better than FPC and SC in the applications for multimedia fingerprinting since SSC has lower tracing complexity than that of SC (the same complexity as FPC) and weaker structure than that of FPC. In this paper, we first derive several upper bounds on the number of codewords of $\\overline{t","authors_text":"Jing Jiang, Minquan Cheng, Xuli Zhang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-14T12:04:37Z","title":"Bounds and Constructions for $\\overline{3}$-Strongly Separable Codes with Length $3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04349","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:47b3e9ca08dcd33526bcce202a3df5e324628e76c5978a59d509e2aa3de70310","target":"record","created_at":"2026-05-18T00:53:06Z","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":"7d28876c975ad360356228b45ab400eeab79c70b47963310bdffed957a6a6656","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-14T12:04:37Z","title_canon_sha256":"c88b6b2210aabc0a786a590abb6a3ceb920d6d80aebf3a0b13d983b23d295978"},"schema_version":"1.0","source":{"id":"1611.04349","kind":"arxiv","version":2}},"canonical_sha256":"59c87299260bdd24272f8edcbd6cd24004cd06be6b4d2e84659dbabcc7f27abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59c87299260bdd24272f8edcbd6cd24004cd06be6b4d2e84659dbabcc7f27abe","first_computed_at":"2026-05-18T00:53:06.804156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:06.804156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LPie21FDiLsuB7kuPkG9nwRX1MsUmmRl9EaRqp0OpC2YnhH2g/caatait2JPBG75Px47nYebokkEtWo840D4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:06.804534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b3e9ca08dcd33526bcce202a3df5e324628e76c5978a59d509e2aa3de70310","sha256:1733cbf89bee169c56e03a022394e56e0ced1162dd088a54d0457f2bd10f1bfd"],"state_sha256":"d85179b29376ccce27b87e4f3e34713df1a0c3653dd00837a6bfe57981a50d54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CNTDQfeojLsjr5GngKuQ4Iw9/N+jJ5aVaqVmMRnlH7p6Flnb5flVUSjHT2joOoBZ7WWGUmyYceB8glpHJKiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:38:31.583088Z","bundle_sha256":"5186f52bd2e86ec20b08b995d6daaefb62fd206a2ddbde1a22c0ef0270344ae8"}}