{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N7YJ4ZV4QVAF5GDKAPD323FY6N","short_pith_number":"pith:N7YJ4ZV4","canonical_record":{"source":{"id":"2506.17233","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-01T08:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"bdcf15f2f431c79191a60abf582363f7cf102ba31afd3b625cde89c23a7ffef2","abstract_canon_sha256":"e12dc060b013cf9699fbe50e45aadc06d9894c1efd940be7681287b567a766bc"},"schema_version":"1.0"},"canonical_sha256":"6ff09e66bc85405e986a03c7bd6cb8f35a0815d20191ca94aaa257786bfba849","source":{"kind":"arxiv","id":"2506.17233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.17233","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.17233v1","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17233","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"N7YJ4ZV4QVAF","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_16","alias_value":"N7YJ4ZV4QVAF5GDK","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_8","alias_value":"N7YJ4ZV4","created_at":"2026-07-05T11:25:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N7YJ4ZV4QVAF5GDKAPD323FY6N","target":"record","payload":{"canonical_record":{"source":{"id":"2506.17233","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-01T08:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"bdcf15f2f431c79191a60abf582363f7cf102ba31afd3b625cde89c23a7ffef2","abstract_canon_sha256":"e12dc060b013cf9699fbe50e45aadc06d9894c1efd940be7681287b567a766bc"},"schema_version":"1.0"},"canonical_sha256":"6ff09e66bc85405e986a03c7bd6cb8f35a0815d20191ca94aaa257786bfba849","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:13.985747Z","signature_b64":"qLqiynYiOecndGpoeHPdUQ84hLCa8Hqjm1rVqXYVTTme/UiA57zwQMnjBkU5Nd2kHi/t46PJawrQsOY61kwPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff09e66bc85405e986a03c7bd6cb8f35a0815d20191ca94aaa257786bfba849","last_reissued_at":"2026-07-05T11:25:13.985233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:13.985233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.17233","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-07-05T11:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuZ/cdtnkEW6EqUyPuhD6cI75cQc3Q3s8LSoYED94liqY2l13Liohc28xgoHH/4ZBxYtmdIQFY63Ewyc6Jj9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:39:17.953489Z"},"content_sha256":"d36bf951ff50ec1dc36394ab5be80b0d214518cd4379a6a5560debc2a80e0ee4","schema_version":"1.0","event_id":"sha256:d36bf951ff50ec1dc36394ab5be80b0d214518cd4379a6a5560debc2a80e0ee4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N7YJ4ZV4QVAF5GDKAPD323FY6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Geometric Square-Based Approach to RSA Integer Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Akihisa Yorozu","submitted_at":"2025-06-01T08:55:25Z","abstract_excerpt":"We present a new approach to RSA factorization inspired by geometric interpretations and square differences. This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that allows rapid convergence when the RSA modulus has closely spaced prime factors. Although this method is efficient for small semiprimes, it does not yet succeed in factoring large challenges like RSA-100 in practical time, highlighting both its potential and current limitations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17233","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.17233/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"},"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-07-05T11:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMlvi1Og08uTKafQjyKeGH+DrxZwGuI1aids5Nt9r2jB8M8wVfsxfgBTzlN11zIDDslwaeT2FGtd5DHfDwBtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:39:17.954032Z"},"content_sha256":"135b67c943ba2c94cbe4f681727a4cc94bccb78f78f60bfff1dbb83b64b3075a","schema_version":"1.0","event_id":"sha256:135b67c943ba2c94cbe4f681727a4cc94bccb78f78f60bfff1dbb83b64b3075a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/bundle.json","state_url":"https://pith.science/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/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-08-08T09:39:17Z","links":{"resolver":"https://pith.science/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N","bundle":"https://pith.science/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/bundle.json","state":"https://pith.science/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7YJ4ZV4QVAF5GDKAPD323FY6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N7YJ4ZV4QVAF5GDKAPD323FY6N","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":"e12dc060b013cf9699fbe50e45aadc06d9894c1efd940be7681287b567a766bc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-01T08:55:25Z","title_canon_sha256":"bdcf15f2f431c79191a60abf582363f7cf102ba31afd3b625cde89c23a7ffef2"},"schema_version":"1.0","source":{"id":"2506.17233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.17233","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.17233v1","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17233","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"N7YJ4ZV4QVAF","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_16","alias_value":"N7YJ4ZV4QVAF5GDK","created_at":"2026-07-05T11:25:13Z"},{"alias_kind":"pith_short_8","alias_value":"N7YJ4ZV4","created_at":"2026-07-05T11:25:13Z"}],"graph_snapshots":[{"event_id":"sha256:135b67c943ba2c94cbe4f681727a4cc94bccb78f78f60bfff1dbb83b64b3075a","target":"graph","created_at":"2026-07-05T11:25:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.17233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new approach to RSA factorization inspired by geometric interpretations and square differences. This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that allows rapid convergence when the RSA modulus has closely spaced prime factors. Although this method is efficient for small semiprimes, it does not yet succeed in factoring large challenges like RSA-100 in practical time, highlighting both its potential and current limitations.","authors_text":"Akihisa Yorozu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-01T08:55:25Z","title":"A Geometric Square-Based Approach to RSA Integer Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17233","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:d36bf951ff50ec1dc36394ab5be80b0d214518cd4379a6a5560debc2a80e0ee4","target":"record","created_at":"2026-07-05T11:25:13Z","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":"e12dc060b013cf9699fbe50e45aadc06d9894c1efd940be7681287b567a766bc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-01T08:55:25Z","title_canon_sha256":"bdcf15f2f431c79191a60abf582363f7cf102ba31afd3b625cde89c23a7ffef2"},"schema_version":"1.0","source":{"id":"2506.17233","kind":"arxiv","version":1}},"canonical_sha256":"6ff09e66bc85405e986a03c7bd6cb8f35a0815d20191ca94aaa257786bfba849","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ff09e66bc85405e986a03c7bd6cb8f35a0815d20191ca94aaa257786bfba849","first_computed_at":"2026-07-05T11:25:13.985233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:25:13.985233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qLqiynYiOecndGpoeHPdUQ84hLCa8Hqjm1rVqXYVTTme/UiA57zwQMnjBkU5Nd2kHi/t46PJawrQsOY61kwPBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:25:13.985747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.17233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d36bf951ff50ec1dc36394ab5be80b0d214518cd4379a6a5560debc2a80e0ee4","sha256:135b67c943ba2c94cbe4f681727a4cc94bccb78f78f60bfff1dbb83b64b3075a"],"state_sha256":"a07cc82416b7f73a09ff3280172c34f5983923f8d0dbe12e743a2697242e5c74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLz0Hto5FM+wG0t736WoQ5l7HYxPR3TKN3VJx72slpevW7OK89ePWPQ3rAtqeUtrE1zqa+BpQj3i4pOyJDwFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:39:17.957684Z","bundle_sha256":"66107038cee309097dd3f7a9cd717a8a642b649dc79bf4b82e33b92088b96bfc"}}