{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:53XVO4DEPSSHDLRY3KMKZS2NPM","short_pith_number":"pith:53XVO4DE","schema_version":"1.0","canonical_sha256":"eeef5770647ca471ae38da98accb4d7b38e673c841ddd39f27af396f71ae0bb6","source":{"kind":"arxiv","id":"0705.1919","version":1},"attestation_state":"computed","paper":{"title":"Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources","license":"","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Erez Sabbag, Neri Merhav","submitted_at":"2007-05-14T12:00:29Z","abstract_excerpt":"An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, we consider the attack-free scenario under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, we explore the case of zero-mean i.i.d. Gaussian covertext distribution with unknown variance under the attack-free scenario. For this case, we propose a lower bound on the exponential decay rate of the false-negative probability and prove that the optimal embedding and detecting strategy is superi"},"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":"0705.1919","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-05-14T12:00:29Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"ff14b7d465aaf9a63d3fd9acfefe16f03dd7e42156914dce0037403df80d101e","abstract_canon_sha256":"508c0895e89fedf341ec367a56828172eb68f5a9b00f000f34e58c24d44db782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.154422Z","signature_b64":"XGsBx/0e9pFVoEYX2rXzkh1vW4/L39Qmn52EABOmBSi8N6sbEJXwDNQqVEJjdIkTQM570FzSV5S3tCmfO+5JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeef5770647ca471ae38da98accb4d7b38e673c841ddd39f27af396f71ae0bb6","last_reissued_at":"2026-05-18T00:59:12.153670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.153670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources","license":"","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Erez Sabbag, Neri Merhav","submitted_at":"2007-05-14T12:00:29Z","abstract_excerpt":"An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, we consider the attack-free scenario under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, we explore the case of zero-mean i.i.d. Gaussian covertext distribution with unknown variance under the attack-free scenario. For this case, we propose a lower bound on the exponential decay rate of the false-negative probability and prove that the optimal embedding and detecting strategy is superi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1919","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":"0705.1919","created_at":"2026-05-18T00:59:12.153808+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.1919v1","created_at":"2026-05-18T00:59:12.153808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1919","created_at":"2026-05-18T00:59:12.153808+00:00"},{"alias_kind":"pith_short_12","alias_value":"53XVO4DEPSSH","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"53XVO4DEPSSHDLRY","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"53XVO4DE","created_at":"2026-05-18T12:25:55.427421+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/53XVO4DEPSSHDLRY3KMKZS2NPM","json":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM.json","graph_json":"https://pith.science/api/pith-number/53XVO4DEPSSHDLRY3KMKZS2NPM/graph.json","events_json":"https://pith.science/api/pith-number/53XVO4DEPSSHDLRY3KMKZS2NPM/events.json","paper":"https://pith.science/paper/53XVO4DE"},"agent_actions":{"view_html":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM","download_json":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM.json","view_paper":"https://pith.science/paper/53XVO4DE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.1919&json=true","fetch_graph":"https://pith.science/api/pith-number/53XVO4DEPSSHDLRY3KMKZS2NPM/graph.json","fetch_events":"https://pith.science/api/pith-number/53XVO4DEPSSHDLRY3KMKZS2NPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM/action/storage_attestation","attest_author":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM/action/author_attestation","sign_citation":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM/action/citation_signature","submit_replication":"https://pith.science/pith/53XVO4DEPSSHDLRY3KMKZS2NPM/action/replication_record"}},"created_at":"2026-05-18T00:59:12.153808+00:00","updated_at":"2026-05-18T00:59:12.153808+00:00"}