Pith. sign in

REVIEW 3 major objections 1 minor 3 cited by

Three standard ways of modeling a quantum detector all predict partial reflection of the wave function in a waveguide arrival-time setup.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-13 20:27 UTC pith:O3KMEMPQ

load-bearing objection Incremental but useful computational comparison of three existing arrival-time models on a waveguide geometry; we only have the abstract, so the numerics and methods cannot be checked. the 3 major comments →

arxiv 2603.22044 v2 pith:O3KMEMPQ submitted 2026-03-23 quant-ph

Detection Time Distribution Predicted Using Absorbing Boundary Conditions and Imaginary Potentials

Alireza Jozani , Roderich Tumulka This is my paper
classification quant-ph
keywords quantum arrival timesabsorbing boundary conditionsimaginary potentialswaveguidedetection time distributionspin-1/2 particlepartial reflection
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Several inequivalent mathematical recipes exist for the probability distribution of the time at which a detector clicks for an arriving quantum particle. This paper evaluates three of them—two forms of absorbing boundary conditions and an imaginary potential—on a concrete non-relativistic geometry: a spin-0 or spin-1/2 particle traveling in a waveguide with a detector waiting farther down the axis. The computed distributions exhibit clear signatures of partial reflection off the detector surface. For the spin-1/2 case the distribution is independent of the particle’s initial spin orientation under the parameters examined, yet becomes sensitive to waveguide width once the boundary condition itself couples to spin. The predictions are shown to differ from those of an earlier competing proposal.

Core claim

In the waveguide-plus-downstream-detector geometry the three proposals (two absorbing boundary conditions and imaginary potentials) produce arrival-time distributions that display partial reflection of the wave function from the detector; for spin 1/2 the distribution is independent of initial spin orientation for the parameters tested, but depends on waveguide width when the boundary condition couples to spin, and these curves disagree with the predictions of Das and Dürr.

What carries the argument

Absorbing boundary conditions (of two kinds) and imaginary potentials that convert the free Schrödinger evolution into a non-unitary dynamics whose absorption rate or probability current is identified with the click-time distribution.

Load-bearing premise

The idealized absorbing boundary or imaginary potential is assumed to stand in for a real laboratory detector, so that the mathematical absorption rate can be read directly as the empirical distribution of detection times.

What would settle it

Measure the arrival-time histogram for a non-relativistic particle (spin 0 or 1/2) in a waveguide of controllable width with a detector placed downstream, and check whether the observed distribution shows the predicted partial-reflection features and width dependence, or instead matches the competing Das–Dürr curve.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Any experimental test of quantum arrival times in a waveguide geometry must allow for the possibility of partial reflection at the detector surface.
  • Spin-coupling boundary conditions introduce an observable dependence on waveguide width that can discriminate among the proposals.
  • The three recipes remain inequivalent even after the same idealized geometry is imposed, so they cannot all be correct descriptions of the same physical detector.
  • Comparisons with other theoretical proposals can now be performed on a common, experimentally realistic setup rather than abstract free space.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If partial reflection is confirmed experimentally, many textbook treatments that treat detectors as perfect absorbers will need revision for precision timing experiments.
  • The width dependence for spin-coupled boundaries suggests a possible new metrological handle for calibrating detector models against waveguide geometry.
  • Disagreement with Das and Dürr implies that at least one of the four proposals must fail a future single-particle timing experiment.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 1 minor

Summary. The submission’s title and abstract announce a quant-ph calculation of arrival-time distributions for a non-relativistic spin-0 or spin-1/2 particle in a waveguide, obtained from two absorbing-boundary-condition proposals and from imaginary potentials, with a comparison to Das & Dürr. The body that follows, however, is an unrelated software-engineering manuscript (DAIRA) that describes a dynamic-analysis agent for SWE-bench issue resolution, reports resolution rates with Gemini 3 Flash, and contains no quantum-mechanical equations, boundary conditions, wave-guide geometry, or numerical results of any kind.

