{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NL5CXITHRTTTTINHRLPQMCTY4I","short_pith_number":"pith:NL5CXITH","schema_version":"1.0","canonical_sha256":"6afa2ba2678ce739a1a78adf060a78e23f2dbcd873c7cb1cc0716dac19930b8e","source":{"kind":"arxiv","id":"1802.10229","version":2},"attestation_state":"computed","paper":{"title":"Collective Entity Disambiguation with Structured Gradient Tree Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kazi Shefaet Rahman, Ozan Irsoy, Yi Yang","submitted_at":"2018-02-28T02:01:30Z","abstract_excerpt":"We present a gradient-tree-boosting-based structured learning model for jointly disambiguating named entities in a document. Gradient tree boosting is a widely used machine learning algorithm that underlies many top-performing natural language processing systems. Surprisingly, most works limit the use of gradient tree boosting as a tool for regular classification or regression problems, despite the structured nature of language. To the best of our knowledge, our work is the first one that employs the structured gradient tree boosting (SGTB) algorithm for collective entity disambiguation. By de"},"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":"1802.10229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-28T02:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"975dff43fdd93e7059e21ef7aeafa83b0b78f93e423a1f45dfd4c27100ed036c","abstract_canon_sha256":"ee73f321ad6bb787cb68bf6c9ca5585741c41b6ff8cf359abba3c0feb30221db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:38.565547Z","signature_b64":"LlrL5iJetOrIVELOtMeZl0jzwelrlc24cUyqc/FDbj4oUej/qg3yVkOVD3Q9/jhcifBHOVY/KzhbcXrl6WnCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afa2ba2678ce739a1a78adf060a78e23f2dbcd873c7cb1cc0716dac19930b8e","last_reissued_at":"2026-05-18T00:17:38.564849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:38.564849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collective Entity Disambiguation with Structured Gradient Tree Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kazi Shefaet Rahman, Ozan Irsoy, Yi Yang","submitted_at":"2018-02-28T02:01:30Z","abstract_excerpt":"We present a gradient-tree-boosting-based structured learning model for jointly disambiguating named entities in a document. Gradient tree boosting is a widely used machine learning algorithm that underlies many top-performing natural language processing systems. Surprisingly, most works limit the use of gradient tree boosting as a tool for regular classification or regression problems, despite the structured nature of language. To the best of our knowledge, our work is the first one that employs the structured gradient tree boosting (SGTB) algorithm for collective entity disambiguation. By de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10229","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":""},"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":"1802.10229","created_at":"2026-05-18T00:17:38.564955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10229v2","created_at":"2026-05-18T00:17:38.564955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10229","created_at":"2026-05-18T00:17:38.564955+00:00"},{"alias_kind":"pith_short_12","alias_value":"NL5CXITHRTTT","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NL5CXITHRTTTTINH","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NL5CXITH","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02117","citing_title":"Learning Dynamic Context Augmentation for Global Entity Linking","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I","json":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I.json","graph_json":"https://pith.science/api/pith-number/NL5CXITHRTTTTINHRLPQMCTY4I/graph.json","events_json":"https://pith.science/api/pith-number/NL5CXITHRTTTTINHRLPQMCTY4I/events.json","paper":"https://pith.science/paper/NL5CXITH"},"agent_actions":{"view_html":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I","download_json":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I.json","view_paper":"https://pith.science/paper/NL5CXITH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10229&json=true","fetch_graph":"https://pith.science/api/pith-number/NL5CXITHRTTTTINHRLPQMCTY4I/graph.json","fetch_events":"https://pith.science/api/pith-number/NL5CXITHRTTTTINHRLPQMCTY4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I/action/storage_attestation","attest_author":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I/action/author_attestation","sign_citation":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I/action/citation_signature","submit_replication":"https://pith.science/pith/NL5CXITHRTTTTINHRLPQMCTY4I/action/replication_record"}},"created_at":"2026-05-18T00:17:38.564955+00:00","updated_at":"2026-05-18T00:17:38.564955+00:00"}