{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:32GN5CJRCCZFCMJAEHHXAXD3XJ","short_pith_number":"pith:32GN5CJR","schema_version":"1.0","canonical_sha256":"de8cde893110b251312021cf705c7bba643143ef6bc9de47455f5d4e936a1321","source":{"kind":"arxiv","id":"1907.12914","version":3},"attestation_state":"computed","paper":{"title":"Evolutionary Algorithms and Efficient Data Analytics for Image Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MM","cs.NE"],"primary_cat":"cs.CV","authors_text":"Farid Ghareh Mohammadi, Farzan Shenavarmasouleh, Hamid R. Arabnia, M. Hadi Amini","submitted_at":"2019-07-23T16:13:53Z","abstract_excerpt":"Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Steganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all known and unknown steganogr"},"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":"1907.12914","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T16:13:53Z","cross_cats_sorted":["cs.LG","cs.MM","cs.NE"],"title_canon_sha256":"7f2023f7a20f29a95c40d9bfb91fb8c473eef8b1d922eb612541260d08b630fb","abstract_canon_sha256":"69946e02f221a56ce0338723b5576fbd5e8d0452444c86a8da6eb199322d9909"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:54.762025Z","signature_b64":"BDp97FgCXJyUwoOcUqhQfiwSlDWFM8mzi61bvp+F5srEF801gAqaZfx+GxSNo0yUF9mzw0TtPs454HJ0iS4ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8cde893110b251312021cf705c7bba643143ef6bc9de47455f5d4e936a1321","last_reissued_at":"2026-07-05T01:43:54.761530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:54.761530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Algorithms and Efficient Data Analytics for Image Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MM","cs.NE"],"primary_cat":"cs.CV","authors_text":"Farid Ghareh Mohammadi, Farzan Shenavarmasouleh, Hamid R. Arabnia, M. Hadi Amini","submitted_at":"2019-07-23T16:13:53Z","abstract_excerpt":"Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Steganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all known and unknown steganogr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12914","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.12914/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.12914","created_at":"2026-07-05T01:43:54.761627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12914v3","created_at":"2026-07-05T01:43:54.761627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12914","created_at":"2026-07-05T01:43:54.761627+00:00"},{"alias_kind":"pith_short_12","alias_value":"32GN5CJRCCZF","created_at":"2026-07-05T01:43:54.761627+00:00"},{"alias_kind":"pith_short_16","alias_value":"32GN5CJRCCZFCMJA","created_at":"2026-07-05T01:43:54.761627+00:00"},{"alias_kind":"pith_short_8","alias_value":"32GN5CJR","created_at":"2026-07-05T01:43:54.761627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08006","citing_title":"Evolutionary Computation, Optimization and Learning Algorithms for Data Science","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ","json":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ.json","graph_json":"https://pith.science/api/pith-number/32GN5CJRCCZFCMJAEHHXAXD3XJ/graph.json","events_json":"https://pith.science/api/pith-number/32GN5CJRCCZFCMJAEHHXAXD3XJ/events.json","paper":"https://pith.science/paper/32GN5CJR"},"agent_actions":{"view_html":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ","download_json":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ.json","view_paper":"https://pith.science/paper/32GN5CJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12914&json=true","fetch_graph":"https://pith.science/api/pith-number/32GN5CJRCCZFCMJAEHHXAXD3XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/32GN5CJRCCZFCMJAEHHXAXD3XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ/action/storage_attestation","attest_author":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ/action/author_attestation","sign_citation":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ/action/citation_signature","submit_replication":"https://pith.science/pith/32GN5CJRCCZFCMJAEHHXAXD3XJ/action/replication_record"}},"created_at":"2026-07-05T01:43:54.761627+00:00","updated_at":"2026-07-05T01:43:54.761627+00:00"}