{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IWH6775QWLI3TNW64A3YQPFLPM","short_pith_number":"pith:IWH6775Q","schema_version":"1.0","canonical_sha256":"458fefffb0b2d1b9b6dee037883cab7b36e7273fa069aa01f6265fe5fc3abd15","source":{"kind":"arxiv","id":"2505.23160","version":1},"attestation_state":"computed","paper":{"title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Claudio Battiloro, Lorenzo Marinucci, Paolo Di Lorenzo","submitted_at":"2025-05-29T06:55:19Z","abstract_excerpt":"This paper introduces a novel adaptive framework for processing dynamic flow signals over simplicial complexes, extending classical least-mean-squares (LMS) methods to high-order topological domains. Building on discrete Hodge theory, we present a topological LMS algorithm that efficiently processes streaming signals observed over time-varying edge subsets. We provide a detailed stochastic analysis of the algorithm, deriving its stability conditions, steady-state mean-square-error, and convergence speed, while exploring the impact of edge sampling on performance. We also propose strategies to "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.23160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-05-29T06:55:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c0bf8ac68c70658de7f05ab7c3a2fe1e3cfbbff40a3b71fc21032b5a55eb1ee4","abstract_canon_sha256":"86ba249b02119a1820871b18c3dbf297720886c91a25500b1efbaf18dfa196dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:56.645600Z","signature_b64":"MFA5Viih3gueOQfSvbnHagQutDewdy1qHkzBwAQBfNkIS8kWe5YBnv9a7LzMOiJHm75hrG2xFBeNv7hixGDzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"458fefffb0b2d1b9b6dee037883cab7b36e7273fa069aa01f6265fe5fc3abd15","last_reissued_at":"2026-07-05T11:11:56.645053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:56.645053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Claudio Battiloro, Lorenzo Marinucci, Paolo Di Lorenzo","submitted_at":"2025-05-29T06:55:19Z","abstract_excerpt":"This paper introduces a novel adaptive framework for processing dynamic flow signals over simplicial complexes, extending classical least-mean-squares (LMS) methods to high-order topological domains. Building on discrete Hodge theory, we present a topological LMS algorithm that efficiently processes streaming signals observed over time-varying edge subsets. We provide a detailed stochastic analysis of the algorithm, deriving its stability conditions, steady-state mean-square-error, and convergence speed, while exploring the impact of edge sampling on performance. We also propose strategies to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23160","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.23160/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.23160","created_at":"2026-07-05T11:11:56.645108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23160v1","created_at":"2026-07-05T11:11:56.645108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23160","created_at":"2026-07-05T11:11:56.645108+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWH6775QWLI3","created_at":"2026-07-05T11:11:56.645108+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWH6775QWLI3TNW6","created_at":"2026-07-05T11:11:56.645108+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWH6775Q","created_at":"2026-07-05T11:11:56.645108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15955","citing_title":"Topological Kalman Filtering on Cell Complexes","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15955","citing_title":"Topological Kalman Filtering on Cell Complexes","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM","json":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM.json","graph_json":"https://pith.science/api/pith-number/IWH6775QWLI3TNW64A3YQPFLPM/graph.json","events_json":"https://pith.science/api/pith-number/IWH6775QWLI3TNW64A3YQPFLPM/events.json","paper":"https://pith.science/paper/IWH6775Q"},"agent_actions":{"view_html":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM","download_json":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM.json","view_paper":"https://pith.science/paper/IWH6775Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23160&json=true","fetch_graph":"https://pith.science/api/pith-number/IWH6775QWLI3TNW64A3YQPFLPM/graph.json","fetch_events":"https://pith.science/api/pith-number/IWH6775QWLI3TNW64A3YQPFLPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM/action/storage_attestation","attest_author":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM/action/author_attestation","sign_citation":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM/action/citation_signature","submit_replication":"https://pith.science/pith/IWH6775QWLI3TNW64A3YQPFLPM/action/replication_record"}},"created_at":"2026-07-05T11:11:56.645108+00:00","updated_at":"2026-07-05T11:11:56.645108+00:00"}