{"_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_e0ad37a088b367e6c4c1e45fc34b0547831cd331605aa38228d5e8dba8db46b6","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_e0ad37a088b367e6c4c1e45fc34b0547831cd331605aa38228d5e8dba8db46b6","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"5a3d0a87c39b0935a77822193ecd007d5c279a76058a25319ebb834633ed5225","published":"Mon, 11 May 2026 00:00:00 -0400","receipt_hash":"5a3d0a87c39b0935a77822193ecd007d5c279a76058a25319ebb834633ed5225","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":"5a3d0a87c39b0935a77822193ecd007d5c279a76058a25319ebb834633ed5225","observed_at":"2026-05-11T04:43:50.688999Z","parent_run_hash":"8244cc3d66edb4604be5ded19e92c0b47893b228a258432a9c53a5796a870982","published":"Mon, 11 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:2605.05949v2 Announce Type: replace \nAbstract: Algorithmic problem solving serves as a rigorous testbed for evaluating structured reasoning in AI coding systems, as it directly reflects a model's ability to perform structured reasoning in complex scenarios. Existing approaches predominantly rely on model-centric strategies, such as architectural modifications and data scaling, which are costly and offer limited interpretability. Alternative methods leveraging external tools or prompting techniques (e.g., chain-of-thought) are often fragmented and lack a unified framework. In this paper, we propose MAS-Algorithm, a systematic multi-agent workflow for algorithmic problem solving inspired by the practices of competitive programmers and algorithm engineers. Our framework decomposes the end-to-end solving process into modular stages, enabling structured reasoning, tool integration, and flexible coordination among agents. The design emphasizes both rigor and extensibility, allowing it ","title":"MAS-Algorithm: A Workflow for Solving Algorithmic Programming Problems with a Multi-Agent System","url":"https://arxiv.org/abs/2605.05949","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.05949v2 Announce Type: replace \nAbstract: Algorithmic problem solving serves as a rigorous testbed for evaluating structured reasoning in AI coding systems, as it directly reflects a model's ability to perform structured reasoning in complex scenarios. Existing approaches predominantly rely on model-centric strategies, such as architectural modifications and data scaling, which are costly and offer limited interpretability. Alternative methods leveraging external tools or prompting techniques (e.g., chain-of-thought) are often fragmented and lack a unified framework. In this paper, we propose MAS-Algorithm, a systematic multi-agent workflow for algorithmic problem solving inspired by the practices of competitive programmers and algorithm engineers. Our framework decomposes the end-to-end solving process into modular stages, enabling structured reasoning, tool integration, and flexible coordination among agents. The design emphasizes both rigor and extensibility, allowing it ","title":"MAS-Algorithm: A Workflow for Solving Algorithmic Programming Problems with a Multi-Agent System","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-11T04:43:50Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.05949"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:da28a45df7483048d7c345707e118379fdd9ef5678775638d1e0cd8f28aad8e7573d4387532e0709be2ba47c436361f52ed383a84f6fd9016c06f7c816963508","signer":"crovia.substrate","subject":{"observed_at":"2026-05-11T04:43:50Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.05949"},"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":"fa9239f1d3c7789dd07e3eb1dd8c5ba1340543b9cbbb796eaf474ad1cf0b039d","leaf_index":126603,"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":"fe7de7903f5eb9d7202e15f1c750374829fa8de72530486158bf282d05ee40bb","side":"left"},{"sibling":"85652729e1f3a2b9590a58358b83b24e0e0155799d19155950c4e45f7a73af53","side":"left"},{"sibling":"2b70b8e0887e4ea5ba59283a7c174a91140eabd72b0fa1db5425af68709d7cb6","side":"right"},{"sibling":"2d0f7b40138e3d267a34affd3e82618837ceabe835a7bef38d93ba4eb7cdef32","side":"left"},{"sibling":"a1cfeaf0153310975ad2a12904e706f1266d2e4fc5bb655868b4c929813dd895","side":"right"},{"sibling":"6c9e8c5a1e345bc6b3af276de43297191dcb4d602c6f58aca9836ebca554c2db","side":"right"},{"sibling":"54aeb1b325b6ed32e0e93fc93a91c18b716eb6c01be8986d8e913f5ba02e2683","side":"right"},{"sibling":"8145236c073312ace1276c28162c95dcc0d2fd49b8c636293fac87efad823f12","side":"left"},{"sibling":"62d48549e4d4466089a57a96bd9bea15741d62a7cb314f0f9c37c4c22ac650fa","side":"right"},{"sibling":"a2c696699a233359c7b4b418ebd356db453d4b886f4bd076ef34b15ee86144a3","side":"left"},{"sibling":"1a581be91236d1f25e8d47fe5efa0e2b51b7f0f6d706ef76a9093067688e5d56","side":"left"},{"sibling":"878cc30108509c9fa1fc52705a216f519d73b647916fcbdfc30a389934d3364b","side":"left"},{"sibling":"ae7dfff36ba07d9f48c36c28a341482ef244ee13cd0efd49aee2bbef2fd65f87","side":"right"},{"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_e0ad37a088b367e6c4c1e45fc34b0547831cd331605aa38228d5e8dba8db46b6"}}