{"arxiv_id":"2512.14643","incoming":{"papers":4,"sentences":9,"groups":[{"kind":"method_or_tool","label":"Uses its method or tool","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2604.07178","title":"On the Computational Power of Geometrically Local QAC circuits","url":"/paper/2604.07178","section":"Introduction","sentence":"These lower bounds are based on an input-restriction approach, inspired by 's well-known random restriction method [ref] , and the recent work by Joshi, Tal, Vasconcelos, and Wright [ref] .","intent_p":0.95,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2604.26179","title":"Hard-to-Sample Distributions from Robust Extractors","url":"/paper/2604.26179","section":"Introduction","sentence":"Even just the past few years have seen impressive developments in understanding the limitations of these models through the lens of pseudorandom generators [ref] (see also the survey [ref] ), extractors [ref] , and quantum analogs [ref] .[This is only a minute fraction of contemporary work, and we encourage the interested reader to consult references within those cited.]","intent_p":0.89,"contests_p":null},{"arxiv_id":"2604.07178","title":"On the Computational Power of Geometrically Local QAC circuits","url":"/paper/2604.07178","section":"Introduction","sentence":"Since its introduction, $$ has been studied extensively [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"2601.10693","title":"Constant-Depth Unitary Preparation of Dicke States","url":"/paper/2601.10693","section":"Introduction","sentence":"Since the gate can straightforwardly be used to compute the GHZ/CAT state, most of the literature on versus has focused on synthesis of GHZ states and its variants [ref] .","intent_p":0.92,"contests_p":null}]}],"unlabelled_sentences":5},"outgoing":{"papers":3,"sentences":6,"groups":[{"kind":"comparison","label":"Compares with","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2504.06433","title":"Tight bounds on depth-2 QAC-circuits computing parity","url":"/paper/2504.06433","section":"Quantum Analog of Restrictions","sentence":"We note that [ref] already provide a tighter bound, in terms of $n$, for in depth-$2$.","intent_p":0.95,"contests_p":null}]}],"unlabelled_sentences":5},"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/2512.14643"}}