{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R3ABQGD6F2O6UYH6Q6OAPMCIRK","short_pith_number":"pith:R3ABQGD6","schema_version":"1.0","canonical_sha256":"8ec018187e2e9dea60fe879c07b0488aab1156a6b0f1b6676ff022485eba02bc","source":{"kind":"arxiv","id":"1411.6841","version":1},"attestation_state":"computed","paper":{"title":"Multimedia IPP Codes with Efficient Tracing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dianhua Wu, Jing Jiang, Minquan Cheng, Ying Miao","submitted_at":"2014-11-25T12:51:51Z","abstract_excerpt":"Binary multimedia identifiable parent property codes (binary $t$-MIPPCs) are used in multimedia fingerprinting schemes where the identification of users taking part in the averaging collusion attack to illegally redistribute content is required. In this paper, we first introduce a binary strong multimedia identifiable parent property code (binary $t$-SMIPPC) whose tracing algorithm is more efficient than that of a binary $t$-MIPPC. Then a composition construction for binary $t$-SMIPPCs from $q$-ary $t$-SMIPPCs is provided. Several infinite series of optimal $q$-ary $t$-SMIPPCs of length $2$ wi"},"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":"1411.6841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-25T12:51:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1414b8ee7ceba2b14788487d2d5ca7129efd867306fcfe4b6b98fc321d70e75","abstract_canon_sha256":"4155256f20a1dc634cf1e5761d60e0db0d612a950db9859e888d889a65e881d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.191465Z","signature_b64":"P6BTZvzcY6yImrmQPoSfz4SqwalRKb8lPwBqFHfbq+HJU+eVryp3dvZiEL/P2TVPiNxvtT0ew23+wAggrHJwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec018187e2e9dea60fe879c07b0488aab1156a6b0f1b6676ff022485eba02bc","last_reissued_at":"2026-05-18T02:32:47.190933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.190933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multimedia IPP Codes with Efficient Tracing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dianhua Wu, Jing Jiang, Minquan Cheng, Ying Miao","submitted_at":"2014-11-25T12:51:51Z","abstract_excerpt":"Binary multimedia identifiable parent property codes (binary $t$-MIPPCs) are used in multimedia fingerprinting schemes where the identification of users taking part in the averaging collusion attack to illegally redistribute content is required. In this paper, we first introduce a binary strong multimedia identifiable parent property code (binary $t$-SMIPPC) whose tracing algorithm is more efficient than that of a binary $t$-MIPPC. Then a composition construction for binary $t$-SMIPPCs from $q$-ary $t$-SMIPPCs is provided. Several infinite series of optimal $q$-ary $t$-SMIPPCs of length $2$ wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6841","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":"1411.6841","created_at":"2026-05-18T02:32:47.191008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6841v1","created_at":"2026-05-18T02:32:47.191008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6841","created_at":"2026-05-18T02:32:47.191008+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3ABQGD6F2O6","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3ABQGD6F2O6UYH6","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3ABQGD6","created_at":"2026-05-18T12:28:46.137349+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/R3ABQGD6F2O6UYH6Q6OAPMCIRK","json":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK.json","graph_json":"https://pith.science/api/pith-number/R3ABQGD6F2O6UYH6Q6OAPMCIRK/graph.json","events_json":"https://pith.science/api/pith-number/R3ABQGD6F2O6UYH6Q6OAPMCIRK/events.json","paper":"https://pith.science/paper/R3ABQGD6"},"agent_actions":{"view_html":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK","download_json":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK.json","view_paper":"https://pith.science/paper/R3ABQGD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6841&json=true","fetch_graph":"https://pith.science/api/pith-number/R3ABQGD6F2O6UYH6Q6OAPMCIRK/graph.json","fetch_events":"https://pith.science/api/pith-number/R3ABQGD6F2O6UYH6Q6OAPMCIRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK/action/storage_attestation","attest_author":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK/action/author_attestation","sign_citation":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK/action/citation_signature","submit_replication":"https://pith.science/pith/R3ABQGD6F2O6UYH6Q6OAPMCIRK/action/replication_record"}},"created_at":"2026-05-18T02:32:47.191008+00:00","updated_at":"2026-05-18T02:32:47.191008+00:00"}