{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M7KCFVMXA6H6QLOI7WT4GB7DQJ","short_pith_number":"pith:M7KCFVMX","canonical_record":{"source":{"id":"2507.07055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-07-09T17:20:49Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"46b8a054f623fe9aaf857e80a3180be5bd4d3d258467d96e1f071c008d2e63a4","abstract_canon_sha256":"21131b40ea2277fc7ee0047d7dda91403171e2a306bb8008c3ff9ae4409281ed"},"schema_version":"1.0"},"canonical_sha256":"67d422d597078fe82dc8fda7c307e382417fb969a8819eb271908ff57c375dc6","source":{"kind":"arxiv","id":"2507.07055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07055","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07055v1","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07055","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"M7KCFVMXA6H6","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_16","alias_value":"M7KCFVMXA6H6QLOI","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_8","alias_value":"M7KCFVMX","created_at":"2026-07-05T11:34:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M7KCFVMXA6H6QLOI7WT4GB7DQJ","target":"record","payload":{"canonical_record":{"source":{"id":"2507.07055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-07-09T17:20:49Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"46b8a054f623fe9aaf857e80a3180be5bd4d3d258467d96e1f071c008d2e63a4","abstract_canon_sha256":"21131b40ea2277fc7ee0047d7dda91403171e2a306bb8008c3ff9ae4409281ed"},"schema_version":"1.0"},"canonical_sha256":"67d422d597078fe82dc8fda7c307e382417fb969a8819eb271908ff57c375dc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:28.357998Z","signature_b64":"ZkQYX6DntxnGYEAx953MO6w/ZdjWtT+WMeMO0sqZofA6HNbwXiTn20AqwUDNqpGYBJmpScXfAdHFXxS8RUG1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d422d597078fe82dc8fda7c307e382417fb969a8819eb271908ff57c375dc6","last_reissued_at":"2026-07-05T11:34:28.357507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:28.357507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.07055","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:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIbs+hwmCel6UqHsXi6soN5C9fT3SDIZbEaVJDUUTeB9RPMlAiAX674qLFC0Mm4MMXoR76B5FNqQBCNEVc5kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:39:24.149831Z"},"content_sha256":"fa92410843d2fb8c03213410356885cc43fa7a48f98d5405da48eaf70d14df71","schema_version":"1.0","event_id":"sha256:fa92410843d2fb8c03213410356885cc43fa7a48f98d5405da48eaf70d14df71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M7KCFVMXA6H6QLOI7WT4GB7DQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Factorization: Another perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Gilda Rech Bansimba, Regis Freguin Babindamana","submitted_at":"2025-07-09T17:20:49Z","abstract_excerpt":"Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods like the General Number Field Sieve, no known algorithm can break the problem in polynomial time, while its proved that Shor's algorithm could on a quantum computer. In this paper, we recall some factorization algorithms and then approach the problem under different angles. Firstly, we take the problem from the ring $\\displaystyle\\left(\\mathbb{Z}, \\text{+},"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07055","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/2507.07055/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:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2e4chsIT+oHxp+uAfYYbB1fs2kkGHGC+wGepF/oJXwxW6iIH87uO36e60SnmX2fNgM947Ms+KO7HNUfDqaoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:39:24.150890Z"},"content_sha256":"6fe78c3de40e8f7b859daa952a9b5dfdc44e9c03f4ebd6e64d6bbd3f05a66fc1","schema_version":"1.0","event_id":"sha256:6fe78c3de40e8f7b859daa952a9b5dfdc44e9c03f4ebd6e64d6bbd3f05a66fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/bundle.json","state_url":"https://pith.science/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/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-11T09:39:24Z","links":{"resolver":"https://pith.science/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ","bundle":"https://pith.science/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/bundle.json","state":"https://pith.science/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7KCFVMXA6H6QLOI7WT4GB7DQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M7KCFVMXA6H6QLOI7WT4GB7DQJ","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":"21131b40ea2277fc7ee0047d7dda91403171e2a306bb8008c3ff9ae4409281ed","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-07-09T17:20:49Z","title_canon_sha256":"46b8a054f623fe9aaf857e80a3180be5bd4d3d258467d96e1f071c008d2e63a4"},"schema_version":"1.0","source":{"id":"2507.07055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07055","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07055v1","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07055","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"M7KCFVMXA6H6","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_16","alias_value":"M7KCFVMXA6H6QLOI","created_at":"2026-07-05T11:34:28Z"},{"alias_kind":"pith_short_8","alias_value":"M7KCFVMX","created_at":"2026-07-05T11:34:28Z"}],"graph_snapshots":[{"event_id":"sha256:6fe78c3de40e8f7b859daa952a9b5dfdc44e9c03f4ebd6e64d6bbd3f05a66fc1","target":"graph","created_at":"2026-07-05T11:34:28Z","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/2507.07055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods like the General Number Field Sieve, no known algorithm can break the problem in polynomial time, while its proved that Shor's algorithm could on a quantum computer. In this paper, we recall some factorization algorithms and then approach the problem under different angles. Firstly, we take the problem from the ring $\\displaystyle\\left(\\mathbb{Z}, \\text{+},","authors_text":"Gilda Rech Bansimba, Regis Freguin Babindamana","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-07-09T17:20:49Z","title":"Integer Factorization: Another perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07055","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:fa92410843d2fb8c03213410356885cc43fa7a48f98d5405da48eaf70d14df71","target":"record","created_at":"2026-07-05T11:34:28Z","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":"21131b40ea2277fc7ee0047d7dda91403171e2a306bb8008c3ff9ae4409281ed","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-07-09T17:20:49Z","title_canon_sha256":"46b8a054f623fe9aaf857e80a3180be5bd4d3d258467d96e1f071c008d2e63a4"},"schema_version":"1.0","source":{"id":"2507.07055","kind":"arxiv","version":1}},"canonical_sha256":"67d422d597078fe82dc8fda7c307e382417fb969a8819eb271908ff57c375dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67d422d597078fe82dc8fda7c307e382417fb969a8819eb271908ff57c375dc6","first_computed_at":"2026-07-05T11:34:28.357507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:28.357507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkQYX6DntxnGYEAx953MO6w/ZdjWtT+WMeMO0sqZofA6HNbwXiTn20AqwUDNqpGYBJmpScXfAdHFXxS8RUG1Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:28.357998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa92410843d2fb8c03213410356885cc43fa7a48f98d5405da48eaf70d14df71","sha256:6fe78c3de40e8f7b859daa952a9b5dfdc44e9c03f4ebd6e64d6bbd3f05a66fc1"],"state_sha256":"2d4c76eb4453e0bfbeaf592ba9539d30ad5fa8fd50c6264ebeb17c418b686de9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Px3R1I0ryQAIfrKiUWpRBK1hMCCfgnPHLz9OKyY/TfGAkLWLDtvQwyHF8OEOCqCwc47NOmmnNrAEFVBCEAToDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:39:24.202140Z","bundle_sha256":"e0d08f7096d5093be2f54c7230d7b492dab29b688656595d1a09c080f20ab755"}}