{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:T62FUQRJVH2CS66AIYTPV3VF57","short_pith_number":"pith:T62FUQRJ","schema_version":"1.0","canonical_sha256":"9fb45a4229a9f4297bc04626faeea5efebbae24e11a4b2a6497e470b35170a92","source":{"kind":"arxiv","id":"0809.1593","version":2},"attestation_state":"computed","paper":{"title":"Constructing Perfect Steganographic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Boris Ryabko, Daniil Ryabko","submitted_at":"2008-09-09T16:09:52Z","abstract_excerpt":"We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is t"},"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":"0809.1593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2008-09-09T16:09:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"decbc9261658f06978909013a2c5b1a27ac87dab619af2cd363ea14f53e87600","abstract_canon_sha256":"1cf0f8d286513ccd5dd479df78dc9be53976ef9fba13c664703486696230e81a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:26.770230Z","signature_b64":"4w241cXorofhF6zussU4sSHVwOXiPrlzRW+q3GYchlczC9OguS9ffkeQKr/tUurunCrct2dTxaxXk9PgPu7xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb45a4229a9f4297bc04626faeea5efebbae24e11a4b2a6497e470b35170a92","last_reissued_at":"2026-05-18T04:01:26.769459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:26.769459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Perfect Steganographic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Boris Ryabko, Daniil Ryabko","submitted_at":"2008-09-09T16:09:52Z","abstract_excerpt":"We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1593","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":"0809.1593","created_at":"2026-05-18T04:01:26.769584+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.1593v2","created_at":"2026-05-18T04:01:26.769584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1593","created_at":"2026-05-18T04:01:26.769584+00:00"},{"alias_kind":"pith_short_12","alias_value":"T62FUQRJVH2C","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"T62FUQRJVH2CS66A","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"T62FUQRJ","created_at":"2026-05-18T12:25:58.018023+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/T62FUQRJVH2CS66AIYTPV3VF57","json":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57.json","graph_json":"https://pith.science/api/pith-number/T62FUQRJVH2CS66AIYTPV3VF57/graph.json","events_json":"https://pith.science/api/pith-number/T62FUQRJVH2CS66AIYTPV3VF57/events.json","paper":"https://pith.science/paper/T62FUQRJ"},"agent_actions":{"view_html":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57","download_json":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57.json","view_paper":"https://pith.science/paper/T62FUQRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.1593&json=true","fetch_graph":"https://pith.science/api/pith-number/T62FUQRJVH2CS66AIYTPV3VF57/graph.json","fetch_events":"https://pith.science/api/pith-number/T62FUQRJVH2CS66AIYTPV3VF57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57/action/storage_attestation","attest_author":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57/action/author_attestation","sign_citation":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57/action/citation_signature","submit_replication":"https://pith.science/pith/T62FUQRJVH2CS66AIYTPV3VF57/action/replication_record"}},"created_at":"2026-05-18T04:01:26.769584+00:00","updated_at":"2026-05-18T04:01:26.769584+00:00"}