{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EM2HF65Z5UMVM2IGYQK4KQMQAV","short_pith_number":"pith:EM2HF65Z","schema_version":"1.0","canonical_sha256":"233472fbb9ed19566906c415c54190057677b2396493381c88c2358c799918b6","source":{"kind":"arxiv","id":"2605.29130","version":1},"attestation_state":"computed","paper":{"title":"Mersenne numbers and the doubling map","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Antonio Garijo, Llu\\'is Alsed\\`a, Xavier Jarque","submitted_at":"2026-05-27T21:43:10Z","abstract_excerpt":"We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$. Determining whether $M(n)$ is prime for a prime $n$ (and knowing if there are infinitely many of them), is a central problem, traditionally addressed with the help of the Lucas-Lehmer test. We provide an alternative approach based on dynamical methods. As an application, we prove that $M(2{,}199{,}023{,}254{,}451)$ (with approximately $6.6 \\times 10^{11}$ digit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.29130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-27T21:43:10Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"f21a830f67732b8785d17586933426fe7f5c51450a59f4318d2c1f6c05b35e62","abstract_canon_sha256":"d0ee930b8a957ef66ac2d3e411a4ee384b3167b3823920722ef5257f4e55b6e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:19.794823Z","signature_b64":"lXpbpddPD30PhQIaFgusW/1ubcAnX/4UL2PDk/TmUOTYVOBIp9nqZgSnfbgk2O1CJXnbJFHSxC2X4ebDw+esAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233472fbb9ed19566906c415c54190057677b2396493381c88c2358c799918b6","last_reissued_at":"2026-05-29T01:05:19.794011Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:19.794011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mersenne numbers and the doubling map","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Antonio Garijo, Llu\\'is Alsed\\`a, Xavier Jarque","submitted_at":"2026-05-27T21:43:10Z","abstract_excerpt":"We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$. Determining whether $M(n)$ is prime for a prime $n$ (and knowing if there are infinitely many of them), is a central problem, traditionally addressed with the help of the Lucas-Lehmer test. We provide an alternative approach based on dynamical methods. As an application, we prove that $M(2{,}199{,}023{,}254{,}451)$ (with approximately $6.6 \\times 10^{11}$ digit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29130","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/2605.29130/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.29130","created_at":"2026-05-29T01:05:19.794139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29130v1","created_at":"2026-05-29T01:05:19.794139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29130","created_at":"2026-05-29T01:05:19.794139+00:00"},{"alias_kind":"pith_short_12","alias_value":"EM2HF65Z5UMV","created_at":"2026-05-29T01:05:19.794139+00:00"},{"alias_kind":"pith_short_16","alias_value":"EM2HF65Z5UMVM2IG","created_at":"2026-05-29T01:05:19.794139+00:00"},{"alias_kind":"pith_short_8","alias_value":"EM2HF65Z","created_at":"2026-05-29T01:05:19.794139+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV","json":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV.json","graph_json":"https://pith.science/api/pith-number/EM2HF65Z5UMVM2IGYQK4KQMQAV/graph.json","events_json":"https://pith.science/api/pith-number/EM2HF65Z5UMVM2IGYQK4KQMQAV/events.json","paper":"https://pith.science/paper/EM2HF65Z"},"agent_actions":{"view_html":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV","download_json":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV.json","view_paper":"https://pith.science/paper/EM2HF65Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29130&json=true","fetch_graph":"https://pith.science/api/pith-number/EM2HF65Z5UMVM2IGYQK4KQMQAV/graph.json","fetch_events":"https://pith.science/api/pith-number/EM2HF65Z5UMVM2IGYQK4KQMQAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV/action/storage_attestation","attest_author":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV/action/author_attestation","sign_citation":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV/action/citation_signature","submit_replication":"https://pith.science/pith/EM2HF65Z5UMVM2IGYQK4KQMQAV/action/replication_record"}},"created_at":"2026-05-29T01:05:19.794139+00:00","updated_at":"2026-05-29T01:05:19.794139+00:00"}