{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2FJ3KBUGTQ5AWARZEVA6RECMG5","short_pith_number":"pith:2FJ3KBUG","canonical_record":{"source":{"id":"1501.02365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-10T16:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"4fd22b73b66acc54364311ade00b671bb2ff582cb4e46dcb8869fbb1977c4a67","abstract_canon_sha256":"dc8e5766d13c98b82fce7adfcd0a64e17cf69a1fdda1471a40d7471caa4b55d8"},"schema_version":"1.0"},"canonical_sha256":"d153b506869c3a0b02392541e8904c3743b16803e46596ed3bf28228b642e626","source":{"kind":"arxiv","id":"1501.02365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02365","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02365v1","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02365","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"2FJ3KBUGTQ5A","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2FJ3KBUGTQ5AWARZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2FJ3KBUG","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2FJ3KBUGTQ5AWARZEVA6RECMG5","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-10T16:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"4fd22b73b66acc54364311ade00b671bb2ff582cb4e46dcb8869fbb1977c4a67","abstract_canon_sha256":"dc8e5766d13c98b82fce7adfcd0a64e17cf69a1fdda1471a40d7471caa4b55d8"},"schema_version":"1.0"},"canonical_sha256":"d153b506869c3a0b02392541e8904c3743b16803e46596ed3bf28228b642e626","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:38.138790Z","signature_b64":"slW0pQ6awmMw8hMO6Aj04/WxetDutTcFvtvh5VFR02wnb6Xq3iz/0U2/eQUonGURMfmL8gev/qLyt9nh4GvlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d153b506869c3a0b02392541e8904c3743b16803e46596ed3bf28228b642e626","last_reissued_at":"2026-05-18T02:29:38.137752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:38.137752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02365","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-18T02:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsF1uTa8Rzz9+rbqzek9J4uBoaG+W7pnAWAcf9JlMKQRG+BakEvXbEaOGS+4LqhK/nUDTlmQbB93/xd0WtM8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:00.352528Z"},"content_sha256":"67f87b737de29594019ec67054bf00b220578a3579620c7fd4149050f1a65a7c","schema_version":"1.0","event_id":"sha256:67f87b737de29594019ec67054bf00b220578a3579620c7fd4149050f1a65a7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2FJ3KBUGTQ5AWARZEVA6RECMG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modified Trial Division Algorithm Using KNJ-Factorization Method To Factorize RSA Public Key Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anurag Prakash Singh, Nidhi Lal, Shishupal Kumar","submitted_at":"2015-01-10T16:00:41Z","abstract_excerpt":"The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the past years. The offered KNJ -Factorization algorithm contributes a deterministic way to factorize RSA. The algorithm limits the search by only considering the prime values. Subsequently prime numbers are odd numbers accordingly it also requires smaller number steps to factorize RSA. In this paper, the anticipated algorithm is very simple besides it is very "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02365","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-18T02:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPFqXA7eVfl6JBSezhOuoTFTCd0ErLhhCGIzepG2Dw2sLkQskdGEHH/eIvIUxZz+czwHD+ceEjEGDqjc6vFIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:00.353184Z"},"content_sha256":"465d80109e73e1c7d63309bf22b3726cdb56aee5f46d1d9765928664cce360ba","schema_version":"1.0","event_id":"sha256:465d80109e73e1c7d63309bf22b3726cdb56aee5f46d1d9765928664cce360ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/bundle.json","state_url":"https://pith.science/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/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-05-31T03:14:00Z","links":{"resolver":"https://pith.science/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5","bundle":"https://pith.science/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/bundle.json","state":"https://pith.science/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FJ3KBUGTQ5AWARZEVA6RECMG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2FJ3KBUGTQ5AWARZEVA6RECMG5","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":"dc8e5766d13c98b82fce7adfcd0a64e17cf69a1fdda1471a40d7471caa4b55d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-10T16:00:41Z","title_canon_sha256":"4fd22b73b66acc54364311ade00b671bb2ff582cb4e46dcb8869fbb1977c4a67"},"schema_version":"1.0","source":{"id":"1501.02365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02365","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02365v1","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02365","created_at":"2026-05-18T02:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"2FJ3KBUGTQ5A","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2FJ3KBUGTQ5AWARZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2FJ3KBUG","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:465d80109e73e1c7d63309bf22b3726cdb56aee5f46d1d9765928664cce360ba","target":"graph","created_at":"2026-05-18T02:29:38Z","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":"The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the past years. The offered KNJ -Factorization algorithm contributes a deterministic way to factorize RSA. The algorithm limits the search by only considering the prime values. Subsequently prime numbers are odd numbers accordingly it also requires smaller number steps to factorize RSA. In this paper, the anticipated algorithm is very simple besides it is very ","authors_text":"Anurag Prakash Singh, Nidhi Lal, Shishupal Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-10T16:00:41Z","title":"Modified Trial Division Algorithm Using KNJ-Factorization Method To Factorize RSA Public Key Encryption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02365","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:67f87b737de29594019ec67054bf00b220578a3579620c7fd4149050f1a65a7c","target":"record","created_at":"2026-05-18T02:29:38Z","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":"dc8e5766d13c98b82fce7adfcd0a64e17cf69a1fdda1471a40d7471caa4b55d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-10T16:00:41Z","title_canon_sha256":"4fd22b73b66acc54364311ade00b671bb2ff582cb4e46dcb8869fbb1977c4a67"},"schema_version":"1.0","source":{"id":"1501.02365","kind":"arxiv","version":1}},"canonical_sha256":"d153b506869c3a0b02392541e8904c3743b16803e46596ed3bf28228b642e626","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d153b506869c3a0b02392541e8904c3743b16803e46596ed3bf28228b642e626","first_computed_at":"2026-05-18T02:29:38.137752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:38.137752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"slW0pQ6awmMw8hMO6Aj04/WxetDutTcFvtvh5VFR02wnb6Xq3iz/0U2/eQUonGURMfmL8gev/qLyt9nh4GvlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:38.138790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f87b737de29594019ec67054bf00b220578a3579620c7fd4149050f1a65a7c","sha256:465d80109e73e1c7d63309bf22b3726cdb56aee5f46d1d9765928664cce360ba"],"state_sha256":"ae4ea6b88bbd2fc44552537328bd0e06d2eb0a8613f26244bf339d572afb3a6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1SM6BWuOQY8o6J1UC08uP3eP3j6BlOaV5pTJTG2mpYU9iHgJmkdXPiMuOrRa2f/Lxiby4Upw8Wr2r3CrQ1TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:14:00.356615Z","bundle_sha256":"17912936d89fff0eff70eb2b17431b6e50dcdfdd1c71d3f2f5b19e046900571c"}}