{"_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_558d2ebe01c454d677f111ac5d5d4daac14fd9ecd9004b6769694cdaf38c62c1","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_558d2ebe01c454d677f111ac5d5d4daac14fd9ecd9004b6769694cdaf38c62c1","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"5e0f9ceb27d48c1cf7caa58468db71b202b137d97811d9df3db4cb3e0327a54f","published":"Wed, 15 Jul 2026 00:00:00 -0400","receipt_hash":"5e0f9ceb27d48c1cf7caa58468db71b202b137d97811d9df3db4cb3e0327a54f","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":"5e0f9ceb27d48c1cf7caa58468db71b202b137d97811d9df3db4cb3e0327a54f","observed_at":"2026-07-15T04:44:03.592429Z","parent_run_hash":"d49a6cf532e74153266f377b7760fc948d950d80ed41fc3e3eb82b58f5597ead","published":"Wed, 15 Jul 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:2607.11464v1 Announce Type: cross \nAbstract: Retrieval-Augmented Generation (RAG) addresses the limitations of Large Language Models (LLMs) when providing responses to domain-specific questions. Graph-based RAG approaches, such as GraphRAG, enhance retrieval by capturing semantic relationships within knowledge graphs (KGs). While the FAIR principles (Findability, Accessibility, Interoperability, and Reusability) are becoming prevalent for scientific data management, especially in complex domains such as medicine, existing RAG approaches lack a structured FAIRification of the underlying knowledge resources. This lack limits their potential for FAIR information retrieval in these domains. To address this gap, we introduce FAIR GraphRAG, a novel framework that integrates FAIR Digital Objects (FDOs) as the fundamental units of a graph-based retrieval system. Each graph node represents an FDO that incorporates core data, metadata, persistent identifiers, and semantic links. We leverag","title":"FAIR GraphRAG: A Retrieval-Augmented Generation Approach for Semantic Data Analysis","url":"https://arxiv.org/abs/2607.11464","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.11464v1 Announce Type: cross \nAbstract: Retrieval-Augmented Generation (RAG) addresses the limitations of Large Language Models (LLMs) when providing responses to domain-specific questions. Graph-based RAG approaches, such as GraphRAG, enhance retrieval by capturing semantic relationships within knowledge graphs (KGs). While the FAIR principles (Findability, Accessibility, Interoperability, and Reusability) are becoming prevalent for scientific data management, especially in complex domains such as medicine, existing RAG approaches lack a structured FAIRification of the underlying knowledge resources. This lack limits their potential for FAIR information retrieval in these domains. To address this gap, we introduce FAIR GraphRAG, a novel framework that integrates FAIR Digital Objects (FDOs) as the fundamental units of a graph-based retrieval system. Each graph node represents an FDO that incorporates core data, metadata, persistent identifiers, and semantic links. We leverag","title":"FAIR GraphRAG: A Retrieval-Augmented Generation Approach for Semantic Data Analysis","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-15T04:44:03Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.11464"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:785d8d0b9cb68e877320a085e3a95ea891e94141e0724acc96c0c7b12444f80687d500da4d2e3efda9d98d957a7c228ed102e7eac294348ec2c40efcc5696602","signer":"crovia.substrate","subject":{"observed_at":"2026-07-15T04:44:03Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.11464"},"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":"6d848dd506e462d241a175f8ece7cda15fdaced1ac53b70e3fdd088c9f46ae7c","leaf_index":316410,"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":"38e9b8593d0f403c5a412e8c36296cab925475ba87e8057ca4d1424ba96504c4","side":"right"},{"sibling":"3f5f0ddf6c6b2096edfda9f2ec4f13109cfeeb1ad8940358f0336eca91e7d064","side":"left"},{"sibling":"a1edfb036901c49a8f968234dfc83d600e2ee8eee7ab706ee53e04fe1b440290","side":"right"},{"sibling":"53d9c125f83fe105efa6c06e928cbe7273f7448ed806d0b43194374dcb9fdbe3","side":"left"},{"sibling":"5dfcfe37f96b72385191f5a2e5b281e2041f06c9993d1abc725ad4f55bb259c1","side":"left"},{"sibling":"b922a2728fd9d538aa8b17f643ec62d6ceefaa53e320aeeedde1104caba3409d","side":"left"},{"sibling":"8dc6b151fc86f1b43f490c2263dd78189a9778cebe1755f2bcd01eb2c6239831","side":"left"},{"sibling":"9a178a31a5d97bdb1bf054b31ec2fcc6cf9b633c6d3f460e934451a35bac9c25","side":"left"},{"sibling":"31b0ff6eae164fcff8882af2b581471a08fffa2373505e1f33f01e361c94a42f","side":"left"},{"sibling":"e1ebad13fafe4a9a53c35e1f19fa67a19c940f70a4211d1fab42cf49be486a3c","side":"left"},{"sibling":"c265283bb70fb86740bdfa059cfe36cfea4a5f903b841822b2954814237de972","side":"right"},{"sibling":"0cb62c0ada57a2406a6bcb100889d3e8b29a15efeed07adaff5bb90a5e80612a","side":"right"},{"sibling":"0b69289b25462ddd6166f6f49004cfc8ada0ab4f10adafe188347817bdd46e37","side":"left"},{"sibling":"1418b281cd985b5ed411ef25f2017a1826cc14919b6fad3934e6ceeec693699b","side":"right"},{"sibling":"f302542c38ba7c3aab7c9280dd60259ecec777dca6e6f71b6f0729b0b8791b72","side":"left"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"abe4a8c706e530484d1e96a8988cb09eab85928b2050985500ab289753fe3eec","side":"right"},{"sibling":"f436dccf82aa2c1eb7bfa3eb84316e116aaf64dc55cd9592597118f6cb0648f6","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","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":316730,"merkle_root":"a8e6e5be81ea6f5b5f2227422459bf39455fe9f0b6602b4d1ce6977dbfd78bc7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260715T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-15T05:38:24Z","sig_algorithm":"ed25519","signature":"df1678d268b5a07413e2ca6e748c3f40b6cfedea930a18d843489a4ab513da791bf0a886caab1b918d0989f8ebaaf3d0035ca2aa777913b1ad29979f1deb9a0c","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_558d2ebe01c454d677f111ac5d5d4daac14fd9ecd9004b6769694cdaf38c62c1"}}