Pith. sign in

REVIEW 2 major objections 50 references

Combustion reaction-diffusion equations in multi-branch cylindrical domains admit a unique entire solution that is a transition front from 0 to 1, and every such front shares the same global mean speed as the planar wave.

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:01 UTC pith:6MR2VKZK

load-bearing objection Abstract-only read of a clean multi-branch transition-front paper; complete-propagation is load-bearing but openly stated, and the supplied full text is the wrong manuscript. the 2 major comments →

arxiv 2603.22907 v2 pith:6MR2VKZK submitted 2026-03-24 math.AP

Transition fronts of combustion reaction-diffusion equations in domains with multiple cylindrical branches

Yang-Yang Yan , Wei-Jie Sheng , Zhi-Cheng Wang This is my paper
classification math.AP MSC 35K5735C0735B40
keywords combustion reaction-diffusiontransition frontsentire solutionscylindrical branchesplanar traveling frontsglobal mean speedcomplete propagation
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.

This paper studies how combustion-type reaction-diffusion equations spread through domains made of several cylindrical branches joined together. It constructs a unique entire solution that, far in the past, looks like planar traveling fronts in some branches and is near the unburned state 0 elsewhere. Under a complete-propagation assumption, that solution eventually invades the remaining branches as planar fronts (up to finite shifts), fills the rest of the domain with the burned state 1, and is therefore a transition front whose global mean speed equals the classical planar wave speed. The same complete-propagation idea, applied to fronts that start from a single branch, implies that every transition front connecting 0 and 1 invades the whole domain and that all such fronts travel at that same mean speed. Two geometric conditions on the domain are given that guarantee the propagation assumptions hold. The result matters because it shows that the long-time invasion speed is universal: it does not depend on which branches light first or on how the front is arranged, only on the planar speed of the reaction.

Core claim

There exists a unique time-increasing entire solution that behaves like planar traveling fronts in selected branches and tends to 0 in the rest of the domain as time goes to minus infinity; under complete propagation this solution becomes a transition front connecting 0 and 1 whose global mean speed equals the planar wave speed, and under single-branch complete-propagation assumptions every transition front connecting 0 and 1 propagates completely and shares that same global mean speed.

What carries the argument

The unique time-increasing entire solution that matches planar traveling fronts in some cylindrical branches as t→−∞; under the complete-propagation hypothesis it is shown to be a transition front from 0 to 1 with global mean speed equal to the planar wave speed, and that speed is then shown to be shared by all transition fronts.

Load-bearing premise

The complete-propagation assumptions: that the constructed entire solution and single-branch front-like solutions eventually invade every branch and converge to the burned state 1; if those fail for some geometries, the transition-front and common-speed conclusions do not follow.

What would settle it

Exhibit a multi-branch cylindrical domain in which a transition front connecting 0 and 1 either fails to invade some branch or has a global mean speed different from the planar wave speed, or show that two distinct transition fronts in the same domain have unequal global mean speeds.

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

Share X Bluesky LinkedIn Reddit HN

If this is right

  • The constructed entire solution is a genuine transition front from the unburned state 0 to the burned state 1.
  • Its global mean speed equals the classical planar traveling-wave speed of the combustion nonlinearity.
  • Under single-branch complete propagation, every transition front connecting 0 and 1 invades the whole domain.
  • All transition fronts connecting 0 and 1 share the same global mean speed, independent of how the front is initiated.
  • Two explicit geometric conditions on the branched domain are enough to guarantee the complete-propagation assumptions.

Where Pith is reading between the lines

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

  • The result suggests that in sufficiently regular multi-cylinder geometries the long-time invasion speed is determined solely by the one-dimensional planar wave, so local geometric details only produce bounded phase shifts.
  • If complete propagation fails in some thin or highly bent junctions, one might still have incomplete fronts whose effective speeds differ by branch; the paper’s geometric conditions mark a natural boundary for that possibility.
  • The uniqueness of the entire solution that “lights” only selected branches as t→−∞ may serve as a building block for classifying all possible asymptotic invasion patterns in branched media.

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

2 major / 0 minor

