{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4DSKKLN2AJ53HSTO3KOZ6K3KFV","short_pith_number":"pith:4DSKKLN2","schema_version":"1.0","canonical_sha256":"e0e4a52dba027bb3ca6eda9d9f2b6a2d6127d761ce435661fc665cdc8d900e9a","source":{"kind":"arxiv","id":"1112.1260","version":1},"attestation_state":"computed","paper":{"title":"Steganography: a class of secure and robust algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christophe Guyeux, Jacques M. Bahi, Jean-Fran\\c{c}ois Couchot","submitted_at":"2011-12-06T12:59:33Z","abstract_excerpt":"This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains."},"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":"1112.1260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-06T12:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"f8298a6b8f9bf57fd8191f5a49569f2bb659faeefb3a878d9d069e83b1bde98b","abstract_canon_sha256":"4c578d5ad67fd21df08f085a3c2205841a1fa4d9d31eac2fde42515d06148dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.845203Z","signature_b64":"5qSFgcB7Xjb4al5HScxZmJjYWBArNMU0PCBwikhVx2wsdAJo1lib9T3u9vog8u33QYKYCZtG5kaqmSCZvMb7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e4a52dba027bb3ca6eda9d9f2b6a2d6127d761ce435661fc665cdc8d900e9a","last_reissued_at":"2026-05-18T02:21:27.844473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.844473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Steganography: a class of secure and robust algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christophe Guyeux, Jacques M. Bahi, Jean-Fran\\c{c}ois Couchot","submitted_at":"2011-12-06T12:59:33Z","abstract_excerpt":"This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1260","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":"1112.1260","created_at":"2026-05-18T02:21:27.844592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1260v1","created_at":"2026-05-18T02:21:27.844592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1260","created_at":"2026-05-18T02:21:27.844592+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DSKKLN2AJ53","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DSKKLN2AJ53HSTO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DSKKLN2","created_at":"2026-05-18T12:26:20.644004+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/4DSKKLN2AJ53HSTO3KOZ6K3KFV","json":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV.json","graph_json":"https://pith.science/api/pith-number/4DSKKLN2AJ53HSTO3KOZ6K3KFV/graph.json","events_json":"https://pith.science/api/pith-number/4DSKKLN2AJ53HSTO3KOZ6K3KFV/events.json","paper":"https://pith.science/paper/4DSKKLN2"},"agent_actions":{"view_html":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV","download_json":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV.json","view_paper":"https://pith.science/paper/4DSKKLN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1260&json=true","fetch_graph":"https://pith.science/api/pith-number/4DSKKLN2AJ53HSTO3KOZ6K3KFV/graph.json","fetch_events":"https://pith.science/api/pith-number/4DSKKLN2AJ53HSTO3KOZ6K3KFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV/action/storage_attestation","attest_author":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV/action/author_attestation","sign_citation":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV/action/citation_signature","submit_replication":"https://pith.science/pith/4DSKKLN2AJ53HSTO3KOZ6K3KFV/action/replication_record"}},"created_at":"2026-05-18T02:21:27.844592+00:00","updated_at":"2026-05-18T02:21:27.844592+00:00"}