{"arxiv_id":"2607.14176","incoming":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"outgoing":{"papers":2,"sentences":2,"groups":[{"kind":"background","label":"Cites as background","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2010.13242","title":"Co-embedding of Nodes and Edges with Graph Neural Networks","url":"/paper/2010.13242","section":"Related Work","sentence":"More recent studies have explored edge-centric graph representations, where relay or link activation decisions are formulated as edge classification problems or are addressed through line-graph constructions [ref] .","intent_p":0.81,"contests_p":null}]}],"unlabelled_sentences":1},"claims":[{"relation":"same_result","label":"States the same result","papers":[{"arxiv_id":"2607.20554","url":"/paper/2607.20554","title":"AI-Driven Multi-Hop Relay Selection for Smart Urban NR-V2X Networks via Learning-to-Optimize Graph Neural Networks","main_claim":"Experiments on large-scale urban datasets generated by an integrated SUMO--GEMV2 simulation pipeline show that the proposed approach achieves connectivity comparable to that of the MILP oracle while reducing execution time by orders of magnitude.","p":0.86}]}],"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/2607.14176"}}