{"arxiv_id":"2210.07018","incoming":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"outgoing":{"papers":3,"sentences":5,"groups":[{"kind":"background","label":"Cites as background","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2211.02394","title":"Online Matching with Set and Concave Delays","url":"/paper/2211.02394","section":"Introduction","sentence":"Deryckere and Umboh [ref] studied online matching with set delay, where the delay cost at any given time is an arbitrary function of the set of pending requests.","intent_p":0.97,"contests_p":null},{"arxiv_id":"2206.10287","title":null,"url":"/paper/2206.10287","section":"Introduction","sentence":"Kessel et al. [ref] studied the bipartite version of the problem and Bäumler et al. [ref] studied the special case to maximize the number of pairs produced.","intent_p":0.85,"contests_p":null},{"arxiv_id":"2109.06640","title":"Online k-Way Matching with Delays and the H-Metric","url":"/paper/2109.06640","section":"Introduction","sentence":"Other classical online problems have been also considered under such delay setting, such as the online service problem [ref] , the multi-level aggregation problem [ref] , facility location [ref] , bin packing [ref] , set cover [ref] and many others [ref] .","intent_p":1.0,"contests_p":null}]}],"unlabelled_sentences":2},"claims":[],"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/2210.07018"}}