{"arxiv_id":"2003.03406","incoming":{"papers":5,"sentences":8,"groups":[{"kind":"background","label":"Cites it as background","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2112.04224","title":"Python's Lunches in Jackiw-Teitelboim gravity with matter","url":"/paper/2112.04224","section":"Complexity, reconstruction and ghostly interactions","sentence":"Next we review the Petz map reconstruction of code space operation from the boundary theory and its operational complexity in the presence of the Python's lunch degrees of freedom [ref] .","intent_p":0.95,"contests_p":null}]}],"unlabelled_sentences":7},"outgoing":{"papers":24,"sentences":34,"groups":[{"kind":"method_or_tool","label":"Uses the method or tool of","papers":2,"sentences":2,"quotes":[{"arxiv_id":"1902.02844","title":"Entanglement Wedge Reconstruction using the Petz Map","url":"/paper/1902.02844","section":"Petz maps as precursors","sentence":"In this paper we will use the following definition of Petz map from [ref] [ref] . $W$ is an operator on the code subspace. $V$ is the embedding of the code subspace into the CFT Hilbert space.","intent_p":0.86,"contests_p":null},{"arxiv_id":"1911.11977","title":"Replica wormholes and the black hole interior","url":"/paper/1911.11977","section":"Petz maps as precursors","sentence":"In this paper we will use the following definition of Petz map from [ref] [ref] . $W$ is an operator on the code subspace. $V$ is the embedding of the code subspace into the CFT Hilbert space.","intent_p":0.86,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites as support","papers":2,"sentences":2,"quotes":[{"arxiv_id":"1910.14646","title":"Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality","url":"/paper/1910.14646","section":"Comparison with exterior operator reconstruction","sentence":"The complexity of doing this can be at least exponential in the complexity of the operator [ref] [ref] .","intent_p":0.98,"contests_p":null},{"arxiv_id":"2003.01807","title":"Horizons Protect Church-Turing","url":"/paper/2003.01807","section":"Comparison with exterior operator reconstruction","sentence":"The complexity of doing this can be at least exponential in the complexity of the operator [ref] [ref] .","intent_p":0.98,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":7,"sentences":7,"quotes":[{"arxiv_id":"1406.2678","title":"Complexity and Shock Wave Geometries","url":"/paper/1406.2678","section":"Complexity of Petz map and wormhole geometry","sentence":"The complexity of such operators was studied in [ref] [ref] [ref] .","intent_p":0.82,"contests_p":null},{"arxiv_id":"1408.2823","title":"Switchbacks and the Bridge to Nowhere","url":"/paper/1408.2823","section":"Complexity of Petz map and wormhole geometry","sentence":"The complexity of such operators was studied in [ref] [ref] [ref] .","intent_p":0.82,"contests_p":null},{"arxiv_id":"1608.02612","title":"Quantum Complexity and Negative Curvature","url":"/paper/1608.02612","section":"Complexity of Petz map and wormhole geometry","sentence":"The complexity of such operators was studied in [ref] [ref] [ref] .","intent_p":0.82,"contests_p":null},{"arxiv_id":"1905.08255","title":"Entanglement Wedge Reconstruction and the Information Paradox","url":"/paper/1905.08255","section":"Comments on the applicability and state dependence","sentence":"The state dependence in more general case is outside the scope of this paper and see section 3 of [ref] for extended discussion on this issue.","intent_p":0.94,"contests_p":null},{"arxiv_id":"hep-th/0606141","title":"Holographic representation of local bulk operators","url":"/paper/hep-th/0606141","section":"Introduction","sentence":"In AdS/CFT correspondence, the bulk operators can be written as boundary operators [ref] .","intent_p":0.93,"contests_p":null}]}],"unlabelled_sentences":23},"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/2003.03406"}}