{"arxiv_id":"1610.05725","incoming":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"outgoing":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"claims":[{"relation":"contradicts","label":"States a conflicting result","papers":[{"arxiv_id":"0711.2010","url":"/paper/0711.2010","title":"A Polynomial Time Algorithm for Graph Isomorphism","main_claim":"But the algorithm is wrong.","p":0.9}]}],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":null,"_links":{"html":"https://pith.science/paper/1610.05725"}}