{"arxiv_id":"2404.09711","incoming":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"outgoing":{"papers":4,"sentences":4,"groups":[{"kind":"background","label":"Cites as background","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2109.06640","title":"Online k-Way Matching with Delays and the H-Metric","url":"/paper/2109.06640","section":"Other related works","sentence":"We remark here that besides MLA and OSD, many other online problems with delays/deadline have also drawn a lot of attentions recently, such as online matching with delays [ref] , facility location with delays/deadline [ref] , Steiner tree with delays/deadline [ref] , bin packing with delays [ref] , set cover with delays [ref] , paging with delays/deadline [ref] , list update with delays/deadline [ref] , and many others [ref] .","intent_p":1.0,"contests_p":null},{"arxiv_id":"2408.02526","title":"Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line","url":"/paper/2408.02526","section":"Other related works","sentence":"We remark here that besides MLA and OSD, many other online problems with delays/deadline have also drawn a lot of attentions recently, such as online matching with delays [ref] , facility location with delays/deadline [ref] , Steiner tree with delays/deadline [ref] , bin packing with delays [ref] , set cover with delays [ref] , paging with delays/deadline [ref] , list update with delays/deadline [ref] , and many others [ref] .","intent_p":1.0,"contests_p":null},{"arxiv_id":"2408.08658","title":"Online Matching with Delays and Size-based Costs","url":"/paper/2408.08658","section":"Other related works","sentence":"We remark here that besides MLA and OSD, many other online problems with delays/deadline have also drawn a lot of attentions recently, such as online matching with delays [ref] , facility location with delays/deadline [ref] , Steiner tree with delays/deadline [ref] , bin packing with delays [ref] , set cover with delays [ref] , paging with delays/deadline [ref] , list update with delays/deadline [ref] , and many others [ref] .","intent_p":1.0,"contests_p":null}]}],"unlabelled_sentences":1},"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/2404.09711"}}