Significance. Because the supplied full text does not contain the claimed calculation, no scientific contribution in quantum arrival-time theory can be evaluated. The abstract’s qualitative statements (partial reflection, spin-orientation independence, waveguide-width dependence) remain unsubstantiated by any derivation or figure present in the manuscript.

major comments (3)
  1. Title/abstract versus body: the entire manuscript after the abstract is the DAIRA software-engineering paper (SWE-bench, Hunter tracing, Gemini 3 Flash, etc.). No section, equation, figure or table addresses absorbing boundary conditions, imaginary potentials, waveguides, or detection-time distributions. The central claim of the abstract is therefore unsupported by any content that can be refereed.
  2. Absence of all load-bearing technical material: there are no definitions of the two absorbing boundary conditions, no form of the imaginary potential, no Schrödinger equation or spinor boundary condition, no numerical method, no parameter values, and no comparison data versus Das & Dürr (arXiv:1802.07141). Without these, the abstract’s predictions cannot be verified or reproduced.
  3. The only concrete experimental idealization mentioned in the abstract (waveguide along z with a downstream detector) never appears in the body; consequently the weakest modelling assumption—that the chosen ABC/imaginary-potential models faithfully represent a laboratory detector—cannot be examined for consistency or regime of validity.
minor comments (1)
  1. Even the front-matter is inconsistent: the ACM-style copyright block, conference placeholder “Conference acronym ’XX’”, and arXiv identifier that appear in the body belong to a different paper and field.

Circularity Check

0 steps flagged

No circularity detectable: abstract presents non-tautological predictions from prior ABC/imaginary-potential proposals on a new geometry; supplied full text is an unrelated SE paper, so no derivation chain exists to reduce.

full rationale

The only content belonging to arXiv:2603.22044 is its abstract. That abstract states that three previously published proposals (two absorbing boundary conditions and imaginary potentials) are applied to a waveguide-plus-downstream-detector geometry for a non-relativistic spin-0 or spin-1/2 particle, yielding arrival-time distributions that exhibit partial reflection, spin-orientation independence (for the parameters tested), and waveguide-width dependence when the BC couples to spin; these are then compared with Das & Dürr. Nothing in the abstract fits a free parameter to the target distribution and then re-labels the fit as a prediction, defines the output in terms of itself, or imports a uniqueness theorem from the same authors that forces the result. The CACHEABLE PAPER SOURCE CONTEXT and FULL MANUSCRIPT TEXT instead contain the entirely unrelated DAIRA software-engineering manuscript (SWE-bench, dynamic tracing, Gemini 3 Flash, etc.). Consequently there are no equations, boundary-condition definitions, numerical methods, or self-citations of the quant-ph paper that could be inspected for circular reduction. Per the analyzer rules, an honest non-finding is required: score 0, empty steps. Any deeper circularity (or lack thereof) inside the actual quant-ph derivation cannot be assessed from the material supplied.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

Because only the abstract is available, the ledger is necessarily incomplete. The central claims rest on the standard non-relativistic Schrödinger equation, the three detector models taken from prior literature, and the idealization that those models correctly describe a laboratory detector. No free parameters or invented entities are visible in the abstract; any numerical cut-offs or waveguide dimensions used in the actual computation remain unknown.

axioms (3)
  • domain assumption The non-relativistic Schrödinger equation (with or without spin) governs the particle inside the waveguide.
    Implicit in the abstract’s description of a single non-relativistic quantum particle of spin 0 or 1/2.
  • domain assumption Absorbing boundary conditions of two kinds, or an imaginary potential, correctly convert the continuous evolution into a detection-time probability density.
    These are the three proposals whose predictions are computed; their validity as detector models is assumed rather than derived.
  • ad hoc to paper The waveguide geometry with a downstream detector is an adequate idealization of a possible laboratory experiment.
    Chosen as the concrete setup for which the distributions are evaluated.

