{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_d2bbc4bf31eb9cd6f9554ae553de742b0e02ab3f6349393bfc55c12ebc1cc1a5","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_d2bbc4bf31eb9cd6f9554ae553de742b0e02ab3f6349393bfc55c12ebc1cc1a5","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"741609ea76603f1e2269f3a235d4aeb871af5b3fdb2b7a32112acb35e2c0400e","published":"Tue, 12 May 2026 00:00:00 -0400","receipt_hash":"741609ea76603f1e2269f3a235d4aeb871af5b3fdb2b7a32112acb35e2c0400e","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"741609ea76603f1e2269f3a235d4aeb871af5b3fdb2b7a32112acb35e2c0400e","observed_at":"2026-05-12T04:43:42.564879Z","parent_run_hash":"4cc5aca0c1b8116c9ab92405e0260204f01cf7ce2e49dea9d7e123236f5dc13b","published":"Tue, 12 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2504.19451v3 Announce Type: cross \nAbstract: This paper presents two concrete applications of Artificial Intelligence to algorithmic and analytic number theory.\n  Recent benchmarks of large language models have mainly focused on general mathematics problems and the currently infeasible objective of automated theorem proving. In the first part of this paper, we relax our ambition and focus on a more specialized domain: we evaluate the performance of the state-of-the-art open-source large language model Qwen2.5-Math-7B-Instruct on algorithmic and computational tasks in algorithmic number theory. On a benchmark of thirty algorithmic problems and thirty computational questions taken from classical number-theoretic textbooks and Math StackExchange, the model achieves at least 0.95 accuracy (relative to the true answer) on every problem or question when given an optimal non-spoiling hint.\n  The second part of the paper empirically verifies a folklore conjecture in analytic number theor","title":"Artificial Intelligence in Number Theory: LLMs for Algorithm Generation and Ensemble Methods for Conjecture Verification","url":"https://arxiv.org/abs/2504.19451","vendor":"arxiv_cs_ai"},"summary":"arXiv:2504.19451v3 Announce Type: cross \nAbstract: This paper presents two concrete applications of Artificial Intelligence to algorithmic and analytic number theory.\n  Recent benchmarks of large language models have mainly focused on general mathematics problems and the currently infeasible objective of automated theorem proving. In the first part of this paper, we relax our ambition and focus on a more specialized domain: we evaluate the performance of the state-of-the-art open-source large language model Qwen2.5-Math-7B-Instruct on algorithmic and computational tasks in algorithmic number theory. On a benchmark of thirty algorithmic problems and thirty computational questions taken from classical number-theoretic textbooks and Math StackExchange, the model achieves at least 0.95 accuracy (relative to the true answer) on every problem or question when given an optimal non-spoiling hint.\n  The second part of the paper empirically verifies a folklore conjecture in analytic number theor","title":"Artificial Intelligence in Number Theory: LLMs for Algorithm Generation and Ensemble Methods for Conjecture Verification","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-12T04:43:42Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2504.19451"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:684ed61dd82b60d7c689f120319af844453d1e7e122ef4d320167d8234826ec2914e225bf191789cec46e731c0c233546270df802a1fffbf211ede521be49400","signer":"crovia.substrate","subject":{"observed_at":"2026-05-12T04:43:42Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2504.19451"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"bee5430eafc71ff00a2e6d74c1795493286db8e83a8257ae93fa67797af00d8a","leaf_index":128449,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"a011b778d96e20100f82981251d456b0964f3cb0febf882e6aa82d301be71bb6","side":"left"},{"sibling":"8d7c9189f5a87af1bbe1cb299e80be79c26fe62069dad08b9a82a6426d1261ff","side":"right"},{"sibling":"003ffafcc619f33cc4c4b3cf65efb047b4f64ce1d5ab7c5e5537af2a79b9480e","side":"right"},{"sibling":"9a974726d48bf9e40d74955a5dae26b0756ddf22dae6f0462592915870325d3a","side":"right"},{"sibling":"0ef4692e6c5429c9870b5aa075883dc4357d7bbb9e28ccd8ffe6fa1d39e1e149","side":"right"},{"sibling":"584f7351ea8abce1efad8787266629d24824a20b95d0b0d8ae4a978c78e050b3","side":"right"},{"sibling":"80a5f0118f1cab257d86ade2f02746f5ce1158951c70a9e1f7025391472dc0ef","side":"left"},{"sibling":"0fac4565968e7e49cfc1d10e28cfc4966c72b4dd0deb14bce20d28acb7a0d65a","side":"left"},{"sibling":"aa3ddc60ad25fcdd4bf93520d8baeca26d807789d80fb0deffbb19c4f8882286","side":"left"},{"sibling":"077005bbaed7b42537914de0b512ed52d33243215eab288181aba807d37bf04e","side":"right"},{"sibling":"c6eaf7a4fcab2db96e9e9423acb6922c80f64882d0f3f50d09e53a4807d23084","side":"left"},{"sibling":"df12eaabc0a370aff5d0488478f48d2b3f90d025c903643f98ea804b017688ec","side":"right"},{"sibling":"ffc4d51379293bc3e1910c7d612f409dc610fd9acf8241793fb89f82e1bad4ef","side":"left"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_d2bbc4bf31eb9cd6f9554ae553de742b0e02ab3f6349393bfc55c12ebc1cc1a5"}}