{"_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_b7f0f2b8424570ff773dc8638a09767fd487204559254abd98928a685f05f901","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_b7f0f2b8424570ff773dc8638a09767fd487204559254abd98928a685f05f901","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"0c96f15021c8fe9e5519341c2b11ee8f4fabad3c8c845fba14a63981b0232a1e","published":"Wed, 27 May 2026 00:00:00 -0400","receipt_hash":"0c96f15021c8fe9e5519341c2b11ee8f4fabad3c8c845fba14a63981b0232a1e","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":"0c96f15021c8fe9e5519341c2b11ee8f4fabad3c8c845fba14a63981b0232a1e","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:2604.08999v2 Announce Type: replace-cross \nAbstract: Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering, hindered by challenges such as structural neglect, representation gaps, and reasoning opacity. Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility, while current tree-based approaches suffer from limited semantic adaptability. To address these limitations, we propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR. First, we introduce AdaSTR, which leverages the global semantic awareness of LLMs to reconstruct tables into Logical Semantic Trees. This serialization explicitly models hierarchical dependencies and employs an adaptive mechanism to optimize construction strategies based on table scale. Second, building on this structure, we present DuTR, a dual-mode reasoning framework that integrates tree-search-based tex","title":"ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering","url":"https://arxiv.org/abs/2604.08999","vendor":"arxiv_cs_ai"},"summary":"arXiv:2604.08999v2 Announce Type: replace-cross \nAbstract: Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering, hindered by challenges such as structural neglect, representation gaps, and reasoning opacity. Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility, while current tree-based approaches suffer from limited semantic adaptability. To address these limitations, we propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR. First, we introduce AdaSTR, which leverages the global semantic awareness of LLMs to reconstruct tables into Logical Semantic Trees. This serialization explicitly models hierarchical dependencies and employs an adaptive mechanism to optimize construction strategies based on table scale. Second, building on this structure, we present DuTR, a dual-mode reasoning framework that integrates tree-search-based tex","title":"ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering","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/2604.08999"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:314324e59efbe619691ac6673d78f6e324196004e2dab4e522ff76bf311af36ccd76863d11b528c57eab183cb4b75c8d68e7e0fe527b1e8fb6d0f54a36179e00","signer":"crovia.substrate","subject":{"observed_at":"2026-05-27T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2604.08999"},"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":"6baedadab78aef3037f8ac83cb7281fb9195d37b59ca9debc1c27d150a0d0332","leaf_index":153966,"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":"8503ba69fd4e302619485a6eec1a16eb92c0b2e85ef19a2cc934b8493ea86706","side":"right"},{"sibling":"b29105765117400c4fb68b4957170b04473509ea5e5b3e5f03a6da7005fdabb0","side":"left"},{"sibling":"20755d23aef9c4902fe9b9be1b76f905281c85fad5896bf09a74e57020982890","side":"left"},{"sibling":"235fe264be7453c1e681d423b07ba98d81ee38969dcbf308fe266852fe94a140","side":"left"},{"sibling":"7bc70ee4d1f433970b268debde724983c41ff622eb7920b83212db6338efc8c1","side":"right"},{"sibling":"aa4dec90fd438277dd786812d9183b8c99388113e7334dd7376266c127e35403","side":"left"},{"sibling":"bc35d95b20384bcefab067b00429ecc07965f080c071ee591082cba7c0f219a2","side":"left"},{"sibling":"16c794666e8ffc4b9e71a0bacc0e4f9bbc68a8544c340b385c6d1abff1d748e5","side":"right"},{"sibling":"c14a4eb4b07d22a6a83f548cf6c304559dc63f0e53071e550ecc566dbba50b14","side":"left"},{"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_b7f0f2b8424570ff773dc8638a09767fd487204559254abd98928a685f05f901"}}