{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:USTRKRMWCA6LM75CUOWVV3E5AX","short_pith_number":"pith:USTRKRMW","canonical_record":{"source":{"id":"1904.05625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T11:06:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64de65b2df5b113b5248d18236a713e7b914ca0569cfbf7a8e377d756b64f9ea","abstract_canon_sha256":"01ed44ecc270efb0d8662e74ed5388d22c38fd3061b3d3fc3943ae90a2c3be10"},"schema_version":"1.0"},"canonical_sha256":"a4a7154596103cb67fa2a3ad5aec9d05ce312820aa8595482b06ae4553de55fe","source":{"kind":"arxiv","id":"1904.05625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05625","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05625v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05625","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"USTRKRMWCA6L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USTRKRMWCA6LM75C","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USTRKRMW","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:USTRKRMWCA6LM75CUOWVV3E5AX","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T11:06:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64de65b2df5b113b5248d18236a713e7b914ca0569cfbf7a8e377d756b64f9ea","abstract_canon_sha256":"01ed44ecc270efb0d8662e74ed5388d22c38fd3061b3d3fc3943ae90a2c3be10"},"schema_version":"1.0"},"canonical_sha256":"a4a7154596103cb67fa2a3ad5aec9d05ce312820aa8595482b06ae4553de55fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:48.912447Z","signature_b64":"RGRuS+LXYM101Xqca1RMwprbnBaHL3tR33E6qlLHwP7+/PLEgX9w4VDmjXcn8bT0cG/r4n4Z73J4vWXwecPkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a7154596103cb67fa2a3ad5aec9d05ce312820aa8595482b06ae4553de55fe","last_reissued_at":"2026-05-17T23:48:48.911953Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:48.911953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05625","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6URgWyHUFmKq/XsbUKzaEn2gYS8LnI6CU/6P5BYALDh8zvMIX9suo8rF8uPucTGFzp+SQHTsp/08ZhCEuQY3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:12.780142Z"},"content_sha256":"edbefb36cb4a47be143aaa450a98ee8eaa95b2a5dfa8c2e14069210dc73b29d1","schema_version":"1.0","event_id":"sha256:edbefb36cb4a47be143aaa450a98ee8eaa95b2a5dfa8c2e14069210dc73b29d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:USTRKRMWCA6LM75CUOWVV3E5AX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the large syndrome calculation problem in steganography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hyoung Joong Kim, Suah Kim, Vasily Sachnev","submitted_at":"2019-04-11T11:06:16Z","abstract_excerpt":"In error correction code based image steganography, embedding using large length codes have not been researched extensively. This is due to the fact that the embedding efficiency decreases as the length becomes sufficiently larger and the memory requirement to build the parity matrix for large code is almost infeasible. However, recent studies have demonstrated that the embedding efficiency is not as important as minimizing the distortion. In light of the finding, we propose a embedding method using a large length codes which does not have such a large memory requirement. The proposed method s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05625","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vy+okypJL3Ke2aBLBrBllNwEXRmB1FufTnbdmlpl8vAA/HZYUvoiOSx61ZH//pklNNiO9pg9/kuW9xS6G2n5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:12.780510Z"},"content_sha256":"0679c22bd2346a248786c449bf4ac3df69c58bb6a8eaaaca94cbaa9d6783da0d","schema_version":"1.0","event_id":"sha256:0679c22bd2346a248786c449bf4ac3df69c58bb6a8eaaaca94cbaa9d6783da0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USTRKRMWCA6LM75CUOWVV3E5AX/bundle.json","state_url":"https://pith.science/pith/USTRKRMWCA6LM75CUOWVV3E5AX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USTRKRMWCA6LM75CUOWVV3E5AX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T12:48:12Z","links":{"resolver":"https://pith.science/pith/USTRKRMWCA6LM75CUOWVV3E5AX","bundle":"https://pith.science/pith/USTRKRMWCA6LM75CUOWVV3E5AX/bundle.json","state":"https://pith.science/pith/USTRKRMWCA6LM75CUOWVV3E5AX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USTRKRMWCA6LM75CUOWVV3E5AX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:USTRKRMWCA6LM75CUOWVV3E5AX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"01ed44ecc270efb0d8662e74ed5388d22c38fd3061b3d3fc3943ae90a2c3be10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T11:06:16Z","title_canon_sha256":"64de65b2df5b113b5248d18236a713e7b914ca0569cfbf7a8e377d756b64f9ea"},"schema_version":"1.0","source":{"id":"1904.05625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05625","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05625v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05625","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"USTRKRMWCA6L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USTRKRMWCA6LM75C","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USTRKRMW","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:0679c22bd2346a248786c449bf4ac3df69c58bb6a8eaaaca94cbaa9d6783da0d","target":"graph","created_at":"2026-05-17T23:48:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In error correction code based image steganography, embedding using large length codes have not been researched extensively. This is due to the fact that the embedding efficiency decreases as the length becomes sufficiently larger and the memory requirement to build the parity matrix for large code is almost infeasible. However, recent studies have demonstrated that the embedding efficiency is not as important as minimizing the distortion. In light of the finding, we propose a embedding method using a large length codes which does not have such a large memory requirement. The proposed method s","authors_text":"Hyoung Joong Kim, Suah Kim, Vasily Sachnev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T11:06:16Z","title":"Solving the large syndrome calculation problem in steganography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05625","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:edbefb36cb4a47be143aaa450a98ee8eaa95b2a5dfa8c2e14069210dc73b29d1","target":"record","created_at":"2026-05-17T23:48:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"01ed44ecc270efb0d8662e74ed5388d22c38fd3061b3d3fc3943ae90a2c3be10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T11:06:16Z","title_canon_sha256":"64de65b2df5b113b5248d18236a713e7b914ca0569cfbf7a8e377d756b64f9ea"},"schema_version":"1.0","source":{"id":"1904.05625","kind":"arxiv","version":1}},"canonical_sha256":"a4a7154596103cb67fa2a3ad5aec9d05ce312820aa8595482b06ae4553de55fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4a7154596103cb67fa2a3ad5aec9d05ce312820aa8595482b06ae4553de55fe","first_computed_at":"2026-05-17T23:48:48.911953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:48.911953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGRuS+LXYM101Xqca1RMwprbnBaHL3tR33E6qlLHwP7+/PLEgX9w4VDmjXcn8bT0cG/r4n4Z73J4vWXwecPkDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:48.912447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbefb36cb4a47be143aaa450a98ee8eaa95b2a5dfa8c2e14069210dc73b29d1","sha256:0679c22bd2346a248786c449bf4ac3df69c58bb6a8eaaaca94cbaa9d6783da0d"],"state_sha256":"38100502ee44034897ba76cac702429fe3a127136291dda87c99994ac24969a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1b0tRZW27TYE+uJPZNn7RdsrdittUZlpEDfepNgEG9Zm/qomx78iLroCtGUgVZV4FhJf4UyiIqD+KM4gZr4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:48:12.782394Z","bundle_sha256":"8a65aa9d2ec1302cb70b03d08118b6910e2051b59e29a1c76798984b8e353a21"}}