{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VY4QEWVFF7NY5T7465VKB5ECJN","short_pith_number":"pith:VY4QEWVF","schema_version":"1.0","canonical_sha256":"ae39025aa52fdb8ecffcf76aa0f4824b678abb4cd9a28657b753f57837e6d0fc","source":{"kind":"arxiv","id":"1104.1970","version":1},"attestation_state":"computed","paper":{"title":"Wet paper codes and the dual distance in steganography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Carlos Munuera, Morgan Barbier (INRIA Saclay - Ile de France)","submitted_at":"2011-04-11T15:08:58Z","abstract_excerpt":"In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a larg"},"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":"1104.1970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-04-11T15:08:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d26398d3ae0a109ea442b022e11d7c47381195d4ddfbcab0b8dcb93f684f6e66","abstract_canon_sha256":"3eef06a3b69b88cedd8091a55fb7e54cbadaa58d318bf7586e1ce1704aabc1c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.963606Z","signature_b64":"PV68wPJd8X17RhRPuLuFEvXx/bb6EQHgaJmzbglSB5zPKve0B7Ljx3Und1Y71khd0XMBm/DO1CZor64fUjS4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae39025aa52fdb8ecffcf76aa0f4824b678abb4cd9a28657b753f57837e6d0fc","last_reissued_at":"2026-05-18T04:24:35.963153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.963153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wet paper codes and the dual distance in steganography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Carlos Munuera, Morgan Barbier (INRIA Saclay - Ile de France)","submitted_at":"2011-04-11T15:08:58Z","abstract_excerpt":"In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1970","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":"1104.1970","created_at":"2026-05-18T04:24:35.963216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1970v1","created_at":"2026-05-18T04:24:35.963216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1970","created_at":"2026-05-18T04:24:35.963216+00:00"},{"alias_kind":"pith_short_12","alias_value":"VY4QEWVFF7NY","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VY4QEWVFF7NY5T74","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VY4QEWVF","created_at":"2026-05-18T12:26:44.992195+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/VY4QEWVFF7NY5T7465VKB5ECJN","json":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN.json","graph_json":"https://pith.science/api/pith-number/VY4QEWVFF7NY5T7465VKB5ECJN/graph.json","events_json":"https://pith.science/api/pith-number/VY4QEWVFF7NY5T7465VKB5ECJN/events.json","paper":"https://pith.science/paper/VY4QEWVF"},"agent_actions":{"view_html":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN","download_json":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN.json","view_paper":"https://pith.science/paper/VY4QEWVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1970&json=true","fetch_graph":"https://pith.science/api/pith-number/VY4QEWVFF7NY5T7465VKB5ECJN/graph.json","fetch_events":"https://pith.science/api/pith-number/VY4QEWVFF7NY5T7465VKB5ECJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN/action/storage_attestation","attest_author":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN/action/author_attestation","sign_citation":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN/action/citation_signature","submit_replication":"https://pith.science/pith/VY4QEWVFF7NY5T7465VKB5ECJN/action/replication_record"}},"created_at":"2026-05-18T04:24:35.963216+00:00","updated_at":"2026-05-18T04:24:35.963216+00:00"}