Pith. sign in

REVIEW 4 major objections 6 minor 31 references

UDuo: Universal Dual Optimization Framework for Online Matching

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read UDuo replaces the stationary stochastic arrival assumption with forecasted user-arrival representation vectors and claims asymptotically optimal allocation with budget-feasibility guarantees in dynamic environments.

desk verdict A promising reformulation of the online matching dual, but the paper asserts its main theoretical claims without proof and is too unfinished to review. read the letter →

arxiv 2505.22243 v1 pith:4X7MNHX4 submitted 2025-05-28 cs.IR cs.LG

Bin Li , Diwei Liu , Zehong Hu , Jia Jia This is my paper
classification cs.IRcs.LG
keywords onlineresourceallocationbudgetconstraintsdualoptimizationuserarrivaldistributiondrifttime-seriesforecastingpacingmulti-scenariotransformerdynamicpricing
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proposes UDuo, a framework for online resource allocation under budget constraints that abandons the classical stationary stochastic arrival assumption. Instead of estimating a fixed user distribution, UDuo builds a time-indexed representation of user arrivals, forecasts its future values with a time-series model, and binary-searches a dual variable to make allocation decisions. The paper argues this achieves asymptotically optimal solutions with budget-feasibility guarantees in dynamic environments, and reports online experiments in food-delivery pricing where it improves orders, GMV, and profit over a stochastic-model baseline. The practical point is that online matching can be driven by short-horizon forecasts of a compressed arrival summary rather than by a long-run stationary distribution.

What carries the argument

The central object is the temporal user arrival representation vector $v_t(\lambda) = \sum_i \max_j (r_{ij} - \lambda c_{ij})$, which collapses the population's best adjusted rewards into a one-dimensional function of the dual variable $\lambda$. UDuo forecasts future values of this vector rather than the raw arrival distribution, then binary-searches the discretized dual objective $\lambda B_t + v_t(\lambda)$ over the grid $\Lambda$ to obtain $\lambda_t^*$, which feeds the decision rule $x_{ij}=1$ iff $j=\arg\max_j (r_{ij}-\lambda_t^* c_{ij})$.

What would settle it

Run UDuo on a synthetic user-arrival process with a known offline optimum, apply gradual and abrupt distribution drift, and compare the online allocation and budget spend against the offline LP optimum; if forecast error on $v_{t+H}(\lambda)$ is not tightly coupled to suboptimality or budget violation, the claimed guarantees fail.

Watch

Extended reading notes

Core claim

The central proposal is that the dual objective for the fractional matching LP can be re-expressed through the user arrival representation vector $v(\lambda)=\sum_i\max_j(r_{ij}-\lambda c_{ij})$, so the online problem becomes: forecast $v_{t+H}(\lambda)$, pace the budget, and binary-search the grid $\Lambda$ for $\lambda_t^*$ using $\lambda_t^*=\arg\min_{\lambda_i\in\Lambda}[\lambda_i B + v_t(\lambda_i)]$. UDuo claims this forecast-then-search procedure achieves equivalent optimality to gradient descent with $O(\log|C|\,1/\epsilon)$ complexity, keeps the total budget feasible through pacing $\sum_t B_t\le B$, and adapts to distribution drift through a sliding-window update. On Eleme's online traffic the paper reports that UDuo lifts orders by 0.72%, GMV by 3.63%, and profit by 3.37% relative to a stochastic online-gradient-descent baseline, and that its MiFormer forecaster reduces MSE by 8% across user-arrival-vector and benchmark datasets.

Load-bearing premise

The load-bearing premise is that the forecasted user-arrival summaries $v_{t+H}(\lambda)$ are accurate enough for the grid search in Eq. (6) to return a near-optimal dual solution, and that the fixed grid $\Lambda$, centered at the stochastic model's solution, still contains the true optimal $\lambda$ after the distribution drifts.

Editorial extensions

If this is right

  • Replacing stationary stochastic arrivals with forecasted representation vectors gives a principled way to keep dual solutions fresh in nonstationary environments.
  • The binary-search procedure over a discretized grid achieves the same solution as gradient descent at $O(\log|C|\,1/\epsilon)$ complexity, so the forecasting step, not the optimizer, is the practical bottleneck.
  • Budget pacing plus the total-budget constraint $\sum_t B_t \le B$ turns a global budget constraint into per-period pacing, enabling proactive allocation across time slots.
  • On the reported A/B test, UDuo improves orders by 0.72%, GMV by 3.63%, and profit by 3.37% over the stochastic-model baseline, while the MiFormer forecaster cuts MSE by 8% on held-out forecasting benchmarks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If one could bound forecast error in $v_t(\lambda)$, UDuo's framework would extend naturally to multiple resource constraints by adding one dual variable per constraint, a direction the paper only sketches as future work.
  • The representation $v_t(\lambda)$ collapses an entire user population into a scalar curve; a testable extension is to compare this compressed forecast against forecasting the full arrival distribution and then aggregating, to see when the compression loses information.
  • The feasibility guarantee is only as strong as the pacing scheme; a testable extension is an online controller that adjusts $B_t$ from realized spend, protecting feasibility when historical pacing patterns fail.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 6 minor

