{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BWYTGRNT6WFAKFEBKE3OLBPHJ6","short_pith_number":"pith:BWYTGRNT","canonical_record":{"source":{"id":"1205.4832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-22T08:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"a69fc501cdabd2d82bb9f903157890795630274be8f3c61efe7fa5912077058a","abstract_canon_sha256":"f4ecbce09ec9cca606b0f5b989a0127410f07ea08998722c8cf1dd96238b72a0"},"schema_version":"1.0"},"canonical_sha256":"0db13345b3f58a0514815136e585e74f8bcbb326bbbb9b9b67f436a1aca63ea2","source":{"kind":"arxiv","id":"1205.4832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4832","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4832v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4832","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"BWYTGRNT6WFA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWYTGRNT6WFAKFEB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWYTGRNT","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BWYTGRNT6WFAKFEBKE3OLBPHJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-22T08:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"a69fc501cdabd2d82bb9f903157890795630274be8f3c61efe7fa5912077058a","abstract_canon_sha256":"f4ecbce09ec9cca606b0f5b989a0127410f07ea08998722c8cf1dd96238b72a0"},"schema_version":"1.0"},"canonical_sha256":"0db13345b3f58a0514815136e585e74f8bcbb326bbbb9b9b67f436a1aca63ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.536876Z","signature_b64":"0ZNQA/RDz1wDvjmYkfBNEA5VIY4PSFwznQuh1kME4+S2FL0JWX2ew+a9jatwOgWKAtbhrCvW/CiDIWMVXTo0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db13345b3f58a0514815136e585e74f8bcbb326bbbb9b9b67f436a1aca63ea2","last_reissued_at":"2026-05-18T03:55:11.536372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.536372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4832","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cP2V/CstpxbquWW0uMLbUgbOfRiKwIdWkHIzPfNkeNDXDbTR7b1RN7uzp/YAwSvIkSlaVXd+64kpVBQPwijbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:19:22.492558Z"},"content_sha256":"67064259779a90baf023edd6f6c52beec3f1db873ffe891f0c199e702e035a10","schema_version":"1.0","event_id":"sha256:67064259779a90baf023edd6f6c52beec3f1db873ffe891f0c199e702e035a10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BWYTGRNT6WFAKFEBKE3OLBPHJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SD-REE: A Cryptographic Method to Exclude Repetition from a Message","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Somdip Dey","submitted_at":"2012-05-22T08:02:59Z","abstract_excerpt":"In this paper, the author presents a new cryptographic technique, SD-REE, to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm [1,2] or retrieve the key, used for encryption, by inserting repetitive bytes / characters in the message and encrypt the message or by analyzing repetitions in the encrypted message, to find out the encryption algorithm or retrieve the key used"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4832","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeJ3Jfx/k6N3wDZ3tdnLSwHy3RHfa2+Clt8EUsO4Fa0mLShxv2S+qf+M/AU5j70Y2BUfZpMegrnWVQsJSE/OCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:19:22.492890Z"},"content_sha256":"8c41f45fae20107088c040732e6048637f10f422ebbe166f60d6642e05ed443c","schema_version":"1.0","event_id":"sha256:8c41f45fae20107088c040732e6048637f10f422ebbe166f60d6642e05ed443c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/bundle.json","state_url":"https://pith.science/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/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-24T03:19:22Z","links":{"resolver":"https://pith.science/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6","bundle":"https://pith.science/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/bundle.json","state":"https://pith.science/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWYTGRNT6WFAKFEBKE3OLBPHJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BWYTGRNT6WFAKFEBKE3OLBPHJ6","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":"f4ecbce09ec9cca606b0f5b989a0127410f07ea08998722c8cf1dd96238b72a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-22T08:02:59Z","title_canon_sha256":"a69fc501cdabd2d82bb9f903157890795630274be8f3c61efe7fa5912077058a"},"schema_version":"1.0","source":{"id":"1205.4832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4832","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4832v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4832","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"BWYTGRNT6WFA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWYTGRNT6WFAKFEB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWYTGRNT","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8c41f45fae20107088c040732e6048637f10f422ebbe166f60d6642e05ed443c","target":"graph","created_at":"2026-05-18T03:55:11Z","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 this paper, the author presents a new cryptographic technique, SD-REE, to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm [1,2] or retrieve the key, used for encryption, by inserting repetitive bytes / characters in the message and encrypt the message or by analyzing repetitions in the encrypted message, to find out the encryption algorithm or retrieve the key used","authors_text":"Somdip Dey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-22T08:02:59Z","title":"SD-REE: A Cryptographic Method to Exclude Repetition from a Message"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4832","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:67064259779a90baf023edd6f6c52beec3f1db873ffe891f0c199e702e035a10","target":"record","created_at":"2026-05-18T03:55:11Z","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":"f4ecbce09ec9cca606b0f5b989a0127410f07ea08998722c8cf1dd96238b72a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-22T08:02:59Z","title_canon_sha256":"a69fc501cdabd2d82bb9f903157890795630274be8f3c61efe7fa5912077058a"},"schema_version":"1.0","source":{"id":"1205.4832","kind":"arxiv","version":1}},"canonical_sha256":"0db13345b3f58a0514815136e585e74f8bcbb326bbbb9b9b67f436a1aca63ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db13345b3f58a0514815136e585e74f8bcbb326bbbb9b9b67f436a1aca63ea2","first_computed_at":"2026-05-18T03:55:11.536372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.536372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ZNQA/RDz1wDvjmYkfBNEA5VIY4PSFwznQuh1kME4+S2FL0JWX2ew+a9jatwOgWKAtbhrCvW/CiDIWMVXTo0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.536876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67064259779a90baf023edd6f6c52beec3f1db873ffe891f0c199e702e035a10","sha256:8c41f45fae20107088c040732e6048637f10f422ebbe166f60d6642e05ed443c"],"state_sha256":"0042a9433eff7ef0a4a35fe61a4fdc534606afa5b1042fa93035d08a1e09adb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOqfIHuZpOear+5meOtMPFbgjcV4eQTz9sTBBwFY+SvS59fxpQoDiYfxyng8IKNjGBTnZxJewC3/R0/6krMABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:19:22.494795Z","bundle_sha256":"d35cabb36608851cb47304efa695fc62b9befe2ace475e98c27caee7dcdb0a5c"}}