pith-pipeline@v1.1.0-grok45 · 14909 in / 2272 out tokens · 28847 ms · 2026-07-13T20:27:38.381760+00:00 · methodology

0 comments
read the original abstract

There are several inequivalent proposals in the literature for how to compute the probability distribution of the time that a detector registers for the arrival of a quantum particle. For three of these proposals, based on two kinds of absorbing boundary conditions and imaginary potentials, we compute the predicted distribution for an experimental setup involving a single non-relativistic quantum particle with spin 0 or 1/2 in a wave guide along the $z$ axis with the detector waiting downstream. We find that the distribution shows signs of partial reflection of the wave function off of the detector; for a spin-1/2 wave function, it is independent of the initial spin orientation for the parameters tested but does depend, for boundary conditions coupling to the spin, on the width of the wave guide. We also compare our predictions with the competing ones of Das and D\"urr [arXiv:1802.07141].

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Exact propagating Dirac wave packets in an attractive Coulomb-like potential

    quant-ph 2026-06 unverdicted novelty 8.0

    Exact propagating Dirac wave packets are constructed in the potential V=-v0/ρ, including elementary-function families that recover Hermite-Gauss packets nonrelativistically, with spin-decoupled probability density and...

  2. The arrival position problem in quantum mechanics

    quant-ph 2026-07 conditional novelty 7.0

    Prominent solutions to the quantum screen problem yield mutually distinguishable arrival-position distributions for particles from single- and double-well traps, including in the far-field limit.

  3. Spin-Momentum Impedance and Filtering by a Spin-Coupled Absorbing Boundary Condition

    quant-ph 2026-06 unverdicted novelty 6.0

    Spin-coupled absorbing boundary condition for spin-1/2 particles creates spin-momentum impedance that filters detection flux and produces sqrt(ω)-scaled mean detection times in harmonic guides.

Reference graph

Works this paper leans on