Summary. The paper proposes UDuo, a dual-optimization framework for online matching under budget constraints. It replaces the stationary stochastic arrival model with time-series forecasts of a user-arrival representation vector v(λ) defined in Eq. (4), selects the dual variable by a grid search in Eq. (6), and introduces budget pacing strategies plus a multi-scene transformer (MiFormer) for forecasting. The authors report online A/B tests on the Eleme food-delivery platform and forecasting benchmarks, and the abstract claims that UDuo 'achieves asymptotically optimal solutions with constraint feasibility guarantees in dynamic environments.'

Significance. The v(λ) reformulation in Eq. (4) is a clean and useful way to separate user arrival dynamics from resource scarcity, and the paper points to a practically relevant problem: adapting online resource allocation to nonstationary arrival patterns. The deployment experience and the MiFormer forecasting architecture are also potentially valuable engineering contributions. However, the paper's headline claims of asymptotic optimality, feasibility guarantees, and 'rigorous theoretical validity' are not supported by any theorem, lemma, or proof, and the reported experimental evidence lacks the statistical detail needed to verify them. As presented, the significance of the framework is therefore not established.

major comments (4)
  1. [§3.3, Eq. (6)] The search grid Λ = {λ_low + kϵ} is centered at λ*′, the solution of the stochastic arrival model, with half-width Kϵ/2. The paper claims asymptotic optimality in dynamic environments, but it provides no bound on how far the true optimal dual variable λ* can drift from λ*′, and no mechanism to expand Λ when drift is large. Under any distribution shift for which λ* lies outside [λ*′ − Kϵ/2, λ*′ + Kϵ/2], the argmin in Eq. (6) cannot equal λ*, so the claimed optimality fails. A regret bound or drift bound that accounts for this truncation and discretization is required.
  2. [§3.1, §3.4, §5] The manuscript repeatedly asserts 'rigorous theoretical guarantees on budget feasibility and regret bounds' (§3.1) and states that UDuo's feasibility guarantees are 'theoretically proving' (§5), yet no theorem, lemma, or proof appears anywhere in the paper. The only formal statement is the O(log|C| 1/ϵ) complexity of binary search, which concerns computational cost, not optimality or regret. Moreover, the pacing module only guarantees Σ_t B_t ≤ B; it does not imply that actual cumulative spend Σ_t Σ_ij c_ij x_ij ≤ B when decisions are based on forecast-dependent λ_t. The conditions under which forecast errors preserve budget feasibility are never stated.
  3. [Table 1 and Table 2] The text states that Table 1 shows 'statistically significant improvements in all key metrics,' but the table reports only percentage lifts with no sample sizes, confidence intervals, or significance tests. Table 2 reports MSE and MAE averaged over horizons without error bars or significance tests, despite the text claiming a robust 8% improvement. Since these tables are the sole empirical support for the headline claims of efficiency and generalization, the experimental claims are unsubstantiated as reported.
  4. [NeurIPS Paper Checklist] The paper's own checklist leaves the answers to 'Claims', 'Limitations', 'Theory assumptions and proofs', 'Experiment statistical significance', and related items as [TODO]. This is not a stylistic issue: it confirms the absence of the required theoretical and statistical support for the central claims, and no limitations section is provided elsewhere in the manuscript.
minor comments (6)
  1. [Abstract] There is a capitalization inconsistency ('We' after 'In this work,') and the paper's name is used informally; please copyedit throughout.
  2. [Table 1 caption] The caption contains a typo: 'Elme's' should be 'Eleme's'.
  3. [Eq. (4)] The notation |C| is used both for the cardinality of the user set and as a set index, which is confusing; please use a separate index set notation such as i = 1, ..., m.
  4. [§3.1] The phrase 'replacing the neighboring optimal solution approximation' is undefined and should be clarified.
  5. [Eq. (7)] The gating scaling factor γ is set to 1.5 without justification or ablation; please provide evidence for this choice or state that it is a tuning hyperparameter.
  6. [Table 2 caption] The caption ends with the incomplete sentence 'Our full results are in.'; this appears to be a placeholder and should be completed or removed.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation found: the dual reformulation is a genuine identity and the forecasting model is benchmarked externally, but the dynamic-optimality claim rests on an unproven grid-centering assumption.

