{"arxiv_id":"quant-ph/0603031","incoming":{"papers":3,"sentences":9,"groups":[{"kind":"method_or_tool","label":"Uses its method or tool","papers":2,"sentences":4,"quotes":[{"arxiv_id":"1901.02590","title":"Secure list decoding","url":"/paper/1901.02590","section":"Proof of Converse Theorem","sentence":"The key point of the second part is the meta converse for list decoding [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"2103.11548","title":"Secure list decoding and its application to bit-string commitment","url":"/paper/2103.11548","section":"Proof of Converse Theorem","sentence":"The meta converse for list decoding [ref] shows that $ϵ_Q ≤|(ϕ_n,D_n)|_2/|(ϕ_n,D_n)|_1$ and $ϵ_P≤ϵ_A(ϕ_n,D_n)$.","intent_p":0.87,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2601.09786","title":"Zero-Error List Decoding for Classical-Quantum Channels","url":"/paper/2601.09786","section":"Introduction","sentence":"Extensions to the quantum setting have been rare, with only few results available in the literature; see, for example, Ref. [ref] .","intent_p":0.97,"contests_p":null}]}],"unlabelled_sentences":4},"outgoing":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"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/quant-ph/0603031"}}