{"id":"833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818","title":"Authors propose gradient boosting for tensor network rank discovery","argument":"In their arXiv paper submitted on November 5, 2026, Albert Saiapin and Kim Batselier propose GB-CPKM, a gradient boosting framework for tensor network kernel machines (TNKMs). TNKMs use nonlinear features and low-rank tensor representations; choosing tensor rank can require training multiple candidate models. Instead of explicit rank search, GB-CPKM sequentially adds fixed-rank learners, with ensemble size selected by validation performance. The authors report experiments on real-world regression benchmarks where GB-CPKM trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance. The proposed approach reframes rank selection as incrementally increasing model capacity, and the reported results suggest this can reduce the computational cost of that process. The abstract does not identify the benchmarks or give further details about the experimental setup, so the reported comparisons cannot be assessed from this evidence alone.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied evidence is the paper's abstract and does not identify the regression benchmarks or provide further experimental setup details. The abstract reports comparisons on benchmarks; it does not establish performance beyond those experiments.","speaker":{"name":"Saiapin, Albert, Batselier, Kim","roleAtSource":"Article author"},"source":{"title":"Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.08093","publishedAt":"2026-11-05","dateBasis":"Date basis not provided."},"evidence":[{"text":"Saiapin and Batselier propose GB-CPKM, which builds a higher-capacity predictor by sequentially adding fixed-rank learners.","excerpt":"propose GB-CPKM, a gradient boosting framework that builds a higher-capacity predictor by sequentially adding fixed-rank learners","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"The method selects ensemble size using validation performance rather than explicit rank search.","excerpt":"ensemble size selected based on validation performance rather than through explicit rank search","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"On real-world regression benchmarks, the authors report up to 6x faster training and up to 2x less peak memory than a cross-validation-based rank-selection method, with comparable predictive performance.","excerpt":"trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"The authors present the method as a way to increase model capacity incrementally while avoiding explicit rank search.","excerpt":"This approach provides a new perspective on rank selection by incrementally increasing model capacity","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.08093","checkedAt":"2026-11-09T03:14:09.212Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which real-world regression benchmarks and experimental configurations produced the reported comparisons with cross-validation?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Authors propose gradient boosting for tensor network rank discovery","summary":"In their arXiv paper submitted on November 5, 2026, Albert Saiapin and Kim Batselier propose GB-CPKM, a gradient boosting framework for tensor network kernel machines (TNKMs). TNKMs use nonlinear features and low-rank tensor representations; choosing tensor rank can require training multiple candidate models. Instead of explicit rank search, GB-CPKM sequentially adds fixed-rank learners, with ensemble size selected by validation performance. The authors report experiments on real-world regression benchmarks where GB-CPKM trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance. The proposed approach reframes rank selection as incrementally increasing model capacity, and the reported results suggest this can reduce the computational cost of that process. The abstract does not identify the benchmarks or give further details about the experimental setup, so the reported comparisons cannot be assessed from this evidence alone.","question":"Which real-world regression benchmarks and experimental configurations produced the reported comparisons with cross-validation?","claims":[{"text":"Saiapin and Batselier propose GB-CPKM, which builds a higher-capacity predictor by sequentially adding fixed-rank learners.","excerpt":"propose GB-CPKM, a gradient boosting framework that builds a higher-capacity predictor by sequentially adding fixed-rank learners","support":"source-stated"},{"text":"The method selects ensemble size using validation performance rather than explicit rank search.","excerpt":"ensemble size selected based on validation performance rather than through explicit rank search","support":"source-stated"},{"text":"On real-world regression benchmarks, the authors report up to 6x faster training and up to 2x less peak memory than a cross-validation-based rank-selection method, with comparable predictive performance.","excerpt":"trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance","support":"source-stated"},{"text":"The authors present the method as a way to increase model capacity incrementally while avoiding explicit rank search.","excerpt":"This approach provides a new perspective on rank selection by incrementally increasing model capacity","support":"source-stated"}],"limitations":["The supplied evidence is the paper's abstract and does not identify the regression benchmarks or provide further experimental setup details.","The abstract reports comparisons on benchmarks; it does not establish performance beyond those experiments."],"mediaId":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","correctionReason":null,"id":"833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818","publicationId":"79183af5-e828-4d7b-8542-31f3cdfd9bd6","version":1,"sourceUrl":"https://arxiv.org/abs/2611.08093","sourceTitle":"Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-05","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:03:35.251Z","createdAt":"2026-11-09T02:10:42.277Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","kind":"article","url":"https://arxiv.org/abs/2611.08093","sourceUrl":"https://arxiv.org/abs/2611.08093","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T02:09:52.707Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.08093","checkedAt":"2026-11-09T03:14:09.212Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","confidence":0.77,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d0737a03a3ccebe1bfec20efdb5becf41c1bc11ad71706fc6ed39b42f1bc10de","decidedAt":"2026-11-09T02:09:53.661Z"},"provenance":{"textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observationId":"467856e00f552d92249bf3058692edfa7daf2b3a58cea5f06c4886f9cde49855","retrievedAt":"2026-11-09T02:09:52.551Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"e603231b-dfec-4eca-8ed6-44ea184dc609"},"reviewer":{"model":"gpt-6-luna","runId":"847e0d1c-3e45-46cd-848a-8c0039cae7b2"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-09T02:10:42.277Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Saiapin, Albert","url":null,"kind":"unknown"},{"name":"Batselier, Kim","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Saiapin, Albert","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Saiapin, Albert","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.08093","locator":"head/meta[name=author|citation_author]"},"assertionId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:14:09.212Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","sourceUrl":"https://arxiv.org/abs/2611.08093","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z"}},{"actor":{"name":"Batselier, Kim","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Batselier, Kim","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.08093","locator":"head/meta[name=author|citation_author]"},"assertionId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:14:09.212Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","sourceUrl":"https://arxiv.org/abs/2611.08093","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.08093","snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z","basis":"publisher-page-metadata","sourceLinks":42,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818/source"}},"canonicalUrl":"https://escapemeridian.com/readings/authors-propose-gradient-boosting-for-tensor-network-rank-833587c3","formats":{"html":"/readings/authors-propose-gradient-boosting-for-tensor-network-rank-833587c3","markdown":"/readings/authors-propose-gradient-boosting-for-tensor-network-rank-833587c3.md","json":"/readings/authors-propose-gradient-boosting-for-tensor-network-rank-833587c3.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-benchmark","name":"Benchmark","explanation":"A defined set of tests used to compare systems. Results depend on the tasks and measures selected.","referenceUrl":"https://arxiv.org/abs/2211.09110"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818","revision":"79183af5-e828-4d7b-8542-31f3cdfd9bd6","revisionKind":"publication-id","title":"Authors propose gradient boosting for tensor network rank discovery","url":"https://escapemeridian.com/readings/authors-propose-gradient-boosting-for-tensor-network-rank-833587c3"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.08093","revision":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","revisionKind":"sha256-source-text","title":"Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines","url":"https://arxiv.org/abs/2611.08093"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818","title":"Authors propose gradient boosting for tensor network rank discovery","argument":"In their arXiv paper submitted on November 5, 2026, Albert Saiapin and Kim Batselier propose GB-CPKM, a gradient boosting framework for tensor network kernel machines (TNKMs). TNKMs use nonlinear features and low-rank tensor representations; choosing tensor rank can require training multiple candidate models. Instead of explicit rank search, GB-CPKM sequentially adds fixed-rank learners, with ensemble size selected by validation performance. The authors report experiments on real-world regression benchmarks where GB-CPKM trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance. The proposed approach reframes rank selection as incrementally increasing model capacity, and the reported results suggest this can reduce the computational cost of that process. The abstract does not identify the benchmarks or give further details about the experimental setup, so the reported comparisons cannot be assessed from this evidence alone.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied evidence is the paper's abstract and does not identify the regression benchmarks or provide further experimental setup details. The abstract reports comparisons on benchmarks; it does not establish performance beyond those experiments.","speaker":{"name":"Saiapin, Albert, Batselier, Kim","roleAtSource":"Article author"},"source":{"title":"Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.08093","publishedAt":"2026-11-05","dateBasis":"Date basis not provided."},"evidence":[{"text":"Saiapin and Batselier propose GB-CPKM, which builds a higher-capacity predictor by sequentially adding fixed-rank learners.","excerpt":"propose GB-CPKM, a gradient boosting framework that builds a higher-capacity predictor by sequentially adding fixed-rank learners","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"The method selects ensemble size using validation performance rather than explicit rank search.","excerpt":"ensemble size selected based on validation performance rather than through explicit rank search","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"On real-world regression benchmarks, the authors report up to 6x faster training and up to 2x less peak memory than a cross-validation-based rank-selection method, with comparable predictive performance.","excerpt":"trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"},{"text":"The authors present the method as a way to increase model capacity incrementally while avoiding explicit rank search.","excerpt":"This approach provides a new perspective on rank selection by incrementally increasing model capacity","url":"https://arxiv.org/abs/2611.08093","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.08093","checkedAt":"2026-11-09T03:14:09.212Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which real-world regression benchmarks and experimental configurations produced the reported comparisons with cross-validation?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Authors propose gradient boosting for tensor network rank discovery","summary":"In their arXiv paper submitted on November 5, 2026, Albert Saiapin and Kim Batselier propose GB-CPKM, a gradient boosting framework for tensor network kernel machines (TNKMs). TNKMs use nonlinear features and low-rank tensor representations; choosing tensor rank can require training multiple candidate models. Instead of explicit rank search, GB-CPKM sequentially adds fixed-rank learners, with ensemble size selected by validation performance. The authors report experiments on real-world regression benchmarks where GB-CPKM trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance. The proposed approach reframes rank selection as incrementally increasing model capacity, and the reported results suggest this can reduce the computational cost of that process. The abstract does not identify the benchmarks or give further details about the experimental setup, so the reported comparisons cannot be assessed from this evidence alone.","question":"Which real-world regression benchmarks and experimental configurations produced the reported comparisons with cross-validation?","claims":[{"text":"Saiapin and Batselier propose GB-CPKM, which builds a higher-capacity predictor by sequentially adding fixed-rank learners.","excerpt":"propose GB-CPKM, a gradient boosting framework that builds a higher-capacity predictor by sequentially adding fixed-rank learners","support":"source-stated"},{"text":"The method selects ensemble size using validation performance rather than explicit rank search.","excerpt":"ensemble size selected based on validation performance rather than through explicit rank search","support":"source-stated"},{"text":"On real-world regression benchmarks, the authors report up to 6x faster training and up to 2x less peak memory than a cross-validation-based rank-selection method, with comparable predictive performance.","excerpt":"trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance","support":"source-stated"},{"text":"The authors present the method as a way to increase model capacity incrementally while avoiding explicit rank search.","excerpt":"This approach provides a new perspective on rank selection by incrementally increasing model capacity","support":"source-stated"}],"limitations":["The supplied evidence is the paper's abstract and does not identify the regression benchmarks or provide further experimental setup details.","The abstract reports comparisons on benchmarks; it does not establish performance beyond those experiments."],"mediaId":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","correctionReason":null,"id":"833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818","publicationId":"79183af5-e828-4d7b-8542-31f3cdfd9bd6","version":1,"sourceUrl":"https://arxiv.org/abs/2611.08093","sourceTitle":"Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-05","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:03:35.251Z","createdAt":"2026-11-09T02:10:42.277Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","kind":"article","url":"https://arxiv.org/abs/2611.08093","sourceUrl":"https://arxiv.org/abs/2611.08093","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T02:09:52.707Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.08093","checkedAt":"2026-11-09T03:14:09.212Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"d27572634fc446ed027b52b6f1b54cec46f84356fa5e416df39c6c613b8353b4","confidence":0.77,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d0737a03a3ccebe1bfec20efdb5becf41c1bc11ad71706fc6ed39b42f1bc10de","decidedAt":"2026-11-09T02:09:53.661Z"},"provenance":{"textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observationId":"467856e00f552d92249bf3058692edfa7daf2b3a58cea5f06c4886f9cde49855","retrievedAt":"2026-11-09T02:09:52.551Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"e603231b-dfec-4eca-8ed6-44ea184dc609"},"reviewer":{"model":"gpt-6-luna","runId":"847e0d1c-3e45-46cd-848a-8c0039cae7b2"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-09T02:10:42.277Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Saiapin, Albert","url":null,"kind":"unknown"},{"name":"Batselier, Kim","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Saiapin, Albert","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Saiapin, Albert","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.08093","locator":"head/meta[name=author|citation_author]"},"assertionId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:14:09.212Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","sourceUrl":"https://arxiv.org/abs/2611.08093","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z"}},{"actor":{"name":"Batselier, Kim","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Batselier, Kim","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.08093","locator":"head/meta[name=author|citation_author]"},"assertionId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:14:09.212Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","sourceUrl":"https://arxiv.org/abs/2611.08093","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.08093","snapshotId":"d21ba2b8d7a134ae48fa054cdad50680551ca968c04f30a0a74869552d3d49ea","contentSha256":"475de3262d05e042be2a8eaf969b7b6f5473ff2746c35767baadb567149dc575","textHash":"9b1b93b28bc17014de1fdcb48384aee3786e5bacb75eac4d4c15fb3a3ed8626f","observedAt":"2026-11-09T03:14:09.212Z","basis":"publisher-page-metadata","sourceLinks":42,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/833587c314139b5cfcfc313559af4ade915165b3566674e0d4a8fe284832e818/source"}}}],"audits":[{"publicationId":"79183af5-e828-4d7b-8542-31f3cdfd9bd6","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading attributes the paper and the GB-CPKM proposal to Albert Saiapin and Kim Batselier, matching the arXiv listing. Performance results are framed as what the authors report, not as established fact.","excerpt":"Authors:Albert Saiapin, Kim Batselier"},{"dimension":"summary","status":"uncertain","explanation":"The reading is faithful, but the central term 'tensor rank' is never glossed in plain language. A non-specialist cannot tell why choosing it matters. 'Gradient boosting' and 'cross-validation' are also unexplained in the prose. Smallest repair, supported by the source: add a short clause saying that rank sets the model's capacity, and that GB-CPKM raises capacity step by step by adding small fixed-rank models instead of training many candidates. Tooltips can supply the remaining terms. The title, the question and the stated limitation are otherwise appropriate and preserve scope.","excerpt":"This approach provides a new perspective on rank selection by incrementally increasing model capacity"},{"dimension":"date","status":"pass","explanation":"originalPublished is 2026-11-05. This matches the arXiv v1 submission date of Thu, 5 Nov 2026, and the draft's date sentence agrees.","excerpt":"[Submitted on 5 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Each claim quotes the abstract verbatim, and the 'up to' qualifiers and the 'comparable predictive performance' qualifier are kept. The inference that this can reduce computational cost is labeled as what the results suggest. It is consistent with the authors' own framing of potential efficiency gains. The limitations correctly note that the benchmarks and setup are unspecified.","excerpt":"These results highlight the potential of gradient boosting to improve the computational efficiency and scalability of tensor-network learning."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified arXiv abstract page for this paper, which is the direct original source. No better source media was found.","excerpt":null}],"createdAt":"2026-11-09T02:10:42.277Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}