{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NIHJXW5QTTC6VGU3GZBPNB4RUP","short_pith_number":"pith:NIHJXW5Q","schema_version":"1.0","canonical_sha256":"6a0e9bdbb09cc5ea9a9b3642f68791a3cbc6f7304168397811a4d361d69c0c0d","source":{"kind":"arxiv","id":"2601.03851","version":2},"attestation_state":"computed","paper":{"title":"Rethinking Table Pruning in TableQA: From Sequential Revisions to Gold Trajectory-Supervised Parallel Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dong Jin, Huasen He, Jian Yang, Qirui Bai, Shenghao Ye, Shuangwu Chen, Tao Zhang, Xiaobin Tan, Yu Guo, Yunpeng Hou, Zijian Wen","submitted_at":"2026-01-07T12:08:59Z","abstract_excerpt":"Table Question Answering (TableQA) benefits significantly from table pruning, which extracts compact sub-tables by eliminating redundant cells to streamline downstream reasoning. However, existing pruning methods typically rely on sequential revisions driven by unreliable critique signals, often failing to detect the loss of answer-critical data. To address this limitation, we propose TabTrim, a novel table pruning framework which transforms table pruning from sequential revisions to gold trajectory-supervised parallel search. TabTrim derives a gold pruning trajectory using the intermediate su"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2601.03851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-07T12:08:59Z","cross_cats_sorted":[],"title_canon_sha256":"e5a9eb75069a07e61c5758936fab8c8005b1ab4ac35ec7da61a7808a38c86ab8","abstract_canon_sha256":"ad2ad223fc8f8d17664c09234b5bfad3284196a2027eae8719df2a98bb4ba413"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:40.141862Z","signature_b64":"m1dm3XnDergMrU0PZWqr1gHFOb+AL/BeivhFkRiI/oCkq/JaK/PZIG6ikCS+2Y9bksKsN4yiVzH9lGBv7loFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a0e9bdbb09cc5ea9a9b3642f68791a3cbc6f7304168397811a4d361d69c0c0d","last_reissued_at":"2026-05-20T00:05:40.140723Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:40.140723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Table Pruning in TableQA: From Sequential Revisions to Gold Trajectory-Supervised Parallel Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dong Jin, Huasen He, Jian Yang, Qirui Bai, Shenghao Ye, Shuangwu Chen, Tao Zhang, Xiaobin Tan, Yu Guo, Yunpeng Hou, Zijian Wen","submitted_at":"2026-01-07T12:08:59Z","abstract_excerpt":"Table Question Answering (TableQA) benefits significantly from table pruning, which extracts compact sub-tables by eliminating redundant cells to streamline downstream reasoning. However, existing pruning methods typically rely on sequential revisions driven by unreliable critique signals, often failing to detect the loss of answer-critical data. To address this limitation, we propose TabTrim, a novel table pruning framework which transforms table pruning from sequential revisions to gold trajectory-supervised parallel search. TabTrim derives a gold pruning trajectory using the intermediate su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.03851","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.03851/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":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.03851","created_at":"2026-05-20T00:05:40.140850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.03851v2","created_at":"2026-05-20T00:05:40.140850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03851","created_at":"2026-05-20T00:05:40.140850+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIHJXW5QTTC6","created_at":"2026-05-20T00:05:40.140850+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIHJXW5QTTC6VGU3","created_at":"2026-05-20T00:05:40.140850+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIHJXW5Q","created_at":"2026-05-20T00:05:40.140850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14465","citing_title":"From Table to Cell: Attention for Better Reasoning with TABALIGN","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP","json":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP.json","graph_json":"https://pith.science/api/pith-number/NIHJXW5QTTC6VGU3GZBPNB4RUP/graph.json","events_json":"https://pith.science/api/pith-number/NIHJXW5QTTC6VGU3GZBPNB4RUP/events.json","paper":"https://pith.science/paper/NIHJXW5Q"},"agent_actions":{"view_html":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP","download_json":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP.json","view_paper":"https://pith.science/paper/NIHJXW5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.03851&json=true","fetch_graph":"https://pith.science/api/pith-number/NIHJXW5QTTC6VGU3GZBPNB4RUP/graph.json","fetch_events":"https://pith.science/api/pith-number/NIHJXW5QTTC6VGU3GZBPNB4RUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP/action/storage_attestation","attest_author":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP/action/author_attestation","sign_citation":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP/action/citation_signature","submit_replication":"https://pith.science/pith/NIHJXW5QTTC6VGU3GZBPNB4RUP/action/replication_record"}},"created_at":"2026-05-20T00:05:40.140850+00:00","updated_at":"2026-05-20T00:05:40.140850+00:00"}