SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1802.10229 · 2018

Collective Entity Disambiguation with Structured Gradient Tree Boosting

arXiv · PDF · Open in the Atlas

Code that ran

1 of 1 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1802.10229.json · badge: /api/ran/1802.10229.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
bloomberg/sgtb canonical (classifier label)
classifier basis: classifier_2025
1 ran · 0 no recorded run
FunctionStatusWhere it lives
make_idx_data Ran
ran; our contract draft was wrong, not the code
bloomberg/sgtb/structured_learner.py
code served (permissive licence) · get_code("3641147851e7dcf1")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

# Construct valid arguments for make_idx_data
# The function expects:
# - docs: a document list with structure [[[(mention_str, offset, wikiID), [(entity, label), [feature]]]]]
# - ncand: number of entity candidates (int)
# - skip: boolean flag

# Build a small example document structure
# Each document contains mentions, each mention has:
# - mentcand[0]: (mention_str, offset, wikiID)
# - mentcand[1]: list of entity candidates, where each candidate is:
#   - entcand[0]: (entity_id, label) where label is 0 or 1
#   - entcand[1]: feature vector (list of floats)

docs = [
    [
        # First mention
        [
            ("mention_1", 0, 101),  # (mention_str, offset, wikiID)
            [
                (("entity_1", 1), [0.1, 0.2, 0.3, 0.4]),  # gold entity (label=1)
                (("entity_2", 0), [0.5, 0.6, 0.7, 0.8]),  # non-gold entity (label=0)
                (("entity_3", 0), [0.9, 1.0, 1.1, 1.2]),  # non-gold entity
            ]
        ],
        # Second mention
        [
            ("mention_2", 10, 102),
            [
                (("entity_4", 0), [1.3, 1.4, 1.5, 1.6]),  # non-gold
                (("entity_5", 1), [1.7, 1.8, 1.9, 2.0]),  # gold entity
            ]
        ]
    ]
]

ncand = 30
skip = False

ARGS = {
    "docs": docs,
    "ncand": ncand,
    "skip": skip
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type tuple — a tuple output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

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 defining global features over previous disambiguation decisions and jointly modeling them with local features, our system is able to produce globally optimized entity assignments for mentions in a document. Exact inference is prohibitively expensive for our globally normalized model. To solve this problem, we propose Bidirectional Beam Search with Gold path (BiBSG), an approximate inference algorithm that is a variant of the standard beam search algorithm. BiBSG makes use of global information from both past and future to perform better local search. Experiments on standard benchmark datasets show that SGTB significantly improves upon published results. Specifically, SGTB outperforms the previous state-of-the-art neural system by near 1\% absolute accuracy on the popular AIDA-CoNLL dataset.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1802.10229")
get_code_for_paper("1802.10229")
have("1802.10229")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1802.10229.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1802.10229.svg)](https://syntology.ai/paper/1802.10229)

Connect an agent — have() is free.