{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QJDZVENBEJXOWKNIK7E3DSAERE","short_pith_number":"pith:QJDZVENB","schema_version":"1.0","canonical_sha256":"82479a91a1226eeb29a857c9b1c804891f7d535afc1f6d0f2230b9f62c4b7704","source":{"kind":"arxiv","id":"1606.07188","version":1},"attestation_state":"computed","paper":{"title":"Selective Term Proximity Scoring Via BP-ANN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Benjun Ye, Gang Wang, Jiancong Tong, Ju Yang, Rebecca J. Stones, Xiaoguang Liu, Zhaohua Zhang","submitted_at":"2016-06-23T05:02:24Z","abstract_excerpt":"When two terms occur together in a document, the probability of a close relationship between them and the document itself is greater if they are in nearby positions. However, ranking functions including term proximity (TP) require larger indexes than traditional document-level indexing, which slows down query processing. Previous studies also show that this technique is not effective for all types of queries. Here we propose a document ranking model which decides for which queries it would be beneficial to use a proximity-based ranking, based on a collection of features of the query. We use a "},"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":"1606.07188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-06-23T05:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"59b757c4d10de843e0f48d0e4797c2938e012f667490783cb5eaf97d41d6fee3","abstract_canon_sha256":"42b22f6b34766882d41d9e604a23996c0a73e72e218ac43eeeaea9161a37df7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.495083Z","signature_b64":"GD37q3xShpXcsy8ZB56cKAoSUelPv/vwxRsvFVD/rQ6CR/y/W/rhRNFQNtoK7v4CZsv7mTOogwMURjR0TwJJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82479a91a1226eeb29a857c9b1c804891f7d535afc1f6d0f2230b9f62c4b7704","last_reissued_at":"2026-05-18T01:11:58.494741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.494741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selective Term Proximity Scoring Via BP-ANN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Benjun Ye, Gang Wang, Jiancong Tong, Ju Yang, Rebecca J. Stones, Xiaoguang Liu, Zhaohua Zhang","submitted_at":"2016-06-23T05:02:24Z","abstract_excerpt":"When two terms occur together in a document, the probability of a close relationship between them and the document itself is greater if they are in nearby positions. However, ranking functions including term proximity (TP) require larger indexes than traditional document-level indexing, which slows down query processing. Previous studies also show that this technique is not effective for all types of queries. Here we propose a document ranking model which decides for which queries it would be beneficial to use a proximity-based ranking, based on a collection of features of the query. We use a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07188","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":""},"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":"1606.07188","created_at":"2026-05-18T01:11:58.494797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07188v1","created_at":"2026-05-18T01:11:58.494797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07188","created_at":"2026-05-18T01:11:58.494797+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJDZVENBEJXO","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJDZVENBEJXOWKNI","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJDZVENB","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE","json":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE.json","graph_json":"https://pith.science/api/pith-number/QJDZVENBEJXOWKNIK7E3DSAERE/graph.json","events_json":"https://pith.science/api/pith-number/QJDZVENBEJXOWKNIK7E3DSAERE/events.json","paper":"https://pith.science/paper/QJDZVENB"},"agent_actions":{"view_html":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE","download_json":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE.json","view_paper":"https://pith.science/paper/QJDZVENB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07188&json=true","fetch_graph":"https://pith.science/api/pith-number/QJDZVENBEJXOWKNIK7E3DSAERE/graph.json","fetch_events":"https://pith.science/api/pith-number/QJDZVENBEJXOWKNIK7E3DSAERE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE/action/storage_attestation","attest_author":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE/action/author_attestation","sign_citation":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE/action/citation_signature","submit_replication":"https://pith.science/pith/QJDZVENBEJXOWKNIK7E3DSAERE/action/replication_record"}},"created_at":"2026-05-18T01:11:58.494797+00:00","updated_at":"2026-05-18T01:11:58.494797+00:00"}