{"as_of":"2026-08-08T03:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95ec853fed3357bba8db5e9387ada17333b1e46e86d316ae942846b5b5ef0763","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-07T06:34:17.273281+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-07T12:49:43.487860Z","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:9558736cc9f6779257e6af80cb15594ac2e8c5d95d518b90d4fc51cd07c5606b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:963609390663b959eabdefacb3ee92cac0bb7c9521028d592a8f1d7c44b3d00b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:2cf5946b695c2e66a9b55ec6d167be7579d8f992aa12164fc4b19b6a3b08beab","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:9cbc698cabd08d2858e5ad6662f68487c10af3bdf69841b865956239e08ff6e9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:0819bcb038c1b255c7f828f4fe22b4273e682704c63837e7070e421f84148d0d","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-07T12:49:43.487860Z","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:599f759e7838d67a559b600b2aa2ab81e6f099ec30585324560dff35140714ff","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:67eb6968e44332d42cb1a55657be74f1ed6f1cb213a4659656868e2730dc8600","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:6566f0166ca3a5303da6eac8d374e54d747ae8d6b06b4d3a8076fa2b967f3026","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:d26161f8bd4cbd9cb103490c3dcba3f9f881c17cdfef9792a99d719028d79c1d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:4fcb9c16f68b11d73838251fa83de7c01d373ddd89f46e0d8103a24850a6653d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:3bfe3e35dc860557105f8b29ead120ed37fcb8d60305c6e1782182ac3843b5fb","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:ced910a313274cf78c768439efc86079eb0764f8be9a6aa5ed7b0f7226bb3a63","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:bc039f519952c96e91f52d529e90ef406d2a91de1c504563df3fd11f431b233b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:1820f55baa94be8e9e9ee4797e2a757669f1452149ec1514bb7783471d20db5d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:5fcf6b50cb0fcf687a6219b4b7b04808b5c2534ad0640af4b20a111740542750","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:baa603f8951799b141c46a2ff5e979b792d0520b3b24d711d6d6397fe9eb13b8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:618a0bc3ec4549fed928ee624babc94dfdf9e189c25b291fade0bbd8057a17bc","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:699c067fe07cbe0667d898c3ec4a7c8d501274bfec27f0d83936f329aaeff79b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:e71e4a45e211f379eea9e9fd6f869a092ccc312c808e1e2db70f3673477991d9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:e495972fe6bbac98d37a09ec2fa252e113cf8ccdd3aacb86fbadb37d9b4f9587","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-07T12:49:43.487860Z","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:a0af87396ecbf552b87c4f04dba73c456ad9260d79022b04f17678731d62c79f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T13:02:02.694030Z","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-07T12:49:43.487860Z","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:022575eaa2ad9d62e0869a07d53acf1e95a045f3c3c4d68b3b0afca8e7348aa5","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-07T12:49:43.487860Z","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:05c95f210da24c6487a3e64970331c7d362cfac41ee77acf90114e0471893cab","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:d9c463bf5835c2b3cc888323d091b2768d6dfa37d39f52e269e97d0148ebe8e6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:3016095b8f9cea854fed802cde8dc3d2f3a75ca044646a6367823a401e4287a7","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:9f54cc6080de1d3719f725cd25bdddbbee0542b04b7f3e407e367471c1fd0bec","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:3b94468aa80844878cafaf01023e056c74efab60d2144acdeb58458671382f53","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:35482af31324c7601886801418fe052923915c268f482cb3b15c53996a67fccb","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:2855e3159793ea25cdc09d3926348791d2f0de3322b7624949d8a29ec265f6d3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:f14176f049f5a5a40227a6d5839af8f19de4032ea37bffadd5dc1513c0d628b1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:4c35bbb9a8e2aaea466699ba8c66e112a352a5d3a0826ee566c861b619d12506","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:8ae88d25a742623b3a3cb5e6052d80d6e15908cc289f9fd4d6891669db9d5f18","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:375f46dc1aa9690525ce67544de77cc3e34e7a4287776f74e0245f4a8a631659","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:fffa7af737b8d3daf396abd528749920cc4e090020bd21eb83712afca60f2ea0","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:664f9409001337fe19a8fb63b71dc61504f2b663db8ae79cdd8184948f2edd0f","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-07T12:49:43.487860Z","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:71620513de04af3194859bf871dfc6016f3f25fad0f067244835bf6dc83c84d8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:31e4172f004f89dce41c54f9362ea1705890919f35fde174e49b1964821edc73","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:268878492fe24edfb96bd09f9c78f1352c86725007ba64134eeaece805795ff8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:687aa8514ed7dc73efbd0aad181b3bc2b2e25323742e11eb0e8eb7beb818fb0c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:b727ea76ca44bc55694af0202ceb7efce43a01710d8c98534d239bb17dd723b3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:f775c0d718b910e5b862c3bc228c043d43ce77d8a9101de0241eac32afbfb2d1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:2b832adad3a4e2907acb8f1f7cd8361e8a5b3c11c4d0c2725f3262e5ddb7f4a3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:ac471f54a34d6077ecc4bbbfbe7d7d633715a4430a78a563f20c84261adf71b8","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-07T12:49:43.487860Z","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:e72745e77d18c91c81aa12ce1bea300fe92a34fb6a621a44a9ed2caa2aa3c14a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:308c3aa4c4c5c11c52d3c22f21c8f6d4ef4126142c115a8f74742e9b77ad1eee","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:d79fba1990cee509446829fdd86d37d8a7a7f14c460415a512c09fe83b0b251a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:5f60eb6636a4d07d05229422f415cff3294e93c48b4e47fa70c8e7fcdd4b5047","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:61ea9ab724da15df94155879f7a5689a8332c0cff0eb512f11ee943204fc17ef","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:a5add2aa19507a9d7bdcb14b7bfb53fa9912a543fd26615b93c84ad01bb772a9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:14cec988302712298a96384fc7570c71cd734195da4be3a0ea6b775932afd19f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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:56d9a3ba4c3db0dae5a63f3515b6cb94ee8888fcc5e3e13d977fb85ae9766d13","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:49:43.487860Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 2 inbound Pith citation observations for arXiv:2505.23160."}