{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YEOSLOKVGBVRWOGKKDYYPTYCGX","short_pith_number":"pith:YEOSLOKV","schema_version":"1.0","canonical_sha256":"c11d25b955306b1b38ca50f187cf0235f85e3afe47bd0a5b01fc040c90da7bf7","source":{"kind":"arxiv","id":"1903.05297","version":2},"attestation_state":"computed","paper":{"title":"Learning Symmetric and Asymmetric Steganography via Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MM"],"primary_cat":"cs.CR","authors_text":"Ge Han, Shanqing Guo, Yunqing Wei, Zheng Li","submitted_at":"2019-03-13T02:55:09Z","abstract_excerpt":"Steganography refers to the art of concealing secret messages within multiple media carriers so that an eavesdropper is unable to detect the presence and content of the hidden messages. In this paper, we firstly propose a novel key-dependent steganographic scheme that achieves steganographic objectives with adversarial training. Symmetric (secret-key) and Asymmetric (public-key) steganographic scheme are separately proposed and each scheme is successfully designed and implemented. We show that these encodings produced by our scheme improve the invisibility by 20% than previous deep-leanring-ba"},"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":"1903.05297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-03-13T02:55:09Z","cross_cats_sorted":["cs.LG","cs.MM"],"title_canon_sha256":"6c8c660db9179fb339df1fbe29662e72990ecc2d5d8c2a51236b5e644fd87795","abstract_canon_sha256":"11b4d4c3be24d84ae540d83aa91e24bdd09088d7dc9646abaa8abff966c12d72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.487403Z","signature_b64":"o7sweOyXzjsWe5F8QXx5Dt3OzgxJqwBnZWPSnsaTln69NAujsRBMkwMnH9t/XKOYj24h8pTrwGfqDVBI9aMzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11d25b955306b1b38ca50f187cf0235f85e3afe47bd0a5b01fc040c90da7bf7","last_reissued_at":"2026-05-17T23:44:21.486557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.486557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Symmetric and Asymmetric Steganography via Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MM"],"primary_cat":"cs.CR","authors_text":"Ge Han, Shanqing Guo, Yunqing Wei, Zheng Li","submitted_at":"2019-03-13T02:55:09Z","abstract_excerpt":"Steganography refers to the art of concealing secret messages within multiple media carriers so that an eavesdropper is unable to detect the presence and content of the hidden messages. In this paper, we firstly propose a novel key-dependent steganographic scheme that achieves steganographic objectives with adversarial training. Symmetric (secret-key) and Asymmetric (public-key) steganographic scheme are separately proposed and each scheme is successfully designed and implemented. We show that these encodings produced by our scheme improve the invisibility by 20% than previous deep-leanring-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05297","kind":"arxiv","version":2},"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":"1903.05297","created_at":"2026-05-17T23:44:21.486695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05297v2","created_at":"2026-05-17T23:44:21.486695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05297","created_at":"2026-05-17T23:44:21.486695+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEOSLOKVGBVR","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEOSLOKVGBVRWOGK","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEOSLOKV","created_at":"2026-05-18T12:33:33.725879+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/YEOSLOKVGBVRWOGKKDYYPTYCGX","json":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX.json","graph_json":"https://pith.science/api/pith-number/YEOSLOKVGBVRWOGKKDYYPTYCGX/graph.json","events_json":"https://pith.science/api/pith-number/YEOSLOKVGBVRWOGKKDYYPTYCGX/events.json","paper":"https://pith.science/paper/YEOSLOKV"},"agent_actions":{"view_html":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX","download_json":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX.json","view_paper":"https://pith.science/paper/YEOSLOKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05297&json=true","fetch_graph":"https://pith.science/api/pith-number/YEOSLOKVGBVRWOGKKDYYPTYCGX/graph.json","fetch_events":"https://pith.science/api/pith-number/YEOSLOKVGBVRWOGKKDYYPTYCGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX/action/storage_attestation","attest_author":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX/action/author_attestation","sign_citation":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX/action/citation_signature","submit_replication":"https://pith.science/pith/YEOSLOKVGBVRWOGKKDYYPTYCGX/action/replication_record"}},"created_at":"2026-05-17T23:44:21.486695+00:00","updated_at":"2026-05-17T23:44:21.486695+00:00"}