{"_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_c8d37db355ec0039c1b9fe2ae668845c87a4901333a11e6fbc43a6806ccf1e72","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_c8d37db355ec0039c1b9fe2ae668845c87a4901333a11e6fbc43a6806ccf1e72","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"e88fe0343023fb1ce01e992e6871cc8cf75c11b34074d895bc034f202f22b4fc","published":"Wed, 27 May 2026 00:00:00 -0400","receipt_hash":"e88fe0343023fb1ce01e992e6871cc8cf75c11b34074d895bc034f202f22b4fc","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":"e88fe0343023fb1ce01e992e6871cc8cf75c11b34074d895bc034f202f22b4fc","observed_at":"2026-05-27T04:43:18.926230Z","parent_run_hash":"6f581915edab4326e2b95fed7c82c2ee149e978d6d7c2443439442a927c31dfa","published":"Wed, 27 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.20690v2 Announce Type: replace \nAbstract: Agentic discovery has shown that LLM-driven search can find novel algorithms, designs, and code under benchmark conditions. Translating the paradigm to multi-system data backends surfaces a harder problem: the search space is heterogeneous, the verifier is whether a deployed stack actually runs, and composition knowledge is unevenly captured in pretraining. Unbounded agentic discovery, a coding agent iterating on failure-log feedback, fails to converge consistently on a working stack even when iteration and explicit composition knowledge are added. We propose Declarative Data Services (DDS), an architecture for structured agentic discovery of data-system compositions from declarative user intent. The framework owns four typed contracts at successive layers (intent, operator DAG, per-system skills, runtime attribution) that decompose the global search into bounded sub-searches; sub-agents search each typed space, while the framework p","title":"Declarative Data Services: Structured Agentic Discovery for Composing Data Systems","url":"https://arxiv.org/abs/2605.20690","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.20690v2 Announce Type: replace \nAbstract: Agentic discovery has shown that LLM-driven search can find novel algorithms, designs, and code under benchmark conditions. Translating the paradigm to multi-system data backends surfaces a harder problem: the search space is heterogeneous, the verifier is whether a deployed stack actually runs, and composition knowledge is unevenly captured in pretraining. Unbounded agentic discovery, a coding agent iterating on failure-log feedback, fails to converge consistently on a working stack even when iteration and explicit composition knowledge are added. We propose Declarative Data Services (DDS), an architecture for structured agentic discovery of data-system compositions from declarative user intent. The framework owns four typed contracts at successive layers (intent, operator DAG, per-system skills, runtime attribution) that decompose the global search into bounded sub-searches; sub-agents search each typed space, while the framework p","title":"Declarative Data Services: Structured Agentic Discovery for Composing Data Systems","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-27T04:43:18Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.20690"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:7b860f1816152269bb1f19c81c56f87971054afd6badb25b2f6c35f20f66edabc15dc95d5c974c0076ac4e9d3019db7ef5501ae518dd2448bebcfe2c6f07f209","signer":"crovia.substrate","subject":{"observed_at":"2026-05-27T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.20690"},"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":"016a14d25124f9526ef1f55ed6cc30d067579e0cf3bc464a85c065cbf25794e7","leaf_index":153853,"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":"2e67d41d075887889bb38530d2716cea7243de414067a1c3a2c18071b94ce030","side":"left"},{"sibling":"1328fc7c0e51200b40a7a9b94206c7940ca0f9574d2910210f714615696e1713","side":"right"},{"sibling":"0a60b432fc2f3475f2f63a9ab7a6ae93411dd34e8e221eef0e766c9a35b7d435","side":"left"},{"sibling":"c8aa64c8cf8540e6a60216b9b4638b2e5052441ccb572acc0e0992a87eaa813f","side":"left"},{"sibling":"7d5768ccf80b7889d88e07d1ed3f62aac8376ea7dc639a5ee77d4a357ac30320","side":"left"},{"sibling":"3cced4ec86de2a838f3fc9b99ffdf60576ecccfa8bdd6534a0279e9452a4356f","side":"left"},{"sibling":"26b17ab381ecd45e6cdb3b0addf7b75f3dfb0fc0b1c9161c6cec819853787697","side":"left"},{"sibling":"dd15059d2d503b45e928c26e84bea4e5b2d187abeace390e61efd18d39e80f21","side":"left"},{"sibling":"c56e46802f42ead6bcf79619c80428b6dc22e9afc9611a87f0d04a5ef9acadd7","side":"right"},{"sibling":"3165125427a29042fc9d02858a59a68858dbdcb2e19d1afa5f6dd6a95cfbce6a","side":"right"},{"sibling":"04b9a68b8ec6fa37251564383c685c23ce69e5e031df4eae69f79a3a334b68bf","side":"right"},{"sibling":"816f233274bb10f5a122aac086a0c8c697b78fec67a4af55190bb596b7506fab","side":"left"},{"sibling":"d415e6939aee710631f5062799379b547d2c3e3d9a68f263bbb5a693285ab2ca","side":"left"},{"sibling":"374c02d15fb12bd356c179c94766043a982052c6132af8bfc15361b431ffa9f7","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"990705096edf483cc877217308f731dc42d6f6d99f82880167bbdbbfef32560a","side":"right"},{"sibling":"dd265753d95fa2e2fb4f5768e37fab6f691ccff09ad60d0910ff7dc23bac9226","side":"right"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"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":154065,"merkle_root":"4993cfdc172e7880b60667f16789dc2e831ff000f81bb1ecba248e73f1510eca","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260527T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-27T05:37:36Z","sig_algorithm":"ed25519","signature":"76ecf118011540405e96506e6219752df04a2850632f2903dc6f10e08b98bc5a42c8d9e1cb5b7c5bf714479806a403df5f34399afa40c23fbb71493a1f77bd0c","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_c8d37db355ec0039c1b9fe2ae668845c87a4901333a11e6fbc43a6806ccf1e72"}}