Summary. The manuscript studies combustion-type reaction-diffusion equations in unbounded domains consisting of multiple cylindrical branches. It claims existence and uniqueness of a time-increasing entire solution that, as t o-∞, behaves like planar traveling fronts in some branches and tends to 0 elsewhere. Under an explicit complete-propagation assumption, this solution is shown to invade the remaining branches as planar fronts (up to finite shifts) and to converge to 1 elsewhere as t o+∞, thereby constituting a transition front connecting 0 and 1 whose global mean speed equals the planar wave speed. Under a further single-branch complete-propagation hypothesis, every transition front connecting 0 and 1 is proved to propagate completely and to share the same global mean speed. Two sufficient geometric conditions on the multi-branch domain are stated to guarantee the complete-propagation assumptions.

Significance. If the arguments hold, the work would give a clean description of transition fronts and their common global mean speed for combustion nonlinearities in multi-branch cylindrical domains, extending the planar-wave theory to a geometrically richer class of unbounded domains. The explicit isolation of complete propagation as a hypothesis, together with two geometric criteria that imply it, is a useful organizational contribution: it separates the construction of the entire solution from the invasion question and supplies concrete conditions under which the invasion occurs. The uniqueness-of-speed statement for all transition fronts would be a strong structural result. Because the supplied full-text block is an unrelated computer-vision paper, none of these claims can be verified from proofs, estimates or geometric statements; the assessment of significance therefore remains conditional on the actual mathematical content matching the abstract.

major comments (2)
  1. The full manuscript text supplied for arXiv:2603.22907 is an unrelated computer-vision paper (arXiv:2603.22908) on black-box domain adaptation. Consequently no theorems, lemmas, estimates or geometric criteria can be inspected. The load-bearing complete-propagation hypotheses and the two sufficient geometric conditions announced in the abstract cannot be checked for correctness, sharpness or applicability. Until the correct math.AP manuscript is provided, the central claims remain unverifiable.
  2. Even at the abstract level the complete-propagation assumptions are essential for the transition-front and common-speed conclusions. Without access to the precise geometric conditions that are claimed to imply them, it is impossible to assess whether those conditions are natural, whether they cover interesting multi-branch geometries, or whether counter-examples exist when they fail. This gap is load-bearing for the paper’s main asymptotic results.

Circularity Check

0 steps flagged

No significant circularity: complete-propagation is an explicit hypothesis with separate sufficient geometric conditions, not a definitional or fitted loop.

full rationale

Only the abstract of arXiv:2603.22907 is available for the claimed paper; the supplied full-text block is an unrelated CV manuscript (arXiv:2603.22908) and cannot be used to inspect proofs. From the abstract alone, the derivation chain is non-circular. Existence and uniqueness of a time-increasing entire solution that matches planar fronts in some branches and tends to 0 elsewhere as t o-∞ are established first, without invoking complete propagation. Complete propagation is then stated openly as an assumption under which that solution becomes a transition front connecting 0 and 1 whose global mean speed equals the planar wave speed, and under a further single-branch complete-propagation assumption every transition front propagates completely and shares that speed. Finally, two sufficient geometric conditions are supplied under which the complete-propagation hypotheses hold. Nothing is defined in terms of the claimed conclusion, no parameters are fitted to data and re-labeled as predictions, and no uniqueness theorem is imported solely via self-citation to force the result. The load-bearing hypotheses are acknowledged as such rather than smuggled in by construction. Score 0 is therefore the honest finding on the available text.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

Abstract-only review of a pure math.AP paper. No free parameters or invented physical entities appear. Load-bearing content consists of standard PDE background plus the paper's complete-propagation assumptions and geometric hypotheses. Full axiom list cannot be extracted without the manuscript body.

axioms (4)
  • domain assumption Combustion-type reaction-diffusion equation on a domain with multiple cylindrical branches (standard nonlinear RD setting with ignition-type or combustion nonlinearity).
    Stated as the object of study in the abstract; classical setting for planar-wave and transition-front theory.
  • ad hoc to paper Complete propagation: the constructed entire solution (and front-like solutions from a single branch) eventually invade all branches and converge to 1.
    Explicitly assumed for the main asymptotic, transition-front, and common-speed theorems; later partially justified by two geometric conditions.
  • domain assumption Existence of planar traveling fronts with a well-defined wave speed for the same combustion nonlinearity on a single cylinder.
    Used as the building block that the entire solution matches as t o- eq and as the reference speed for global mean speed.
  • ad hoc to paper Two (unspecified in abstract) sufficient geometric conditions on the multi-branch domain that imply complete propagation.
    Claimed at the end of the abstract as the conditions under which the complete-propagation assumptions hold.

pith-pipeline@v1.1.0-grok45 · 11177 in / 2687 out tokens · 27752 ms · 2026-07-13T20:01:12.756367+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Transition fronts of combustion reaction-diffusion equations in domains with multiple cylindrical branches." pith.science (2026). https://pith.science/paper/6MR2VKZK

