We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Query-based open-domain NLP tasks require information synthesis from long and diverse web results. Current approaches extractively select portions of web text as input to Sequence-to-Sequence models using methods such as TF-IDF ranking. We propose constructing a local graph structured knowledge base for each query, which compresses the web search information and reduces redundancy. We show that by linearizing the graph into a structured input sequence, models can encode the graph representations within a standard Sequence-to-Sequence setting. For two generative tasks with very long text input, long-form question answering and multi-document summarization, feeding graph representations as input can achieve better performance than using retrieved text portions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.08435")
get_code_for_paper("1910.08435")
have("1910.08435")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.08435.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.08435)
Connect an agent — have() is free.