{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A6CSARVHR73X6PMQCCLI6CD2BF","short_pith_number":"pith:A6CSARVH","canonical_record":{"source":{"id":"2604.08999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-10T06:09:41Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc283860e38d34eb43e95997bec391971e4cf53f346cef4bd5ecee0e9dad7986","abstract_canon_sha256":"d17bc272a26a9500cc7644272c5c1ae3286713a8e64ed2905479b4e31876d9ce"},"schema_version":"1.0"},"canonical_sha256":"07852046a78ff77f3d9010968f087a095e3256994197d497b00295ec12e220fe","source":{"kind":"arxiv","id":"2604.08999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08999","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08999v2","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08999","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6CSARVHR73X","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"A6CSARVHR73X6PMQ","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"A6CSARVH","created_at":"2026-05-27T01:05:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A6CSARVHR73X6PMQCCLI6CD2BF","target":"record","payload":{"canonical_record":{"source":{"id":"2604.08999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-10T06:09:41Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc283860e38d34eb43e95997bec391971e4cf53f346cef4bd5ecee0e9dad7986","abstract_canon_sha256":"d17bc272a26a9500cc7644272c5c1ae3286713a8e64ed2905479b4e31876d9ce"},"schema_version":"1.0"},"canonical_sha256":"07852046a78ff77f3d9010968f087a095e3256994197d497b00295ec12e220fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:54.052669Z","signature_b64":"H1AbogA5+h9peuDJohjIdqJw5BhO8M+F4iBA7WOf0079VRw8swn5PzmQ4axPe+RUQMfxIlZF1vzFYxYf2DPRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07852046a78ff77f3d9010968f087a095e3256994197d497b00295ec12e220fe","last_reissued_at":"2026-05-27T01:05:54.051611Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:54.051611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.08999","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECeApWT17fprbXzuyZLR3xl2NYvjEq9KyRpIgD/4eikQ3EWCPhsbqcuE//CF05k5o+DtUifrN1ySnkzTrrPqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:27:57.599092Z"},"content_sha256":"b0bc1b2b2e88eff50321dad4d9541857f5365ed3d714d36a487c4f70ccb169b4","schema_version":"1.0","event_id":"sha256:b0bc1b2b2e88eff50321dad4d9541857f5365ed3d714d36a487c4f70ccb169b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A6CSARVHR73X6PMQCCLI6CD2BF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Huajun Chen, Songze Li, Wen Zhang, Xiaoke Guo, Yuanxiang Liu, Zhaoyan Gong, Zhiqiang Liu","submitted_at":"2026-04-10T06:09:41Z","abstract_excerpt":"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 aware"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That LLMs can reliably reconstruct tables into Logical Semantic Trees that capture all relevant hierarchical dependencies without introducing errors, and that the dual-mode reasoning will produce verifiable gains over single-mode baselines.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ASTRA builds adaptive semantic trees from tables and uses dual textual-symbolic reasoning to achieve SOTA performance on complex table question answering.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3da167bd501d798e83951f87abbfd9a803d5f155d954d1886da037c97da845a6"},"source":{"id":"2604.08999","kind":"arxiv","version":2},"verdict":{"id":"d4cdf95f-ea93-4190-a2fe-7341c05c73da","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:42:17.696965Z","strongest_claim":"Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.","one_line_summary":"ASTRA builds adaptive semantic trees from tables and uses dual textual-symbolic reasoning to achieve SOTA performance on complex table question answering.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That LLMs can reliably reconstruct tables into Logical Semantic Trees that capture all relevant hierarchical dependencies without introducing errors, and that the dual-mode reasoning will produce verifiable gains over single-mode baselines.","pith_extraction_headline":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08999/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"85d189cda8129219a9e4c7a55a85d356273839630fbf8278972b574a031213af"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d4cdf95f-ea93-4190-a2fe-7341c05c73da"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwZJ1pSMkSMBRxmrB9LnhpyXCL36KaAsecgtAiZxVtQleQmX29dtkKSJIBRWYJBwV31BtxM0n8SomJwwF6ddAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:27:57.600137Z"},"content_sha256":"d591ba24595e746045c14f883463fc0082118c895aafd0256bfde1e0844f3773","schema_version":"1.0","event_id":"sha256:d591ba24595e746045c14f883463fc0082118c895aafd0256bfde1e0844f3773"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6CSARVHR73X6PMQCCLI6CD2BF/bundle.json","state_url":"https://pith.science/pith/A6CSARVHR73X6PMQCCLI6CD2BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6CSARVHR73X6PMQCCLI6CD2BF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T09:27:57Z","links":{"resolver":"https://pith.science/pith/A6CSARVHR73X6PMQCCLI6CD2BF","bundle":"https://pith.science/pith/A6CSARVHR73X6PMQCCLI6CD2BF/bundle.json","state":"https://pith.science/pith/A6CSARVHR73X6PMQCCLI6CD2BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6CSARVHR73X6PMQCCLI6CD2BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A6CSARVHR73X6PMQCCLI6CD2BF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d17bc272a26a9500cc7644272c5c1ae3286713a8e64ed2905479b4e31876d9ce","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-10T06:09:41Z","title_canon_sha256":"dc283860e38d34eb43e95997bec391971e4cf53f346cef4bd5ecee0e9dad7986"},"schema_version":"1.0","source":{"id":"2604.08999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08999","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08999v2","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08999","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6CSARVHR73X","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"A6CSARVHR73X6PMQ","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"A6CSARVH","created_at":"2026-05-27T01:05:54Z"}],"graph_snapshots":[{"event_id":"sha256:d591ba24595e746045c14f883463fc0082118c895aafd0256bfde1e0844f3773","target":"graph","created_at":"2026-05-27T01:05:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That LLMs can reliably reconstruct tables into Logical Semantic Trees that capture all relevant hierarchical dependencies without introducing errors, and that the dual-mode reasoning will produce verifiable gains over single-mode baselines."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ASTRA builds adaptive semantic trees from tables and uses dual textual-symbolic reasoning to achieve SOTA performance on complex table question answering."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering."}],"snapshot_sha256":"3da167bd501d798e83951f87abbfd9a803d5f155d954d1886da037c97da845a6"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"85d189cda8129219a9e4c7a55a85d356273839630fbf8278972b574a031213af"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.08999/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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 aware","authors_text":"Huajun Chen, Songze Li, Wen Zhang, Xiaoke Guo, Yuanxiang Liu, Zhaoyan Gong, Zhiqiang Liu","cross_cats":["cs.AI","cs.LG"],"headline":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-10T06:09:41Z","title":"ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.08999","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T17:42:17.696965Z","id":"d4cdf95f-ea93-4190-a2fe-7341c05c73da","model_set":{"reader":"grok-4.3"},"one_line_summary":"ASTRA builds adaptive semantic trees from tables and uses dual textual-symbolic reasoning to achieve SOTA performance on complex table question answering.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reconstructing tables as adaptive logical semantic trees lets LLMs reach state-of-the-art accuracy on complex question answering.","strongest_claim":"Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.","weakest_assumption":"That LLMs can reliably reconstruct tables into Logical Semantic Trees that capture all relevant hierarchical dependencies without introducing errors, and that the dual-mode reasoning will produce verifiable gains over single-mode baselines."}},"verdict_id":"d4cdf95f-ea93-4190-a2fe-7341c05c73da"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0bc1b2b2e88eff50321dad4d9541857f5365ed3d714d36a487c4f70ccb169b4","target":"record","created_at":"2026-05-27T01:05:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d17bc272a26a9500cc7644272c5c1ae3286713a8e64ed2905479b4e31876d9ce","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-10T06:09:41Z","title_canon_sha256":"dc283860e38d34eb43e95997bec391971e4cf53f346cef4bd5ecee0e9dad7986"},"schema_version":"1.0","source":{"id":"2604.08999","kind":"arxiv","version":2}},"canonical_sha256":"07852046a78ff77f3d9010968f087a095e3256994197d497b00295ec12e220fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07852046a78ff77f3d9010968f087a095e3256994197d497b00295ec12e220fe","first_computed_at":"2026-05-27T01:05:54.051611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:54.051611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H1AbogA5+h9peuDJohjIdqJw5BhO8M+F4iBA7WOf0079VRw8swn5PzmQ4axPe+RUQMfxIlZF1vzFYxYf2DPRCw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:54.052669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.08999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0bc1b2b2e88eff50321dad4d9541857f5365ed3d714d36a487c4f70ccb169b4","sha256:d591ba24595e746045c14f883463fc0082118c895aafd0256bfde1e0844f3773"],"state_sha256":"19cfbcb0f268306cb061e459fd51d054c47fd200aea87b20c7b57bab85afe3f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVGdRP6BAL/JJOhnlMDfupPbOfZfXnixS0ZQGiYHlz8JQ8+cN37v4PObCGCDuCTp2SOq0hvhdjVGu/bcjqK8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:27:57.604972Z","bundle_sha256":"a8211ff0fc1a918c16ca75be3682226b12c4be634918a04430bfded8565e395f"}}