full rationale

The paper's derivation is not circular. v(λ) in Eq. 4 is exactly the second term of the dual objective in Eq. 2, so the reformulation L(λ) = λB + v(λ) is a genuine algebraic identity, not a quantity fitted to the outcome it later predicts. The online decision rule in Eq. 3 is the standard dual-optimality condition. λ*_t in Eq. 6 is obtained by minimizing over a discrete grid centered at λ*' from the stochastic arrival model, so the method presupposes that the dynamic optimum stays within Kε/2 of the stochastic optimum, but this is an unverified assumption and an error-bound gap, not a definitional equivalence. The forecasting model MiFormer is evaluated on external benchmarks and production data independently of the allocation outcome, so its evaluation is not forced by construction. The paper contains no load-bearing self-citations: the references are standard optimizers, forecasting baselines, and prior arrival-drift work by other authors, and no uniqueness theorem is invoked. The claims of 'asymptotically optimal solutions' and 'theoretically proving ... feasibility guarantees' are unsupported because no theorem or proof appears anywhere in the manuscript; that is a completeness and correctness problem, not circularity. Score 1 reflects the mild concern that the dynamic-optimality claim is implicitly conditional on the centered grid, but there is no circular step to report.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

No new physical entities are postulated. The temporal user arrival representation vector is a mathematical reformulation of the dual objective, not an invented thing. The main unexamined burden is the accuracy assumption on the forecast, which is ad hoc to this paper and unquantified.

free parameters (5)
  • γ in MiFormer gating (Eq. 7) = 1.5
    Set by hand with no sensitivity analysis; scales the element-wise gating product in the scene-conditioned embedding.
  • λ discretization precision ϵ and grid size K = Not disclosed
    Eq. 6 searches over the grid λ_low + kϵ; the paper gives no analysis of how ϵ or K affect the claimed optimality or feasibility.
  • Grid center λ*' from stochastic arrival model = Not disclosed
    The λ search window is centered on the baseline solution being replaced; no ablation studies the sensitivity to this anchor.
  • Sliding window length L and forecast horizon H = Not disclosed for UAV datasets
    Section 3.3 uses an adaptive sliding window W_t = v_{t-L},...,v_t and horizons H ∈ {12, 24, 48, 96}; these choices are task-specific and not analyzed.
  • Training hyperparameters (batch size, learning rate, hidden size, depth) = 1024, 0.012, 512, 4/1 layers
    Selected via grid search on validation sets; tuning is standard but directly affects the reported forecast improvements.
assumptions (5)
  • standard math LP relaxation and strong duality hold for the budget-constrained matching problem (Eq. 1 to Eq. 2)
    The derivation is correct and standard, assuming the integer constraint on x_ij can be relaxed and the dual gap is zero.
  • domain assumption Reward scores r_ij and costs c_ij are known beforehand from a frozen uplift model
    Section 3.1 assumes these inputs are accurate during online operations, and the entire v(λ) sequence depends on them.
  • ad hoc to paper Future v_t(λ) can be forecast with bounded error sufficiently small for near-optimal allocation
    Section 3.3 states forecasts are made with an adaptive sliding window, but no bound links forecast error to regret or budget feasibility.
  • ad hoc to paper The optimal λ lies on the discrete grid Λ centered at the stochastic model's solution
    Eq. 6 restricts the search to Λ = {λ_low + kϵ} with λ_low derived from λ*' of the stochastic model; no argument shows the true optimal λ remains in this window under drift.
  • domain assumption Budget pacing produces sequences with sum B_t ≤ B independent of realized demand
    Section 3.2 defines temporal and generative pacing but does not prove how global feasibility is maintained when forecasts are wrong.

how reviews work

0 comments
Cite this review

Pith. "Pith review of UDuo: Universal Dual Optimization Framework for Online Matching." pith.science (2026). https://pith.science/paper/4X7MNHX4

@misc{pith2026250522243,
  author       = {Pith},
  title        = {Pith review of: UDuo: Universal Dual Optimization Framework for Online Matching},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4X7MNHX4}},
  note         = {Machine review of arXiv:2505.22243}
}
read the original abstract

