{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OAHJB67K66PY6UKMTZV6KJ3A37","short_pith_number":"pith:OAHJB67K","schema_version":"1.0","canonical_sha256":"700e90fbeaf79f8f514c9e6be52760dfd9736f703a9bda08e703788846150cdc","source":{"kind":"arxiv","id":"1705.00726","version":1},"attestation_state":"computed","paper":{"title":"Optimum Decoder for Multiplicative Spread Spectrum Image Watermarking with Laplacian Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Mohammad Reza Aref, Nematollah Zarmehi","submitted_at":"2017-05-01T22:08:10Z","abstract_excerpt":"This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution because the sample loss of digital media can be better modeled with this distribution than the Gaussian one. We derive the optimum decoder for the proposed embedding method thanks to the maximum likelihood decoding s"},"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":"1705.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2017-05-01T22:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"d4570cf3429bc38ec11d3bb483706b65718b61edc69c5a789c41b31935b66684","abstract_canon_sha256":"cdc034c54fdd327aafb31e727a8114332ce30a722337f7fccd8e8244a82ea0b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:10.015002Z","signature_b64":"pF8d7eNcn8zuC1eCjyEyM9pDA3S9Z5BcUMxQ327xQBgyvZkSGf/M684cC+BNDUtXrkX1HtIM1rHouAV1QbsPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"700e90fbeaf79f8f514c9e6be52760dfd9736f703a9bda08e703788846150cdc","last_reissued_at":"2026-05-18T00:45:10.014506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:10.014506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Decoder for Multiplicative Spread Spectrum Image Watermarking with Laplacian Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Mohammad Reza Aref, Nematollah Zarmehi","submitted_at":"2017-05-01T22:08:10Z","abstract_excerpt":"This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution because the sample loss of digital media can be better modeled with this distribution than the Gaussian one. We derive the optimum decoder for the proposed embedding method thanks to the maximum likelihood decoding s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00726","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":"1705.00726","created_at":"2026-05-18T00:45:10.014595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00726v1","created_at":"2026-05-18T00:45:10.014595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00726","created_at":"2026-05-18T00:45:10.014595+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAHJB67K66PY","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAHJB67K66PY6UKM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAHJB67K","created_at":"2026-05-18T12:31:34.259226+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/OAHJB67K66PY6UKMTZV6KJ3A37","json":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37.json","graph_json":"https://pith.science/api/pith-number/OAHJB67K66PY6UKMTZV6KJ3A37/graph.json","events_json":"https://pith.science/api/pith-number/OAHJB67K66PY6UKMTZV6KJ3A37/events.json","paper":"https://pith.science/paper/OAHJB67K"},"agent_actions":{"view_html":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37","download_json":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37.json","view_paper":"https://pith.science/paper/OAHJB67K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00726&json=true","fetch_graph":"https://pith.science/api/pith-number/OAHJB67K66PY6UKMTZV6KJ3A37/graph.json","fetch_events":"https://pith.science/api/pith-number/OAHJB67K66PY6UKMTZV6KJ3A37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37/action/storage_attestation","attest_author":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37/action/author_attestation","sign_citation":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37/action/citation_signature","submit_replication":"https://pith.science/pith/OAHJB67K66PY6UKMTZV6KJ3A37/action/replication_record"}},"created_at":"2026-05-18T00:45:10.014595+00:00","updated_at":"2026-05-18T00:45:10.014595+00:00"}