{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QSIOL3OWEGZ5ZZALTV5WMK4AGX","short_pith_number":"pith:QSIOL3OW","schema_version":"1.0","canonical_sha256":"8490e5edd621b3dce40b9d7b662b8035dcbaddbcdccd270a13717ba04ec1bf8b","source":{"kind":"arxiv","id":"2001.04828","version":1},"attestation_state":"computed","paper":{"title":"TableQnA: Answering List Intent Queries With Web Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guihong Cao, Kaushik Chakrabarti, Siamak Shakeri, Surajit Chaudhuri, Zhimin Chen","submitted_at":"2020-01-10T01:43:54Z","abstract_excerpt":"The web contains a vast corpus of HTML tables. They can be used to provide direct answers to many web queries. We focus on answering two classes of queries with those tables: those seeking lists of entities (e.g., `cities in california') and those seeking superlative entities (e.g., `largest city in california'). The main challenge is to achieve high precision with significant coverage. Existing approaches train machine learning models to select the answer from the candidates; they rely on textual match features between the query and the content of the table along with features capturing table"},"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":"2001.04828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-01-10T01:43:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"113d933302d075ff429ba8b96dd2974b757947a13f361341f5610c5a7c1c8482","abstract_canon_sha256":"f1a0e6c39307a0249fe4c755f11a70637d7ead6d133e042e76e350df8d8d5d93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:30.043201Z","signature_b64":"KLKihDQN6sbwN2abdmpindCfy2kum5MDUm5f22jaeHK7yteEBBzENTDMrSf3xUIr72DtQM8Ll0vhQngq9YBbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8490e5edd621b3dce40b9d7b662b8035dcbaddbcdccd270a13717ba04ec1bf8b","last_reissued_at":"2026-07-05T00:33:30.042811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:30.042811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TableQnA: Answering List Intent Queries With Web Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guihong Cao, Kaushik Chakrabarti, Siamak Shakeri, Surajit Chaudhuri, Zhimin Chen","submitted_at":"2020-01-10T01:43:54Z","abstract_excerpt":"The web contains a vast corpus of HTML tables. They can be used to provide direct answers to many web queries. We focus on answering two classes of queries with those tables: those seeking lists of entities (e.g., `cities in california') and those seeking superlative entities (e.g., `largest city in california'). The main challenge is to achieve high precision with significant coverage. Existing approaches train machine learning models to select the answer from the candidates; they rely on textual match features between the query and the content of the table along with features capturing table"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.04828","kind":"arxiv","version":1},"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/2001.04828/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":"2001.04828","created_at":"2026-07-05T00:33:30.042867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.04828v1","created_at":"2026-07-05T00:33:30.042867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.04828","created_at":"2026-07-05T00:33:30.042867+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSIOL3OWEGZ5","created_at":"2026-07-05T00:33:30.042867+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSIOL3OWEGZ5ZZAL","created_at":"2026-07-05T00:33:30.042867+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSIOL3OW","created_at":"2026-07-05T00:33:30.042867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21783","citing_title":"Evaluating List Construction and Temporal Understanding capabilities of Large Language Models","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX","json":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX.json","graph_json":"https://pith.science/api/pith-number/QSIOL3OWEGZ5ZZALTV5WMK4AGX/graph.json","events_json":"https://pith.science/api/pith-number/QSIOL3OWEGZ5ZZALTV5WMK4AGX/events.json","paper":"https://pith.science/paper/QSIOL3OW"},"agent_actions":{"view_html":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX","download_json":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX.json","view_paper":"https://pith.science/paper/QSIOL3OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.04828&json=true","fetch_graph":"https://pith.science/api/pith-number/QSIOL3OWEGZ5ZZALTV5WMK4AGX/graph.json","fetch_events":"https://pith.science/api/pith-number/QSIOL3OWEGZ5ZZALTV5WMK4AGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX/action/storage_attestation","attest_author":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX/action/author_attestation","sign_citation":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX/action/citation_signature","submit_replication":"https://pith.science/pith/QSIOL3OWEGZ5ZZALTV5WMK4AGX/action/replication_record"}},"created_at":"2026-07-05T00:33:30.042867+00:00","updated_at":"2026-07-05T00:33:30.042867+00:00"}