Hash-NURF: Efficient Nested Transparent Object Reconstruction Using Multi-Resolution Hash Encoding

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Transparent object reconstruction is crucial in various domains, including 3D modelling and robotic perception. However, accurately reconstructing nested transparent objects remains challenging due to complex light interactions. Recent advances like NU-NeRF have shown promise but suffer from computational inefficiency. Here, we introduce Hash-NURF, a framework that integrates multi-resolution hash encoding with neural implicit representations to accelerate reconstruction. Specifically, we utilize hash-based NeRF and SDF for efficient optimization. To unbounded scenes, we added a contractive mapping strategy. We also incorporated special sampling and regularization techniques to improve the model's stability and help it converge faster. Our method significantly reduces training time by up to three times while maintaining comparable reconstruction quality. We validate our approach on synthetic datasets, demonstrating its efficacy in both outer and inner surface reconstruction of nested transparent objects. Visit our repository at https://github.com/SyouSanGin/Hash-NURF
Full text 22,010 characters · extracted from preprint-html · click to expand
Hash-NURF: Efficient Nested Transparent Object Reconstruction Using Multi-Resolution Hash Encoding | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Hash-NURF: Efficient Nested Transparent Object Reconstruction Using Multi-Resolution Hash Encoding Fan Gao, Yibo Zhao, Youcheng Cai, Ligang Liu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7805209/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 26 Feb, 2026 Read the published version in The Visual Computer → Version 1 posted 9 You are reading this latest preprint version Abstract Transparent object reconstruction is crucial in various domains, including 3D modelling and robotic perception. However, accurately reconstructing nested transparent objects remains challenging due to complex light interactions. Recent advances like NU-NeRF have shown promise but suffer from computational inefficiency. Here, we introduce Hash-NURF, a framework that integrates multi-resolution hash encoding with neural implicit representations to accelerate reconstruction. Specifically, we utilize hash-based NeRF and SDF for efficient optimization. To unbounded scenes, we added a contractive mapping strategy. We also incorporated special sampling and regularization techniques to improve the model's stability and help it converge faster. Our method significantly reduces training time by up to three times while maintaining comparable reconstruction quality. We validate our approach on synthetic datasets, demonstrating its efficacy in both outer and inner surface reconstruction of nested transparent objects. Visit our repository at https://github.com/SyouSanGin/Hash-NURF Signed Distance Field (SDF) Transparent object Reconstruction Neural Implicit Representations Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 26 Feb, 2026 Read the published version in The Visual Computer → Version 1 posted Editorial decision: Revision requested 29 Dec, 2025 Reviews received at journal 06 Dec, 2025 Reviewers agreed at journal 04 Dec, 2025 Reviews received at journal 02 Dec, 2025 Reviewers agreed at journal 04 Nov, 2025 Reviewers invited by journal 27 Oct, 2025 Editor assigned by journal 09 Oct, 2025 Submission checks completed at journal 09 Oct, 2025 First submitted to journal 08 Oct, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7805209","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":539700077,"identity":"0c47fe92-f0e7-4566-83a4-8f597855634d","order_by":0,"name":"Fan Gao","email":"","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":false,"prefix":"","firstName":"Fan","middleName":"","lastName":"Gao","suffix":""},{"id":539700083,"identity":"2b8f3bf3-97f9-4c90-b39c-6dfd6e8da349","order_by":1,"name":"Yibo Zhao","email":"","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":false,"prefix":"","firstName":"Yibo","middleName":"","lastName":"Zhao","suffix":""},{"id":539700085,"identity":"9d5e08c2-2020-44df-a3c3-7cc6b601a4df","order_by":2,"name":"Youcheng Cai","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA+klEQVRIiWNgGAWjYFACxgYQmQBiPYAKGRCthdkAqpqQFggAaWGTIEoLf/vhNomPbXZ5/NLt16p5/vyRZ2Bv3ibBUHMHpxaJM4ltkjPbkosl55wpu83bZmDYwHOsTILh2DOcWgwYEtukedsOJG64kZN2m7fBIIFBIsdMgrHhMG4t/A8hWvYDtRTz/AFqkX9DQIsEzBaJ9GPMPGwgW3jwa5G48bDZcsa55MQZN3KYJee2GRu28aQVWyQcw62Fvz/94Y0PZXaJ/TPSH35480dOnp/98MYbH2pwawECFgkIzQOJDjYQkYBPAzDSP0Bo9gf41Y2CUTAKRsGIBQAgW1KzRY7dzgAAAABJRU5ErkJggg==","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":true,"prefix":"","firstName":"Youcheng","middleName":"","lastName":"Cai","suffix":""},{"id":539700086,"identity":"2ae70745-eb04-4e6b-8d89-6ec7d712442a","order_by":3,"name":"Ligang Liu","email":"","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":false,"prefix":"","firstName":"Ligang","middleName":"","lastName":"Liu","suffix":""}],"badges":[],"createdAt":"2025-10-08 07:38:18","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7805209/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7805209/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s00371-026-04394-1","type":"published","date":"2026-02-26T15:58:15+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":95196337,"identity":"03090a66-d7bc-4527-997e-6d5121124bcf","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":5431,"visible":true,"origin":"","legend":"","description":"","filename":"7d80e8a7077d4e0b8fc068ea3ffcae49.json","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/5ffbddad1710ef75705c7b0d.json"},{"id":95196341,"identity":"e8c6f764-46fe-4677-a5a0-c36adc74ae6b","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"xml","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":105946,"visible":true,"origin":"","legend":"","description":"","filename":"7d80e8a7077d4e0b8fc068ea3ffcae491enriched.xml","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/9c1419aeb91210c52a68dbd0.xml"},{"id":95196339,"identity":"efeb6538-4837-4ff6-91f7-c73c2edd4a51","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":258049,"visible":true,"origin":"","legend":"","description":"","filename":"CL.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/39031b5192cc71c125bca7bd.pdf"},{"id":95227323,"identity":"68f33751-15e3-4cd4-8f05-8b54c81d4823","added_by":"auto","created_at":"2025-11-05 16:32:22","extension":"pdf","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":708890,"visible":true,"origin":"","legend":"","description":"","filename":"ab.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/aebcf42cbb986d7d20437482.pdf"},{"id":95196338,"identity":"3bf5c213-ffd3-4baf-9d32-d2d5464ba16d","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":19499,"visible":true,"origin":"","legend":"","description":"","filename":"bkgrecon.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/517a95ab23a970ab22fe0921.pdf"},{"id":95196340,"identity":"3716ad95-2a38-4607-b2cc-333b020ba1ea","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":1386164,"visible":true,"origin":"","legend":"","description":"","filename":"compexpouter.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/f3cb17d7aa6a28aa28a1c747.pdf"},{"id":95196344,"identity":"94b19f24-0820-4266-8235-8ddc148bf501","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":9,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":860020,"visible":true,"origin":"","legend":"","description":"","filename":"introbeg.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/d49285d362cddb38bcd07c0a.pdf"},{"id":95228393,"identity":"7b58af30-0478-4993-a687-47c3e2c84a19","added_by":"auto","created_at":"2025-11-05 16:33:42","extension":"pdf","order_by":12,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":652522,"visible":true,"origin":"","legend":"","description":"","filename":"mypipe.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/fb47d9c3fdd7da1e2961a8b0.pdf"},{"id":95196350,"identity":"7a606f55-addd-4918-95ad-0f04cac663e2","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":14,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":359710,"visible":true,"origin":"","legend":"","description":"","filename":"networkstructure.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/8e740740261b6e9157f721af.pdf"},{"id":95196348,"identity":"d89e6748-1911-4e64-abb8-c14d9d7fae2c","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":15,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":168917,"visible":true,"origin":"","legend":"","description":"","filename":"neusweight.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/9b1502b6d03fbf5ba7f53482.pdf"},{"id":95228133,"identity":"9bbad895-9c17-4d02-82f3-7d2925eb6555","added_by":"auto","created_at":"2025-11-05 16:33:25","extension":"pdf","order_by":16,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":539163,"visible":true,"origin":"","legend":"","description":"","filename":"ngppipeline.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/58425ea69722d1ecaf71fae7.pdf"},{"id":95196361,"identity":"6f14b13f-afba-4f2b-885d-e21d3f8c040e","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":17,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":14172621,"visible":true,"origin":"","legend":"","description":"","filename":"nunerfpipeline.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/5c14921356d67c867b9cfb0d.pdf"},{"id":95196352,"identity":"70deb5d8-ed1e-499c-88b4-a801c46015e4","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":19,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":49734,"visible":true,"origin":"","legend":"","description":"","filename":"sdfstructure.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/439e9b6f51e8d9f0255060e0.pdf"},{"id":95227519,"identity":"b4595c43-644e-425a-9b59-b41e59be332c","added_by":"auto","created_at":"2025-11-05 16:32:35","extension":"cls","order_by":20,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":55655,"visible":true,"origin":"","legend":"","description":"","filename":"snjnl.cls","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/3b7aac163db076844f24ad16.cls"},{"id":95196354,"identity":"5ae86206-dc52-45e8-a3f6-d43df1468df9","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"bst","order_by":21,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":63706,"visible":true,"origin":"","legend":"","description":"","filename":"snmathphys.bst","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/f52ff63a7bfd4d79fde6b474.bst"},{"id":95196360,"identity":"fda32dac-5af2-4818-a2fa-78bb36992c48","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":22,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":68554,"visible":true,"origin":"","legend":"","description":"","filename":"ustcbadge.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/f2e21d12470b0db65df3db3c.pdf"},{"id":95196343,"identity":"0130c612-041e-4e71-ac7b-58907839ac1b","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":23,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":7606,"visible":true,"origin":"","legend":"","description":"","filename":"ustcnamestxingkai.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/9642e38fc7ab73095a60443d.pdf"},{"id":95196355,"identity":"4edfe967-f0d5-471d-afda-72ffa0a07d33","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"pdf","order_by":24,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":29663,"visible":true,"origin":"","legend":"","description":"","filename":"ustcname.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/d1582f72d41c24780bc0e2ea.pdf"},{"id":95228882,"identity":"2a6a6245-f553-47ff-a159-0f97e9cf761a","added_by":"auto","created_at":"2025-11-05 16:34:14","extension":"pdf","order_by":25,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":34351,"visible":true,"origin":"","legend":"","description":"","filename":"ustctitlepageheading.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/274725fc50566bb485df23b5.pdf"},{"id":95229015,"identity":"9216dbf4-706a-47ea-8517-726e98cb1e90","added_by":"auto","created_at":"2025-11-05 16:34:22","extension":"pdf","order_by":26,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":88310,"visible":true,"origin":"","legend":"","description":"","filename":"volumerendering.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/af6d2cb9420ca82201d46e79.pdf"},{"id":95196362,"identity":"d4bc37a7-3467-4119-a3fd-8c3db529bc4f","added_by":"auto","created_at":"2025-11-05 11:31:11","extension":"pdf","order_by":27,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":15451558,"visible":true,"origin":"","legend":"","description":"","filename":"file.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/82531cfb728d0816eb629d85.pdf"},{"id":95229045,"identity":"0cbf680b-047e-47b4-a9f5-009c4f2bffdc","added_by":"auto","created_at":"2025-11-05 16:34:23","extension":"xml","order_by":28,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":114329,"visible":true,"origin":"","legend":"","description":"","filename":"7d80e8a7077d4e0b8fc068ea3ffcae491structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/1285cb772cee316edd4f2448.xml"},{"id":95196357,"identity":"c06eefc7-0576-4923-bf73-0a2654dfa9f1","added_by":"auto","created_at":"2025-11-05 11:31:10","extension":"html","order_by":29,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":122052,"visible":true,"origin":"","legend":"","description":"","filename":"earlyproof.html","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1/79cc880a53ef72d44401557f.html"},{"id":103765573,"identity":"cd0999c6-a8a6-41a0-927b-bb899e8eb27b","added_by":"auto","created_at":"2026-03-02 16:04:54","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":8706506,"visible":true,"origin":"","legend":"","description":"","filename":"file.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7805209/v1_covered_81b576db-ea26-4fbb-b796-994b56039bee.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Hash-NURF: Efficient Nested Transparent Object Reconstruction Using Multi-Resolution Hash Encoding","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-visual-computer","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"tvcj","sideBox":"Learn more about [The Visual Computer](http://link.springer.com/journal/371)","snPcode":"371","submissionUrl":"https://submission.nature.com/new-submission/371/3","title":"The Visual Computer","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Signed Distance Field (SDF), Transparent object, Reconstruction, Neural Implicit Representations","lastPublishedDoi":"10.21203/rs.3.rs-7805209/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7805209/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eTransparent object reconstruction is crucial in various domains, including 3D modelling and robotic perception. However, accurately reconstructing nested transparent objects remains challenging due to complex light interactions. Recent advances like NU-NeRF have shown promise but suffer from computational inefficiency. Here, we introduce Hash-NURF, a framework that integrates multi-resolution hash encoding with neural implicit representations to accelerate reconstruction. Specifically, we utilize hash-based NeRF and SDF for efficient optimization. To unbounded scenes, we added a contractive mapping strategy. We also incorporated special sampling and regularization techniques to improve the model's stability and help it converge faster. Our method significantly reduces training time by up to three times while maintaining comparable reconstruction quality. We validate our approach on synthetic datasets, demonstrating its efficacy in both outer and inner surface reconstruction of nested transparent objects. Visit our repository at https://github.com/SyouSanGin/Hash-NURF\u003c/p\u003e","manuscriptTitle":"Hash-NURF: Efficient Nested Transparent Object Reconstruction Using Multi-Resolution Hash Encoding","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-11-05 11:31:05","doi":"10.21203/rs.3.rs-7805209/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-12-29T18:48:05+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-12-06T16:04:14+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"98934638015916823764869831076071553670","date":"2025-12-05T04:44:16+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-12-02T18:16:49+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"284313607522919071396637137248942528068","date":"2025-11-04T09:26:19+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-10-27T05:41:44+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-10-10T03:41:24+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-10-09T15:13:26+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Visual Computer","date":"2025-10-08T07:28:00+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-visual-computer","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"tvcj","sideBox":"Learn more about [The Visual Computer](http://link.springer.com/journal/371)","snPcode":"371","submissionUrl":"https://submission.nature.com/new-submission/371/3","title":"The Visual Computer","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"6907bd5a-7c1f-4518-882f-da4ae02dc32d","owner":[],"postedDate":"November 5th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2026-03-02T16:01:39+00:00","versionOfRecord":{"articleIdentity":"rs-7805209","link":"https://doi.org/10.1007/s00371-026-04394-1","journal":{"identity":"the-visual-computer","isVorOnly":false,"title":"The Visual Computer"},"publishedOn":"2026-02-26 15:58:15","publishedOnDateReadable":"February 26th, 2026"},"versionCreatedAt":"2025-11-05 11:31:05","video":"","vorDoi":"10.1007/s00371-026-04394-1","vorDoiUrl":"https://doi.org/10.1007/s00371-026-04394-1","workflowStages":[]},"version":"v1","identity":"rs-7805209","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7805209","identity":"rs-7805209","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00