Online resource allocation under budget constraints critically depends on proper modeling of user arrival dynamics. Classical approaches employ stochastic user arrival models to derive near-optimal solutions through fractional matching formulations of exposed users for downstream allocation tasks. However, this is no longer a reasonable assumption when the environment changes dynamically. In this work, We propose the Universal Dual optimization framework UDuo, a novel paradigm that fundamentally rethinks online allocation through three key innovations: (i) a temporal user arrival representation vector that explicitly captures distribution shifts in user arrival patterns and resource consumption dynamics, (ii) a resource pacing learner with adaptive allocation policies that generalize to heterogeneous constraint scenarios, and (iii) an online time-series forecasting approach for future user arrival distributions that achieves asymptotically optimal solutions with constraint feasibility guarantees in dynamic environments. Experimental results show that UDuo achieves higher efficiency and faster convergence than the traditional stochastic arrival model in real-world pricing while maintaining rigorous theoretical validity for general online allocation problems.

Figures

Figures reproduced from arXiv: 2505.22243 by the authors.

Figure 1
Figure 1. Illustration of the UDuo framework. Take the food delivery scenario as an example: When a user initiates a coupon redemption request, we first apply a pretrained uplift model with frozen parameters to generate response scores for multi-treatment coupon denominations, capturing each user’s incremental response propensity to different discounts. Subsequently, the target user cohort is aggregated into temporal sequence… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

31 extracted references · 22 canonical work pages

  1. [1]

    Robust online matching with user arrival distribution drift

    Yu-Hang Zhou, Chen Liang, Nan Li, Cheng Yang, Shenghuo Zhu, and Rong Jin. Robust online matching with user arrival distribution drift. InProceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 459–466, 2019

    work page 2019

  2. [2]

    On the limited memory bfgs method for large scale optimization

    Dong C Liu and Jorge Nocedal. On the limited memory bfgs method for large scale optimization. Mathematical programming, 45(1):503–528, 1989

    1989

  3. [3]

    Direct heterogeneous causal learning for resource allocation problems in marketing

    Hao Zhou, Shaoming Li, Guibin Jiang, Jiaqi Zheng, and Dong Wang. Direct heterogeneous causal learning for resource allocation problems in marketing. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 5446–5454, 2023

    work page 2023

  4. [4]

    Pepnet: Parameter and embedding personalized network for infusing with personalized prior information

    Jianxin Chang, Chenbin Zhang, Yiqun Hui, Dewei Leng, Yanan Niu, Yang Song, and Kun Gai. Pepnet: Parameter and embedding personalized network for infusing with personalized prior information. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 3795–3804, 2023

    work page 2023

  5. [5]

    itransformer: Inverted transformers are effective for time series forecasting

    Yong Liu, Tengge Hu, Haoran Zhang, Haixu Wu, Shiyu Wang, Lintao Ma, and Mingsheng Long. itransformer: Inverted transformers are effective for time series forecasting. arXiv preprint arXiv:2310.06625, 2023

    arXiv 2023

  6. [6]

    Are transformers effective for time series forecasting? In Proceedings of the AAAI conference on artificial intelligence, volume 37, pages 11121–11128, 2023

    Ailing Zeng, Muxi Chen, Lei Zhang, and Qiang Xu. Are transformers effective for time series forecasting? In Proceedings of the AAAI conference on artificial intelligence, volume 37, pages 11121–11128, 2023

    2023

  7. [7]

    A time series is worth 64 words: Long-term forecasting with transformers

    Yuqi Nie, Nam H Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. A time series is worth 64 words: Long-term forecasting with transformers. In International Conference on Learning Representations, 2023

    2023

  8. [8]

    Timesnet: Temporal 2d-variation modeling for general time series analysis

    Haixu Wu, Tengge Hu, Yong Liu, Hang Zhou, Jianmin Wang, and Mingsheng Long. Timesnet: Temporal 2d-variation modeling for general time series analysis. In International Conference on Learning Representations, 2023

    2023