@misc{pith2026260322907,
  author       = {Pith},
  title        = {Pith review of: Transition fronts of combustion reaction-diffusion equations in domains with multiple cylindrical branches},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6MR2VKZK}},
  note         = {Machine review of arXiv:2603.22907}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper is concerned with propagation dynamics for combustion reaction-diffusion equations in domains with multiple cylindrical branches. We first establish the existence and uniqueness of a time-increasing entire solution behaving like planar traveling fronts in some branches and converging to $0$ in the remaining part of the domain as $t\to-\infty$. Under the assumption of complete propagation, we then show that this entire solution propagates into the other branches in the form of planar traveling fronts (up to finite shifts) and converges to $1$ elsewhere as $t\to+\infty$. In particular, it is proved that this entire solution is a transition front connecting $0$ and $1$, whose global mean speed coincides with the planar wave speed. By assuming complete propagation for front-like solutions originating from single branch, we further prove that every transition front connecting $0$ and $1$ propagates completely. Moreover, we show that the global mean speed is independent of the choice of transition front. Namely, all transition fronts connecting $0$ and $1$ share the same global mean speed.Finally, we provide two sufficient geometric conditions under which the complete propagation assumptions are satisfied.

discussion (0)

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

Reference graph

Works this paper leans on

50 extracted references · 2 linked inside Pith

  1. [1]

    To address this issue, black-box domain adaptation (BBDA)

    when the source model is available, the risk of private information leakage remains. To address this issue, black-box domain adaptation (BBDA)

  2. [2]

    Zhang, J

    treats the source model as a black-box predictor, trans- Z. Zhang, J. Li, W. Xue, X. Cheng, J. Zhang, and S. Chen are with the School of Computer Science and Engineering, Tianjin University of Technol- ogy, Tianjin 300384, China. (zzhe0124@stud.tjut.edu.cn; jing li@tju.edu.cn; xuewanli@email.tjut.edu.cn; xu.cheng@ieee.org; zjh@ieee.org; sy@ieee.org ). Q. ...

  3. [3]

    incorporate the vision-language (ViL) model named CLIP

  4. [4]

    in target model training. Benefiting from diverse training data and semantically driven objectives, ViLs capture general semantic knowledge beyond pixel-level or local features, mak- ing them more robust to distribution shifts. Nevertheless, directly leveraging ViLs in the BBDA setting is non-trivial. In particular, the knowledge encoded in ViLs is often ...

    Pith/arXiv arXiv 2026

  5. [5]

    Clip-guided black-box domain adaptation of image classification,

    L. Tian, M. Ye, L. Zhou, and Q. He, “Clip-guided black-box domain adaptation of image classification,”Signal, Image and Video Processing, vol. 18, no. 5, pp. 4637–4646, 2024. I, II-B, II-B, I, II, III, IV-B, IV-C, IV-C

    2024

  6. [6]

    Learning transferable visual models from natural language supervision,

    A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P. Mishkin, J. Clarket al., “Learning transferable visual models from natural language supervision,” inInternational conference on machine learning. PMLR, 2021, pp. 8748–8763. I, II-B, II-C, III-B1

    2021

  7. [7]

    Learning transferable features with deep adaptation networks,

    M. Long, Y . Cao, J. Wang, and M. Jordan, “Learning transferable features with deep adaptation networks,” inInternational conference on machine learning. PMLR, 2015, pp. 97–105. II-A

    2015

  8. [8]

    Unsupervised domain adaptation with residual transfer networks,

    M. Long, H. Zhu, J. Wang, and M. I. Jordan, “Unsupervised domain adaptation with residual transfer networks,”Advances in neural infor- mation processing systems, vol. 29, 2016. II-A

    2016

  9. [9]

    Domain-adversarial training of neural networks,

    Y . Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Lavi- olette, M. March, and V . Lempitsky, “Domain-adversarial training of neural networks,”Journal of machine learning research, vol. 17, no. 59, pp. 1–35, 2016. II-A

    2016

  10. [10]

    Domain prompt tuning via meta relabeling for unsupervised adversarial adaptation,

    X. Jin, C. Lan, W. Zeng, and Z. Chen, “Domain prompt tuning via meta relabeling for unsupervised adversarial adaptation,”IEEE Transactions on Multimedia, vol. 26, pp. 8333–8347, 2024. II-A

    2024

  11. [11]

    Wdan: A weighted discriminative adversarial network with dual classifiers for fine-grained open-set do- main adaptation,

    J. Li, L. Yang, Q. Wang, and Q. Hu, “Wdan: A weighted discriminative adversarial network with dual classifiers for fine-grained open-set do- main adaptation,”IEEE Transactions on Circuits and Systems for Video Technology, vol. 33, no. 9, pp. 5133–5147, 2023. II-A

    2023

  12. [12]

    Textadapter: Self-supervised domain adaptation for cross-domain text recognition,

    X.-Q. Liu, P.-F. Zhang, X. Luo, Z. Huang, and X.-S. Xu, “Textadapter: Self-supervised domain adaptation for cross-domain text recognition,” IEEE Transactions on Multimedia, vol. 26, pp. 9854–9865, 2024. II-A

    2024

  13. [13]

    Self-ensembling for visual domain adaptation,

    G. French, M. Mackiewicz, and M. Fisher, “Self-ensembling for visual domain adaptation,” inInternational Conference on Learning Represen- tations, 2018. II-A

    2018

  14. [14]

    Contrastive adaptation network for unsupervised domain adaptation,

    G. Kang, L. Jiang, Y . Yang, and A. G. Hauptmann, “Contrastive adaptation network for unsupervised domain adaptation,” inProceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2019, pp. 4893–4902. II-A

    2019

  15. [15]

    Independent feature decomposition and instance alignment for unsupervised domain adaptation,

    Q. He, S. Xiao, M. Ye, X. Zhu, F. Neri, and D. Hou, “Independent feature decomposition and instance alignment for unsupervised domain adaptation,” inProceedings of the thirty-second international joint conference on artificial intelligence, 2023, pp. 819–827. II-A

    2023

  16. [16]

    Enhancing multi-source open-set domain adaptation through nearest neighbor classification with self-supervised vision transformer,

    J. Li, L. Yang, and Q. Hu, “Enhancing multi-source open-set domain adaptation through nearest neighbor classification with self-supervised vision transformer,”IEEE Transactions on Circuits and Systems for Video Technology, vol. 34, no. 4, pp. 2648–2662, 2024. II-A

    2024

  17. [17]

    Progressive curriculum learning with teacher-student collaboration for source-free unsupervised domain adaptation,

    Q. Tian, J. Shen, L. Kang, W. Ou, J. Wan, and Z. Lei, “Progressive curriculum learning with teacher-student collaboration for source-free unsupervised domain adaptation,”IEEE Transactions on Circuits and Systems for Video Technology, vol. 36, no. 2, pp. 1627–1639, 2026. II-A

    2026

  18. [18]

    Consistency regularization for generalizable source-free domain adaptation,

    L. Tang, K. Li, C. He, Y . Zhang, and X. Li, “Consistency regularization for generalizable source-free domain adaptation,” inProceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) Workshops, October 2023, pp. 4323–4333. II-A

    2023

  19. [19]

    Source-free domain adaptation with class prototype discovery,

    L. Zhou, N. Li, M. Ye, X. Zhu, and S. Tang, “Source-free domain adaptation with class prototype discovery,”Pattern Recognition, vol. 145, p. 109974, 2024. II-A

    2024

  20. [20]

    Source- free domain adaptation via avatar prototype generation and adaptation,

    Z. Qiu, Y . Zhang, H. Lin, S. Niu, Y . Liu, Q. Du, and M. Tan, “Source- free domain adaptation via avatar prototype generation and adaptation,” inInternational Joint Conference on Artificial Intelligence, 2021. II-A

    2021

  21. [21]

    Source-free domain adaptation guided by vision and vision-language pre-training,

    W. Zhang, L. Shen, and C.-S. Foo, “Source-free domain adaptation guided by vision and vision-language pre-training,”International Jour- nal of Computer Vision, vol. 133, no. 2, pp. 844–866, 2025. II-A, I, II, III, IV-B

    2025

  22. [22]

    Proxy denoising for source-free domain adaptation,

    S. Tang, W. Su, Y . Gan, M. Ye, J. D. Zhang, and X. Zhu, “Proxy denoising for source-free domain adaptation,” inThe Thirteenth International Conference on Learning Representations, 2025. [Online]. Available: https://openreview.net/forum?id=FIj9IEPCKr II-A, I, II, III, IV-B

    2025

  23. [23]

    Reviewing the forgotten classes for domain adaptation of black-box predictors,

    S. Zhang, C. Shen, S. L ¨u, and Z. Zhang, “Reviewing the forgotten classes for domain adaptation of black-box predictors,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 15, 2024, pp. 16 830–16 837. II-B, I, II, III, IV-B

    2024

  24. [24]

    A separation and alignment framework for black-box domain adaptation,

    M. Xia, J. Zhao, G. Lyu, Z. Huang, T. Hu, G. Chen, and H. Wang, “A separation and alignment framework for black-box domain adaptation,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 14, 2024, pp. 16 005–16 013. II-B, I, II, III, IV-B

    2024

  25. [25]

    Black-box unsupervised domain adaptation with bi-directional atkinson-shiffrin memory,

    J. Zhang, J. Huang, X. Jiang, and S. Lu, “Black-box unsupervised domain adaptation with bi-directional atkinson-shiffrin memory,” in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 11 771–11 782. II-B

    2023

  26. [26]

    Vision-language models for vision tasks: A survey,

    J. Zhang, J. Huang, S. Jin, and S. Lu, “Vision-language models for vision tasks: A survey,”IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 46, no. 8, pp. 5625–5644, 2024. II-B

    2024

  27. [27]

    Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation,

    J. Li, D. Li, C. Xiong, and S. Hoi, “Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation,” inInternational conference on machine learning. PMLR, 2022, pp. 12 888–12 900. II-C

    2022

  28. [28]

    Reproducible scaling laws for contrastive language-image learning,

    M. Cherti, R. Beaumont, R. Wightman, M. Wortsman, G. Ilharco, C. Gordon, C. Schuhmann, L. Schmidt, and J. Jitsev, “Reproducible scaling laws for contrastive language-image learning,” inProceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2023, pp. 2818–2829. II-C

    2023

  29. [29]

    Scaling up visual and vision-language representation learning with noisy text supervision,

    C. Jia, Y . Yang, Y . Xia, Y .-T. Chen, Z. Parekh, H. Pham, Q. Le, Y .-H. Sung, Z. Li, and T. Duerig, “Scaling up visual and vision-language representation learning with noisy text supervision,” inInternational conference on machine learning. PMLR, 2021, pp. 4904–4916. II-C

    2021

  30. [30]

    A new data augmentation method based on mixup and dempster-shafer theory,

    Z. Zhang, H. Wang, J. Geng, X. Deng, and W. Jiang, “A new data augmentation method based on mixup and dempster-shafer theory,” IEEE Transactions on Multimedia, vol. 26, pp. 4998–5013, 2024. III-B1

    2024

  31. [31]

    Temporal ensembling for semi-supervised learn- ing,

    S. Laine and T. Aila, “Temporal ensembling for semi-supervised learn- ing,” inInternational Conference on Learning Representations, 2017. III-B3, IV-E

    2017

  32. [32]

    Clip-adapter: Better vision-language models with feature adapters,

    P. Gao, S. Geng, R. Zhang, T. Ma, R. Fang, Y . Zhang, H. Li, and Y . Qiao, “Clip-adapter: Better vision-language models with feature adapters,” International journal of computer vision, vol. 132, no. 2, pp. 581–595,

  33. [33]

    Learning to prompt for vision- language models,

    K. Zhou, J. Yang, C. C. Loy, and Z. Liu, “Learning to prompt for vision- language models,”International Journal of Computer Vision, vol. 130, no. 9, pp. 2337–2348, 2022. III-B3

    2022

  34. [34]

    Deep clustering for unsupervised learning of visual features,

    M. Caron, P. Bojanowski, A. Joulin, and M. Douze, “Deep clustering for unsupervised learning of visual features,” inProceedings of the European conference on computer vision, 2018, pp. 132–149. III-C

    2018

  35. [35]

    Source data-absent unsupervised domain adaptation through hypothesis transfer and labeling transfer,

    J. Liang, D. Hu, Y . Wang, R. He, and J. Feng, “Source data-absent unsupervised domain adaptation through hypothesis transfer and labeling transfer,”IEEE Transactions on Pattern Analysis and Machine Intelli- gence, vol. 44, no. 11, pp. 8602–8617, 2021. III-C

    2021

  36. [36]

    Maximum classifier discrepancy for unsupervised domain adaptation,

    K. Saito, K. Watanabe, Y . Ushiku, and T. Harada, “Maximum classifier discrepancy for unsupervised domain adaptation,” inProceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 3723–3732. I, II, III, IV-B

    2018

  37. [37]

    Homeomor- phism alignment for unsupervised domain adaptation,

    L. Zhou, M. Ye, X. Zhu, S. Xiao, X.-Q. Fan, and F. Neri, “Homeomor- phism alignment for unsupervised domain adaptation,” inProceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 18 699–18 710. I, II, III, IV-B

    2023

  38. [38]

    Domain adaptation via prompt learning,

    C. Ge, R. Huang, M. Xie, Z. Lai, S. Song, S. Li, and G. Huang, “Domain adaptation via prompt learning,”IEEE Transactions on Neural Networks and Learning Systems, 2023. I, II, III, IV-B

    2023

  39. [39]

    Prompt-based distribution alignment for unsupervised domain adapta- tion,

    S. Bai, M. Zhang, W. Zhou, S. Huang, Z. Luan, D. Wang, and B. Chen, “Prompt-based distribution alignment for unsupervised domain adapta- tion,” inProceedings of the AAAI conference on artificial intelligence, vol. 38, no. 2, 2024, pp. 729–737. I, II, III, IV-B

    2024

  40. [40]

    Bridging domain spaces for unsupervised domain adaptation,

    J. Na, H. Jung, H. J. Chang, and W. Hwang, “Bridging domain spaces for unsupervised domain adaptation,”Pattern Recognition, vol. 164, p. 111537, 2025. I, II, III, IV-B

    2025

  41. [41]

    Attracting and dispersing: A simple approach for source-free domain adaptation,

    S. Yang, S. Jui, J. Van De Weijeret al., “Attracting and dispersing: A simple approach for source-free domain adaptation,”Advances in Neural Information Processing Systems, vol. 35, pp. 5802–5815, 2022. I, II, III, IV-B

    2022

  42. [42]

    Source- free domain adaptation via target prediction distribution searching,

    S. Tang, A. Chang, F. Zhang, X. Zhu, M. Ye, and C. Zhang, “Source- free domain adaptation via target prediction distribution searching,” International journal of computer vision, vol. 132, no. 3, pp. 654–672,

  43. [43]

    Dual transferable knowledge interaction for source-free domain adaptation,

    M. Zhan, Z. Wu, J. Yang, L. Peng, J. Shen, and X. Zhu, “Dual transferable knowledge interaction for source-free domain adaptation,” Information Processing & Management, vol. 63, no. 1, p. 104302, 2026. I, II, III, IV-B

    2026

  44. [44]

    Leveraging multi-level regularization for efficient domain adaptation of black-box predictors,

    W. Li, W. Zhao, X. Pan, P. Zhou, and H. Yang, “Leveraging multi-level regularization for efficient domain adaptation of black-box predictors,” Pattern Recognition, vol. 165, p. 111611, 2025. I, II, III, IV-B

    2025

  45. [45]

    Learning like a real student: Black-box domain adaptation with preview, differentiated learning and review,

    Q. Tian, Z. Liu, and W. Ou, “Learning like a real student: Black-box domain adaptation with preview, differentiated learning and review,” Image and Vision Computing, p. 105806, 2025. I, II, III, IV-B 13

    2025

  46. [46]

    Adapting visual category models to new domains,

    K. Saenko, B. Kulis, M. Fritz, and T. Darrell, “Adapting visual category models to new domains,” inEuropean conference on computer vision. Springer, 2010, pp. 213–226. IV-A

    2010

  47. [47]

    Deep hashing network for unsupervised domain adaptation,

    H. Venkateswara, J. Eusebio, S. Chakraborty, and S. Panchanathan, “Deep hashing network for unsupervised domain adaptation,” inPro- ceedings of the IEEE conference on computer vision and pattern recognition, 2017, pp. 5018–5027. IV-A

    2017

  48. [48]

    Visda: The visual domain adaptation challenge,

    X. Peng, B. Usman, N. Kaushik, J. Hoffman, D. Wang, and K. Saenko, “Visda: The visual domain adaptation challenge,”arXiv preprint arXiv:1710.06924, 2017. IV-A

    Pith/arXiv arXiv 2017

  49. [49]

    Deep residual learning for image recognition,

    K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” inProceedings of the IEEE conference on computer vision and pattern recognition, 2016, pp. 770–778. IV-C

    2016

  50. [50]

    Visualizing data using t-sne,

    L. v. d. Maaten and G. Hinton, “Visualizing data using t-sne,”Journal of machine learning research, vol. 9, no. Nov, pp. 2579–2605, 2008. IV-E

    2008