28 extracted references · 10 linked inside Pith · cited by 3 Pith papers

  1. [1]

    Anonymous Author(s). 2025. DAIRA: Replication Package. https://anonymous. 4open.science/r/DAIRA-1EC0 Accessed: 2025-01-30

    2025

  2. [2]

    Antonis Antoniades, Albert Örwall, Kexun Zhang, Yuxi Xie, Anirudh Goyal, and William Wang. 2025. SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement. arXiv:2410.20285 [cs.AI] https: //arxiv.org/abs/2410.20285

    Pith/arXiv arXiv 2025

  3. [3]

    Nicolas Bettenburg, Sascha Just, Adrian Schröter, Cathrin Weiss, Rahul Premraj, and Thomas Zimmermann. 2008. What makes a good bug report?. InProceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering(Atlanta, Georgia)(SIGSOFT ’08/FSE-16). Association for Computing Machinery, New York, NY, USA, 308–318. doi:10.1145/...

    doi:10.1145/1453101.1453146 2008

  4. [4]

    Silin Chen, Shaoxin Lin, Xiaodong Gu, Yuling Shi, Heng Lian, Longfei Yun, Dong Chen, Weiguo Sun, Lin Cao, and Qianxiang Wang. 2025. SWE-Exp: Experience- Driven Software Issue Resolution. arXiv:2507.23361 [cs.SE] https://arxiv.org/ abs/2507.23361

    arXiv 2025

  5. [5]

    SGM Cornelissen, AE Zaidman, A van Deursen, LMF Moonen, and R Koschke

  6. [6]

    doi:10.1109/TSE.2009.28

    A Systematic Survey of Program Comprehension through Dynamic Analysis.IEEE Transactions on Software Engineering35, 5 (2009), 684–702. doi:10.1109/TSE.2009.28

    doi:10.1109/tse.2009.28 2009

  7. [7]

    J. D. Hunter. 2007. Matplotlib: A 2D graphics environment.Computing in Science & Engineering9, 3 (2007), 90–95. doi:10.1109/MCSE.2007.55

    doi:10.1109/mcse.2007.55 2007

  8. [8]

    Jimenez, John Yang, Alexander Wettig, Shunyu Yao, Kexin Pei, Ofir Press, and Karthik Narasimhan

    Carlos E. Jimenez, John Yang, Alexander Wettig, Shunyu Yao, Kexin Pei, Ofir Press, and Karthik Narasimhan. 2024. SWE-bench: Can Language Models Resolve Real- World GitHub Issues? arXiv:2310.06770 [cs.CL] https://arxiv.org/abs/2310.06770

    Pith/arXiv arXiv 2024

  9. [9]

    Han Li, Yuling Shi, Shaoxin Lin, Xiaodong Gu, Heng Lian, Xin Wang, Yantao Jia, Tao Huang, and Qianxiang Wang. 2025. SWE-Debate: Competitive Multi- Agent Debate for Software Issue Resolution. arXiv:2507.23348 [cs.SE] https: //arxiv.org/abs/2507.23348

    Pith/arXiv arXiv 2025

  10. [10]

    Jierui Li, Hung Le, Yingbo Zhou, Caiming Xiong, Silvio Savarese, and Doyen Sahoo. 2025. CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models. InProceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), Luis Ch...

    doi:10.18653/v1/2025.naacl-long.189 2025

  11. [11]

    Changshu Liu, Alireza Ghazanfari, Yang Chen, and Reyhan Jabbarvand. 2025. Evaluating Code Reasoning Abilities of Large Language Models Under Real-World Settings. https://api.semanticscholar.org/CorpusID:283920955

    2025

  12. [12]

    Xiangyan Liu, Bo Lan, Zhiyuan Hu, Yang Liu, Zhicheng Zhang, Fei Wang, Michael Shieh, and Wenmeng Zhou. 2024. CodexGraph: Bridging Large Language Models and Code Repositories via Code Graph Databases. arXiv:2408.03910 [cs.SE] https://arxiv.org/abs/2408.03910

    Pith/arXiv arXiv 2024

  13. [13]

    Smith, Mateusz Paprocki, Ondřej Čertík, Sergey B

    Aaron Meurer, Christopher P. Smith, Mateusz Paprocki, Ondřej Čertík, Sergey B. Kirpichev, Matthew Rocklin, Amit Kumar, Sergiu Ivanov, Jason K. Moore, Sar- taj Singh, Thilina Rathnayake, Sean Vig, Brian E. Granger, Richard P. Muller, Francesco Bonazzi, Harsh Gupta, Shivam Vats, Fredrik Johansson, Fabian Pe- dregosa, Matthew J. Curry, Andy R. Terrel, Štěpán...

    doi:10.7717/peerj-cs.103 2017

  14. [14]

    Manish Motwani, Sandhya Sankaranarayanan, René Just, and Yuriy Brun. 2018. Do automated program repair techniques repair hard and important bugs?. In Proceedings of the 40th International Conference on Software Engineering(Gothen- burg, Sweden)(ICSE ’18). Association for Computing Machinery, New York, NY, USA, 25. doi:10.1145/3180155.3182533

    doi:10.1145/3180155.3182533 2018

  15. [15]

    Fangwen Mu, Junjie Wang, Lin Shi, Song Wang, Shoubin Li, and Qing Wang. 2025. EXPEREPAIR: Dual-Memory Enhanced LLM-based Repository-Level Program Repair. arXiv:2506.10484 [cs.SE] https://arxiv.org/abs/2506.10484

    Pith/arXiv arXiv 2025

  16. [16]

    2025.Hunter: A flexible code tracing toolkit

    Ionel Cristian Măries,. 2025.Hunter: A flexible code tracing toolkit. https://github. com/ionelmc/python-hunter BSD 2-Clause License

    2025

  17. [17]

    Haifeng Ruan, Yuntong Zhang, and Abhik Roychoudhury. 2024. SpecRover: Code Intent Extraction via LLMs. arXiv:2408.02232 [cs.SE] https://arxiv.org/abs/2408. 02232

    Pith/arXiv arXiv 2024

  18. [18]

    Gregory Tassey. 2002. The economic impacts of inadequate infrastructure for software testing. https://api.semanticscholar.org/CorpusID:107332102

    2002

  19. [19]

    G Tassey. 2002. Economic Impacts of Inadequate Infrastructure for Software Testing. (2002)

    2002

  20. [20]

    Xu, Xiangru Tang, Mingchen Zhuge, Jiayi Pan, Yueqi Song, Bowen Li, Jaskirat Singh, Hoang H

    Xingyao Wang, Boxuan Li, Yufan Song, Frank F. Xu, Xiangru Tang, Mingchen Zhuge, Jiayi Pan, Yueqi Song, Bowen Li, Jaskirat Singh, Hoang H. Tran, Fuqiang Li, Ren Ma, Mingzhang Zheng, Bill Qian, Yanjun Shao, Niklas Muennighoff, Yizhe Zhang, Binyuan Hui, Junyang Lin, Robert Brennan, Hao Peng, Heng Ji, and Graham Neubig. 2025. OpenHands: An Open Platform for A...

    Pith/arXiv arXiv 2025

  21. [21]

    Chunqiu Steven Xia, Yinlin Deng, Soren Dunn, and Lingming Zhang

  22. [22]

    arXiv:2407.01489 [cs.SE] https://arxiv.org/abs/2407.01489

    Agentless: Demystifying LLM-based Software Engineering Agents. arXiv:2407.01489 [cs.SE] https://arxiv.org/abs/2407.01489

    Pith/arXiv arXiv

  23. [23]

    Chunqiu Steven Xia, Zhe Wang, Yan Yang, Yuxiang Wei, and Lingming Zhang

  24. [24]

    Live-SWE-agent: Can Software Engineering Agents Self-Evolve on the Fly? arXiv:2511.13646 [cs.SE] https://arxiv.org/abs/2511.13646

    arXiv

  25. [25]

    Boyang Yang, Jiadong Ren, Shunfu Jin, Yang Liu, Feng Liu, Bach Le, and Haoye Tian. 2025. Enhancing repository-level software repair via repository-aware knowledge graphs. arXiv:2503.21710 [cs.SE] https://arxiv.org/abs/2503.21710

    arXiv 2025

  26. [26]

    Jimenez, Alexander Wettig, Kilian Lieret, Shunyu Yao, Karthik Narasimhan, and Ofir Press

    John Yang, Carlos E. Jimenez, Alexander Wettig, Kilian Lieret, Shunyu Yao, Karthik Narasimhan, and Ofir Press. 2024. SWE-agent: Agent-Computer In- terfaces Enable Automated Software Engineering. InAdvances in Neural Informa- tion Processing Systems, A. Globerson, L. Mackey, D. Belgrave, A. Fan, U. Paquet, J. Tomczak, and C. Zhang (Eds.), Vol. 37. Curran A...

    doi:10.52202/079017-1601 2024

  27. [27]

    Yuntong Zhang, Haifeng Ruan, Zhiyu Fan, and Abhik Roychoudhury. 2024. Au- toCodeRover: Autonomous Program Improvement. arXiv:2404.05427 [cs.SE] https://arxiv.org/abs/2404.05427

    Pith/arXiv arXiv 2024

  28. [28]

    Li Zhong, Zilong Wang, and Jingbo Shang. 2024. Debug like a Human: A Large Language Model Debugger via Verifying Runtime Execution Step-by-step. arXiv:2402.16906 [cs.SE] https://arxiv.org/abs/2402.16906

    Pith/arXiv arXiv 2024