{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EY3C6VEKTBA7EVARLV73QNPHTE","short_pith_number":"pith:EY3C6VEK","canonical_record":{"source":{"id":"1802.06159","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-16T23:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"d416516da39e9bcc921763e453a36bbd910818de775fd07fe248dcd8532406c5","abstract_canon_sha256":"db65ee81aee28436d7e835fbb26393978ac387320395b12fb8f5b0ab3a705903"},"schema_version":"1.0"},"canonical_sha256":"26362f548a9841f254115d7fb835e79915407a6a69337959727e8bf9968a60ff","source":{"kind":"arxiv","id":"1802.06159","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06159","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06159v3","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06159","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"EY3C6VEKTBA7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EY3C6VEKTBA7EVAR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EY3C6VEK","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EY3C6VEKTBA7EVARLV73QNPHTE","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06159","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-16T23:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"d416516da39e9bcc921763e453a36bbd910818de775fd07fe248dcd8532406c5","abstract_canon_sha256":"db65ee81aee28436d7e835fbb26393978ac387320395b12fb8f5b0ab3a705903"},"schema_version":"1.0"},"canonical_sha256":"26362f548a9841f254115d7fb835e79915407a6a69337959727e8bf9968a60ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:45.574036Z","signature_b64":"V+08eIxj5ZLAgM1bJQPEeYfUAKUDcZszNg7MDruN2kEi8Zn5Hj91h+KXF9hWFyEHdqeznsSx82nXmDlTLPBqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26362f548a9841f254115d7fb835e79915407a6a69337959727e8bf9968a60ff","last_reissued_at":"2026-05-18T00:21:45.573351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:45.573351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06159","source_version":3,"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-18T00:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMToDgk/eCXFqTnNiC5lMB74Yri2kcpWCDeEXne3nLYosF0q2EF/tKiSuWGuz/wLtUFj1whbdC5DkY7uBaOsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:06.795128Z"},"content_sha256":"adb58281257cb554a1e8ad0e2dc480d5987a5952cefd763dba8f6551c32c67f1","schema_version":"1.0","event_id":"sha256:adb58281257cb554a1e8ad0e2dc480d5987a5952cefd763dba8f6551c32c67f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EY3C6VEKTBA7EVARLV73QNPHTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ad Hoc Table Retrieval using Semantic Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Krisztian Balog, Shuo Zhang","submitted_at":"2018-02-16T23:20:49Z","abstract_excerpt":"We introduce and address the problem of ad hoc table retrieval: answering a keyword query with a ranked list of tables. This task is not only interesting on its own account, but is also being used as a core component in many other table-based information access scenarios, such as table completion or table mining. The main novel contribution of this work is a method for performing semantic matching between queries and tables. Specifically, we (i) represent queries and tables in multiple semantic spaces (both discrete sparse and continuous dense vector representations) and (ii) introduce various"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06159","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4BKXDQjPfy+wujEj2xtaux13ys84EA0eOzZzsenVB2U3ZvmSgLtnPEu0/Z+d2OTXNv61z1RK9zpwM2aIVQ1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:06.795540Z"},"content_sha256":"896c57b103dab1a902c0791312c0f6f38b86a957cd0d8aecfd1190010060aae5","schema_version":"1.0","event_id":"sha256:896c57b103dab1a902c0791312c0f6f38b86a957cd0d8aecfd1190010060aae5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EY3C6VEKTBA7EVARLV73QNPHTE/bundle.json","state_url":"https://pith.science/pith/EY3C6VEKTBA7EVARLV73QNPHTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EY3C6VEKTBA7EVARLV73QNPHTE/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-05-25T19:14:06Z","links":{"resolver":"https://pith.science/pith/EY3C6VEKTBA7EVARLV73QNPHTE","bundle":"https://pith.science/pith/EY3C6VEKTBA7EVARLV73QNPHTE/bundle.json","state":"https://pith.science/pith/EY3C6VEKTBA7EVARLV73QNPHTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EY3C6VEKTBA7EVARLV73QNPHTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EY3C6VEKTBA7EVARLV73QNPHTE","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":"db65ee81aee28436d7e835fbb26393978ac387320395b12fb8f5b0ab3a705903","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-16T23:20:49Z","title_canon_sha256":"d416516da39e9bcc921763e453a36bbd910818de775fd07fe248dcd8532406c5"},"schema_version":"1.0","source":{"id":"1802.06159","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06159","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06159v3","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06159","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"EY3C6VEKTBA7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EY3C6VEKTBA7EVAR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EY3C6VEK","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:896c57b103dab1a902c0791312c0f6f38b86a957cd0d8aecfd1190010060aae5","target":"graph","created_at":"2026-05-18T00:21:45Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce and address the problem of ad hoc table retrieval: answering a keyword query with a ranked list of tables. This task is not only interesting on its own account, but is also being used as a core component in many other table-based information access scenarios, such as table completion or table mining. The main novel contribution of this work is a method for performing semantic matching between queries and tables. Specifically, we (i) represent queries and tables in multiple semantic spaces (both discrete sparse and continuous dense vector representations) and (ii) introduce various","authors_text":"Krisztian Balog, Shuo Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-16T23:20:49Z","title":"Ad Hoc Table Retrieval using Semantic Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06159","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:adb58281257cb554a1e8ad0e2dc480d5987a5952cefd763dba8f6551c32c67f1","target":"record","created_at":"2026-05-18T00:21:45Z","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":"db65ee81aee28436d7e835fbb26393978ac387320395b12fb8f5b0ab3a705903","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-16T23:20:49Z","title_canon_sha256":"d416516da39e9bcc921763e453a36bbd910818de775fd07fe248dcd8532406c5"},"schema_version":"1.0","source":{"id":"1802.06159","kind":"arxiv","version":3}},"canonical_sha256":"26362f548a9841f254115d7fb835e79915407a6a69337959727e8bf9968a60ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26362f548a9841f254115d7fb835e79915407a6a69337959727e8bf9968a60ff","first_computed_at":"2026-05-18T00:21:45.573351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:45.573351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+08eIxj5ZLAgM1bJQPEeYfUAKUDcZszNg7MDruN2kEi8Zn5Hj91h+KXF9hWFyEHdqeznsSx82nXmDlTLPBqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:45.574036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06159","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adb58281257cb554a1e8ad0e2dc480d5987a5952cefd763dba8f6551c32c67f1","sha256:896c57b103dab1a902c0791312c0f6f38b86a957cd0d8aecfd1190010060aae5"],"state_sha256":"95cd025a7d74be5e55f6c93e0f3e0193e471d82c05729ed0b92fa99c465f792f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bsTCGEl8EAmlptlmZ4qftA+IB04BfFZc1faeBXPRvs0zDtBWLhSPXoB+kA/xQOB5OyFo5ovuifqeL/tco4WDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:14:06.798571Z","bundle_sha256":"091967992d20424292628584405c1bf4e776bc48cbcead76b9f86a56d821b6a2"}}