{"as_of":"2026-08-11T17:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9b6da117f858b7507bc2e53322857c1a681b21bf91be2890b8c0f5c98b721aa","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:00:45.003790Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T08:47:43.116985Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T08:49:53.630715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"cited_work":{"arxiv_id":"2505.23160","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23160","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Topological adaptive least mean squares algorithms over simplicial complexes","venue":null,"work_id":"80204a32-01b1-4c6c-bc67-2f86e207b9b4","year":2025},"citing_paper":{"arxiv_id":"2605.15955","last_updated":"2026-05-19T18:41:41Z","snapshot_observed_at":"2026-07-06T23:27:11.118592Z","submitted_at":"2026-05-15T13:48:01Z","title":"Topological Kalman Filtering on Cell Complexes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T16:03:29.938355Z"},"links":{"cited_paper":"/paper/2505.23160","citing_paper":"/paper/2605.15955"},"observation_digest":"sha256:582c0942a72831cb404567d10ce54afce387ae967895f4d017aa5c9d94ea264d","observation_id":"ccdf2b1d-6d2e-4a0d-9351-60b2479a3a0b","resolution":{"observed_at":"2026-05-20T16:03:33.507851Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"cited_work":{"arxiv_id":"2505.23160","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23160","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Topological adaptive least mean squares algorithms over simplicial complexes","venue":null,"work_id":"80204a32-01b1-4c6c-bc67-2f86e207b9b4","year":2025},"citing_paper":{"arxiv_id":"2605.15955","last_updated":"2026-05-19T18:41:41Z","snapshot_observed_at":"2026-07-06T23:27:11.118592Z","submitted_at":"2026-05-15T13:48:01Z","title":"Topological Kalman Filtering on Cell Complexes","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T08:47:43.116985Z"},"links":{"cited_paper":"/paper/2505.23160","citing_paper":"/paper/2605.15955"},"observation_digest":"sha256:3a1ec124725eb0a397787ce3cee49835b210ce40ab1aee3ec63d5411dd085389","observation_id":"785f6e75-9b15-4e68-b909-bfc6ae211406","resolution":{"observed_at":"2026-05-21T08:49:53.632387Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23160/citation-record","integrity":"/paper/2505.23160/integrity","json":"/paper/2505.23160/citation-record.json","paper":"/paper/2505.23160"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:56.359108Z","title":"Topological adaptive learning over cell complexes,","venue":null,"work_id":"45a7e7ea-6970-4ef8-9b91-8de1e7519f0f","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.340864Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:db15f4e6865d4aa5512f69623d4680c217cc3d6d6ef574e416f3a43c5953fefa","observation_id":"b82384ed-1c1b-48e4-b416-a8283255693b","resolution":{"observed_at":"2026-08-07T13:00:56.482470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:56.098814Z","title":"Signal processing and learning over topological spaces,","venue":null,"work_id":"d4adf5a0-10b3-4048-8cc0-213ef3fff9f8","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.425350Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:efbfaa636a8903edacce724348291d797eaaefa0a45c646fa1774e8c799391ca","observation_id":"9ffe6373-a013-481a-b55f-605ecee32a93","resolution":{"observed_at":"2026-08-07T13:00:56.203517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:40.479285Z","title":"From networks to optimal higher-order models of complex systems,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.479285Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:61bb8efee1c0c8a9faac76aec4c73710d295faaa49fa7d1633408d8587670e8c","observation_id":"4b4de187-0064-4c8f-8bbb-e1ce4769269a","resolution":{"observed_at":"2026-08-07T13:00:40.479285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:55.850167Z","title":"A graph signal processing perspective on functional brain imaging,","venue":null,"work_id":"c8d8a89f-b204-4e20-b82c-d024b909689c","year":2018},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.535193Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:755ff70aec6c279cd92f99f757c8b049ce8081d419532d6a61493a75eacde5d4","observation_id":"39839b5a-7ef2-42d0-aa16-a87131e97188","resolution":{"observed_at":"2026-08-07T13:00:55.972218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:55.543227Z","title":"Graph signal processing: Overview, challenges, and applications,","venue":null,"work_id":"b3341ed7-a1ac-4b34-bd79-62a402d14d3c","year":2018},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.580305Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:8d477f3e09693a52860080df3597afa884c2f71e404476f7e1304bf870082d4b","observation_id":"c60ffd53-0b74-4090-b221-433687ca66da","resolution":{"observed_at":"2026-08-07T13:00:55.676911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:55.246815Z","title":"Graph filters for signal processing and machine learning on graphs,","venue":null,"work_id":"e19d4f30-f3cb-4b35-9655-3a6837785f4a","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.641089Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:658dfc2f30551b7929c9d2afa9e91b25da0047c41e04ecbcd7a76f9d98a7dc42","observation_id":"9456fa48-7ba2-4c14-9ac7-9bf609b35c20","resolution":{"observed_at":"2026-08-07T13:00:55.409059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:54.972684Z","title":"Signal processing on higher-order networks: Livin’on the edge... and beyond,","venue":null,"work_id":"7cd5a621-bbe7-4c55-aeb6-776b26932516","year":2021},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.700526Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:00eb2cda6aebe8c846611ffe2dd1d10bfd47d2cc8e758171b2c13839be6c29e5","observation_id":"2d57d719-b2d4-4d46-9a56-23b54663541e","resolution":{"observed_at":"2026-08-07T13:00:55.082102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:54.660097Z","title":"A novel simplicial complex representation of social media texts: The case of twitter,","venue":null,"work_id":"e390893c-6d3c-4a2d-b4e0-d407a8d9377d","year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.756196Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:0b157eb683a30f8d56eeae2735b20474835ba360f231b25f73aa401389085880","observation_id":"df56ea47-1555-427b-b362-be01091f0a39","resolution":{"observed_at":"2026-08-07T13:00:54.828127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:54.406700Z","title":"Topological signal processing over simplicial complexes,","venue":null,"work_id":"1d249b00-7763-416f-9c70-310e3f2ca279","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.815249Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:d9dec1966c00a5b508f02d585338e0f6dca7ab51626b595b84ebf9fb6ab8ecea","observation_id":"4f7d4e2b-ffcf-4a59-a134-6748cc688ccd","resolution":{"observed_at":"2026-08-07T13:00:54.530518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:54.110824Z","title":"Signal processing on simplicial complexes with vertex signals,","venue":null,"work_id":"3c5e912e-fc8c-4581-9952-22799904b37e","year":2021},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.866318Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:124fab0d5219b2a3aa1c2b719f67aa2401ce958f294c951e932d6675af0f16ca","observation_id":"32bb0a08-6270-4d63-9222-675650f94174","resolution":{"observed_at":"2026-08-07T13:00:54.273335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:53.864374Z","title":"Signal processing on cell complexes,","venue":null,"work_id":"419c3a7c-2aa6-49de-9375-c75ad17b01a8","year":2022},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.929274Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:18225a56a6385bf964d78453b7dbc8d7ee5f0babaf09bb6220e2eb5bd13c6c72","observation_id":"b2f5fb53-72c2-4bba-a594-e2f15c313936","resolution":{"observed_at":"2026-08-07T13:00:53.980524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:53.625663Z","title":"Combinatorial Laplacians of simplicial complexes,","venue":null,"work_id":"3da2b31a-5bbe-4384-8904-85f29c460bb0","year":2002},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:40.988651Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:433f18934127302aed20a33559fb6d968f323acd34829d6c93399bca148e9adc","observation_id":"87310dee-6592-410a-9f01-55c199e066e2","resolution":{"observed_at":"2026-08-07T13:00:53.738437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:53.369206Z","title":"Topological slepians: Maximally localized representations of signals over simplicial complexes,","venue":null,"work_id":"c9530857-6bb4-4a59-be29-379c44fa3b48","year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.045784Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:60ede127790e1ba838b873d4afd04410e232d3bda8ced892512cf9248e77511b","observation_id":"ffa2908e-e649-4cef-bfdd-288071a38fba","resolution":{"observed_at":"2026-08-07T13:00:53.499268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:52.420967Z","title":"Topological signal processing: Making sense of data building on multiway relations,","venue":null,"work_id":"b466f2ef-0567-419a-ba2e-812ef8fcf710","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.111936Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:934e8c506de514dbd7e0dc1c59da09fca22e10f3936d225bcd69939a104c19fc","observation_id":"7897286a-aec7-4858-aabf-84984b6e8e07","resolution":{"observed_at":"2026-08-07T13:00:52.965507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:51.991874Z","title":"Simplicial convolutional filters,","venue":null,"work_id":"9f6790b7-0cce-481b-8031-55c787003cef","year":2022},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.239811Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:e20e0031bc7976f455ee0c8910d91199ffafeb494f2a18f74714e1c61aa1e278","observation_id":"3779ed35-30b7-4442-b4d8-77d0bb108e53","resolution":{"observed_at":"2026-08-07T13:00:52.114478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:51.779633Z","title":"Topological dictionary learning,","venue":null,"work_id":"e9f4e942-52ab-4182-838a-6bdc3e674cc5","year":2025},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.277530Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:8359b4594e1eb39dff43f067f47d05952937c3ec8568d3a6093044b3cb61c6ef","observation_id":"79fbf891-8a4b-4404-aa00-c7fce26f45e2","resolution":{"observed_at":"2026-08-07T13:00:51.891256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:51.560589Z","title":"Architectures of topological deep learning: A survey of message-passing topological neural networks,","venue":null,"work_id":"ef28a768-f293-4210-a80f-92c0f81cbd06","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.331117Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:f9c2ac19238039e629015e811cf935a73496bd770660c5e8fa7208648c7f11e5","observation_id":"7c6835df-c3f6-494e-9054-f1efcb3d383a","resolution":{"observed_at":"2026-08-07T13:00:51.663803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:41.433876Z","title":"Generalized simplicial attention neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.433876Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:f6882f3506873729f2fe17b62e2e66aeae76c753ff8534aa7e565149b122fdf6","observation_id":"7631e6dc-fbdf-4071-8e6e-6ebb92db413e","resolution":{"observed_at":"2026-08-07T13:00:41.433876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:51.364901Z","title":"Weisfeiler and Lehman go topological: Message passing simplicial networks,","venue":null,"work_id":"dfe8dc7d-3ab2-4732-b841-d927bb0df27e","year":2021},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.557302Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:b3adfac541af11c96186a2e43c4e26b5ec880e64bd2b646858856a762a65c1e4","observation_id":"09d2679c-f820-4249-a903-7ee547226a19","resolution":{"observed_at":"2026-08-07T13:00:51.426946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.09455","last_updated":"2022-04-20T13:41:50Z","snapshot_observed_at":"2026-08-10T03:38:49.601653Z","submitted_at":"2022-04-20T13:41:50Z","title":"Simplicial Attention Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.09455","snapshot_observed_at":"2026-08-07T13:00:41.670184Z","title":"Simplicial attention networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.670184Z"},"links":{"cited_paper":"/paper/2204.09455","citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:d718c7f3cd285ec2a9276e37227da65fbd730bf815c032123a2f26d8d2140e6c","observation_id":"5a05a83c-2907-406a-b331-df0c4ff0d4f1","resolution":{"observed_at":"2026-08-07T13:00:41.670184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:51.162412Z","title":"Learning power grid outages with higher-order topological neural networks,","venue":null,"work_id":"bbacec26-8f13-402b-bc96-cf8198f4abea","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.764663Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:0ba8d0ad90a490a0b3c8e68e396ce243a03a4d09f43e0951217596e96e0a4627","observation_id":"f8bd8315-4a5b-4c5d-ba34-050caaa08c0a","resolution":{"observed_at":"2026-08-07T13:00:51.258436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:50.942165Z","title":"From latent graph to latent topology inference: Differentiable cell complex module,","venue":null,"work_id":"14ab99e2-b914-41e6-9056-0ae7c79e2d88","year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.870135Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:69ea7f441220983faf90f89312f0779d01e655aecfcb56031e0f9375423e8432","observation_id":"7794a7a0-f7b4-4025-ba04-b7e308f1a738","resolution":{"observed_at":"2026-08-07T13:00:51.044526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:50.680010Z","title":null,"venue":null,"work_id":"028254e0-b47a-4803-a604-a667a699fa71","year":2011},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:41.953659Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:ff12e13c88572cd8c6832f389a5b72e373083c0a5bb86bfa558bd1213f2272b0","observation_id":"7c22f716-f98b-433f-940f-fa2eb16f9567","resolution":{"observed_at":"2026-08-07T13:00:50.810045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:50.452096Z","title":"Adaptation, learning, and optimization over networks,","venue":null,"work_id":"4b022390-1fc4-49d8-80ae-12624f9f450d","year":2014},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.065784Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:703d57920ead2db20ebb2fc1325f7ae05c17a195aa4590edc0bfb62ced6433fc","observation_id":"a484e0eb-61a1-4355-943b-4ee9ea2d07fa","resolution":{"observed_at":"2026-08-07T13:00:50.549236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:50.248509Z","title":"H Sayed,Inference and Learning from Data: Learning, vol","venue":null,"work_id":"76b5f3a3-a93a-4236-aea0-0453ec6d7dbb","year":2022},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.194803Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:ddd7aa819fa285e00063a84cf8584d1816ca77bbce7d55da3c796617c973a49d","observation_id":"b0257d6f-e982-407a-af52-0dec942ba361","resolution":{"observed_at":"2026-08-07T13:00:50.345512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:50.013836Z","title":"Online graph learning from sequential data,","venue":null,"work_id":"ec96e7da-31ff-4bbf-8e0b-6a9834475082","year":2018},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.294172Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:f924109f805cd0ad4f468900a98241990f62a5b2edd5990ab8acb2bc2119a6f4","observation_id":"dbb44942-0457-416f-9f79-1d094cbbed15","resolution":{"observed_at":"2026-08-07T13:00:50.145859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:49.783177Z","title":"Adaptive least mean squares estimation of graph signals,","venue":null,"work_id":"c69624f8-35ff-407f-a273-1edad622f7b2","year":2016},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.389900Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:266b50e765248c2616d7571c862f637925115388a3f0be52f844b198e1eafe27","observation_id":"8cfaf0ba-d2cb-4fc8-b01b-1fc845c3247d","resolution":{"observed_at":"2026-08-07T13:00:49.872237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:49.567005Z","title":"Observing and tracking bandlimited graph processes from sampled measurements,","venue":null,"work_id":"3dbaba28-b95b-42db-977f-5ca1b5949094","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.466667Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:5b7db20c434b53230530d840479d9c8ccc0973d77dff441c6c2799b233800b8d","observation_id":"34304c11-2972-46f8-83f5-09f284011f1a","resolution":{"observed_at":"2026-08-07T13:00:49.660037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:49.423968Z","title":"Adaptive graph signal processing: Algorithms and optimal sampling strategies,","venue":null,"work_id":"baceafbe-0c6e-4ba8-9c2d-71f17e08ea57","year":2018},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.531464Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:523f0a56a3f77ea449beed5ab7a7982ca029ce3450d953b983f02516473b425d","observation_id":"29cfcfea-dba5-44d7-bc7f-cd23c8035420","resolution":{"observed_at":"2026-08-07T13:00:49.492608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:49.312187Z","title":"Distributed adaptive learning of graph signals,","venue":null,"work_id":"a92c0642-3853-4965-b8ee-f7d1b43edc4c","year":2017},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.540907Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:05201a67ea4f59b3a0935d0e838db1c6cca51e29ba4609792c1dad4ab7906a23","observation_id":"0e156e9a-ca4a-4e96-83f3-ab6a62a16f24","resolution":{"observed_at":"2026-08-07T13:00:49.360086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:49.102039Z","title":"Distributed diffusion adaptation over graph signals,","venue":null,"work_id":"3d750550-6a11-4abd-a6db-77b43b6bb859","year":2018},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.568414Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:e95059f159eb485c05f1dc6b593c5b84710a9ced5e23ebd34c1e9ab5c4744894","observation_id":"6400bb7d-4562-4fc4-b900-87143d154627","resolution":{"observed_at":"2026-08-07T13:00:49.153733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:48.874413Z","title":"Online distributed learning over graphs with multitask graph-filter models,","venue":null,"work_id":"a5740d23-36ec-4e50-99b4-a269c3dc713b","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.695994Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:66e64ce72eee5700782cf7fd288d988428935e1dbd12f6dd61517e31f0c51f7b","observation_id":"47fec6d6-c441-4409-b3cd-36039a1cddbc","resolution":{"observed_at":"2026-08-07T13:00:48.961272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:42.827670Z","title":"Topological signal processing and learning: Recent advances and future challenges,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:42.827670Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:5b93e70cd17a0d61023197c3a4bd946baeed4836df8ab68dcf34c69fc3ffbdbc","observation_id":"6f321184-f69d-448a-a742-ae6d4ce129b8","resolution":{"observed_at":"2026-08-07T13:00:42.827670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:48.717818Z","title":"Online edge flow imputation on networks,","venue":null,"work_id":"779830ec-0582-464f-b7d7-55766592a96a","year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.033916Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:b615734446cf40a257f708314a45aafd6f81c41084e9a35a270f98abf54e0c92","observation_id":"1e96fd19-f669-4473-b5d7-05a49c7c1dcf","resolution":{"observed_at":"2026-08-07T13:00:48.798105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:48.510802Z","title":"Kalman filtering for simplicial processes,","venue":null,"work_id":"8036c3ac-f50a-43f9-857b-7a21562b3baa","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.185861Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:e16d63378f79b84a62a7de22723555800ddfc1404ebecf191a129bc9fb29e743","observation_id":"2dc30995-8a86-472d-b19c-d0be5961d5a5","resolution":{"observed_at":"2026-08-07T13:00:48.598044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:48.303388Z","title":"Online edge flow prediction over expanding simplicial complexes,","venue":null,"work_id":"d29b3aea-4476-4330-89dc-1e156206b114","year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.323697Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:c54fb23f56784e4197bb407b97af4a18b33fb51455fe13f03bdb27877c1a25bc","observation_id":"39b38b55-d146-4061-9b29-23321d02194c","resolution":{"observed_at":"2026-08-07T13:00:48.415663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:48.074886Z","title":"Adaptive joint estimation of temporal vertex and edge signals,","venue":null,"work_id":"93ea3637-a34c-4fe5-96f4-bb63fc68351c","year":2025},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.437475Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:ce95c73a9e66bcd8c7e384374c9b1ff7cd5d90768e819893e68cded55e56a628","observation_id":"ed13f110-e393-4c8c-b8a8-a20b72ad9a92","resolution":{"observed_at":"2026-08-07T13:00:48.173262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:47.870704Z","title":"Simplicial vector autoregressive models,","venue":null,"work_id":"e60e80df-50d4-4d7a-8f5a-7ecb8a27991a","year":2024},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.567712Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:d8c2f8f8bc82315a70df02c1faf1efff099a1a6bc7d633768b0690e1beba3d91","observation_id":"f0a55c8e-01b8-486c-9d0f-738ef384e601","resolution":{"observed_at":"2026-08-07T13:00:47.971265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:47.631546Z","title":"Hatcher,Algebraic topology, Cambridge University Press, 2002","venue":null,"work_id":"478139e7-f522-4d76-83a3-0cb647151b63","year":2002},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.720218Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:2e7dc8490a0f9b156b9438b5fbc43b85b4ce3c843359abfb32bb8b63cafe31cf","observation_id":"f71a90da-cf6e-4535-b1e3-eab66a6611f7","resolution":{"observed_at":"2026-08-07T13:00:47.739264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:47.382978Z","title":"Hodge Laplacians on graphs,","venue":null,"work_id":"cdf92ab2-5b3a-4490-908f-ee1479eb3afb","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.857701Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:e18a9beb5d54e2c84f422285ee5c19c8ecdc7e16095f664ba02282ee70e388da","observation_id":"5b8810ff-acf5-4a66-b017-b8d9c5d1157f","resolution":{"observed_at":"2026-08-07T13:00:47.489069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11163","last_updated":"2023-01-26T15:08:11Z","snapshot_observed_at":"2026-08-06T19:49:28.369524Z","submitted_at":"2023-01-26T15:08:11Z","title":"Convolutional Learning on Simplicial Complexes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11163","snapshot_observed_at":"2026-08-07T13:00:43.994339Z","title":"Convolutional learning on simplicial complexes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:43.994339Z"},"links":{"cited_paper":"/paper/2301.11163","citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:a4583ebc2d05b4d054dba4b1daa6242a677f66b5ec61965b16b379447fc5c2d6","observation_id":"ec175c41-0da8-4dd4-8904-b3d6da5ca3f0","resolution":{"observed_at":"2026-08-07T13:00:43.994339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:47.152375Z","title":"Trace bounds on the solution of the algebraic matrix riccati and lyapunov equation,","venue":null,"work_id":"9d1eed5e-9e33-40f2-a846-f1902611d4e8","year":1986},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.113071Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:d8e0860ff9c1ecfd76f3fb82f4b0c041612672c273d1b0873c0d1173b600efa3","observation_id":"e80bedd1-8cdd-4dee-beeb-c681075e3cae","resolution":{"observed_at":"2026-08-07T13:00:47.244541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:46.965433Z","title":"Avriel, W","venue":null,"work_id":"1b691f4e-fa2d-4af6-a954-5dc9816b66d7","year":2010},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.261787Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:7e02b03d63d0a217177435e5c8d6fa22829d4947c1037583a24218801a35447a","observation_id":"ad52db56-e3ef-47dc-8111-b026ccbe0492","resolution":{"observed_at":"2026-08-07T13:00:47.044026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:46.747093Z","title":"Boyd and L","venue":null,"work_id":"8c5c2546-d5e9-4b5b-8ba7-3d83e6a59535","year":2004},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.420574Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:a1a228ecf9859591b8249cda8cab8a40b511bbeb51edfdaac5e3a0c80ad2faf2","observation_id":"0b5b8ad7-2db6-467d-b8c5-d32716a7f383","resolution":{"observed_at":"2026-08-07T13:00:46.861133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:46.494800Z","title":"Distributed signal processing and optimization based on in-network subspace projections,","venue":null,"work_id":"fdef5a02-c5ee-484d-81a5-9413c757a90a","year":2020},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.517282Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:000725378dea86486c9d05f4c5d4757962b2ea395ebcd0d08366ba1adaa30d44","observation_id":"e747d51d-7025-4a84-a885-9c67bf7433ec","resolution":{"observed_at":"2026-08-07T13:00:46.646167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:46.193682Z","title":"Diffusion LMS strategies for distributed estimation,","venue":null,"work_id":"9b91d369-9a84-4040-a96d-dcfca5e063f7","year":2009},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.630888Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:0458181db445e0d43658803901b7015b5804c832e79cf5f66d3e23bcbeae620b","observation_id":"7aa1f835-bd02-4b74-8f06-75b6f15e386c","resolution":{"observed_at":"2026-08-07T13:00:46.318084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:45.859243Z","title":null,"venue":null,"work_id":"2d0f536b-6524-4980-a816-26ef4553496d","year":1998},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.782758Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:b49289f904ebfcfc6b1db0eac795dc53d3e05c828d4dda9e4fc58f44be2c175f","observation_id":"a63a010f-450f-45ba-9243-4e111cc10ae0","resolution":{"observed_at":"2026-08-07T13:00:45.987946Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:45.443943Z","title":"Sndlib 1.0—survivable network design library,","venue":null,"work_id":"c170ebc1-cc4b-4a34-8c13-a98e6429e626","year":2010},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:44.873511Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:067b6de88365559ac99bf97a399e6c0f5e4bb06eda39c966d2ff5e0db873a910","observation_id":"6466239f-52b6-4d16-a466-9eea3dff6029","resolution":{"observed_at":"2026-08-07T13:00:45.650925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:45.196689Z","title":"This proves (34), and concludes the proof of Theorem 1","venue":null,"work_id":"06303255-4485-4797-b867-3f308f891fad","year":null},"citing_paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:45.003790Z"},"links":{"citing_paper":"/paper/2505.23160"},"observation_digest":"sha256:2e662ff4255b05b7474b7d743d0d2d5e4d805c8827eb2525b9d08d240ace0c00","observation_id":"acd9ad82-2bbb-4091-b15d-7971b68cbd27","resolution":{"observed_at":"2026-08-07T13:00:45.278672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23160","last_updated":"2025-05-29T06:55:19Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-10T03:39:09.648508Z","submitted_at":"2025-05-29T06:55:19Z","title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 2 inbound Pith citation observations for arXiv:2505.23160."}