Show all 31 references
  1. [9]

    Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting

    Tian Zhou, Ziqing Ma, Qingsong Wen, Xue Wang, Liang Sun, and Rong Jin. Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting. In International Conference on Machine Learning, pages 27268–27286. PMLR, 2022

    2022

  2. [10]

    Autoformer: Decomposition trans- formers with auto-correlation for long-term series forecasting

    Haixu Wu, Jiehui Xu, Jianmin Wang, and Mingsheng Long. Autoformer: Decomposition trans- formers with auto-correlation for long-term series forecasting. Advances in Neural Information Processing Systems, 34:22419–22430, 2021

    2021

  3. [11]

    Less is more: Fast multivariate time series forecasting with light sampling-oriented mlp structures

    Tianping Zhang, Yizhuo Zhang, Wei Cao, Jiang Bian, Xiaohan Yi, Shun Zheng, and Jian Li. Less is more: Fast multivariate time series forecasting with light sampling-oriented mlp structures. arXiv preprint arXiv:2207.01186, 2022

    2022 arXiv

  4. [12]

    Informer: Beyond efficient transformer for long sequence time-series forecasting

    Haoyi Zhou, Shanghang Zhang, Jieqi Peng, Shuai Zhang, Jianxin Li, Hui Xiong, and Wancai Zhang. Informer: Beyond efficient transformer for long sequence time-series forecasting. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 11106–11115, 2021

    2021

  5. [13]

    Reformer: The efficient transformer

    Nikita Kitaev, Łukasz Kaiser, and Anselm Levskaya. Reformer: The efficient transformer. In International Conference on Learning Representations, 2020

    2020

  6. [14]

    Another look at measures of forecast accuracy

    Rob J Hyndman and Anne B Koehler. Another look at measures of forecast accuracy. Interna- tional journal of forecasting, 22(4):679–688, 2006

    2006

  7. [15]

    [Yes] " is generally preferable to

    Cort J Willmott and Kenji Matsuura. Advantages of the mean absolute error (mae) over the root mean square error (rmse) in assessing average model performance. Climate research, 30(1): 79–82, 2005. 6 A Implementation Details Pacing Strategy. We support two pacing strategies: ti...

    2005

  8. [16]

    • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations

    Claims Question: Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that the abstract and introduction do not include the claims made in the pap...

  9. [17]

    Limitations

    Limitations Question: Does the paper discuss the limitations of the work performed by the authors? Answer: [TODO] Justification: [TODO] 8 Guidelines: • The answer NA means that the paper has no limitation while the answer No means that the paper has limitations, but those are ...

  10. [18]

    • All the theorems, formulas, and proofs in the paper should be numbered and cross- referenced

    Theory assumptions and proofs Question: For each theoretical result, does the paper provide the full set of assumptions and a complete (and correct) proof? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that the paper does not include theoretical result...

  11. [19]

    Experimental result reproducibility Question: Does the paper fully disclose all the information needed to reproduce the main ex- perimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and da...

  12. [20]

    • Please see the NeurIPS code and data submission guidelines ( https://nips.cc/ public/guides/CodeSubmissionPolicy) for more details

    Open access to data and code Question: Does the paper provide open access to the data and code, with sufficient instruc- tions to faithfully reproduce the main experimental results, as described in supplemental material? Answer: [TODO] Justification: [TODO] Guidelines: • The a...

  13. [21]

    • The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them

    Experimental setting/details Question: Does the paper specify all the training and test details (e.g., data splits, hyper- parameters, how they were chosen, type of optimizer, etc.) necessary to understand the results? Answer: [TODO] Justification: [TODO] Guidelines: • The ans...

  14. [22]

    Experiment statistical significance Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that the...

  15. [23]

    • The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage

    Experiments compute resources Question: For each experiment, does the paper provide sufficient information on the com- puter resources (type of compute workers, memory, time of execution) needed to reproduce the experiments? Answer: [TODO] Justification: [TODO] Guidelines: • T...

  16. [24]

    • If the authors answer No, they should explain the special circumstances that require a deviation from the Code of Ethics

    Code of ethics Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that the authors have not reviewed th...

  17. [25]

    • If the authors answer NA or No, they should explain why their work has no societal impact or why the paper does not address societal impact

    Broader impacts Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that there is no societal impact of the work performed. • If th...

  18. [26]

    Safeguards Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pretrained language models, image generators, or scraped datasets)? Answer: [TODO] Justification: [TODO] Guidel...

  19. [27]

    • The authors should cite the original paper that produced the code package or dataset

    Licenses for existing assets Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected? Answer: [TODO] Justification: [TODO] Guidelin...

  20. [28]

    • Researchers should communicate the details of the dataset/code/model as part of their submissions via structured templates

    New assets Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets? Answer: [TODO] Justification: [TODO] Guidelines: • The answer NA means that the paper does not release new assets. • Researchers should communica...

  21. [29]

    Crowdsourcing and research with human subjects Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)? A...

  22. [30]

    • Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research

    Institutional review board (IRB) approvals or equivalent for research with human subjects Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals...

  23. [31]

    Declaration of LLM usage Question: Does the paper describe the usage of LLMs if it is an important, original, or non-standard component of the core methods in this research? Note that if the LLM is used only for writing, editing, or formatting purposes and does not impact the ...

    2025

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.