{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Q4R26VA27JLYUX2LFSF25MZLB2","short_pith_number":"pith:Q4R26VA2","schema_version":"1.0","canonical_sha256":"8723af541afa578a5f4b2c8baeb32b0eb7fb87e8d4c485ae7f9f3d39d09e3879","source":{"kind":"arxiv","id":"1112.5716","version":1},"attestation_state":"computed","paper":{"title":"A Sparsity-Aware Adaptive Algorithm for Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Konstantinos Slavakis, Sergios Theodoridis, Symeon Chouvardas, Yannis Kopsinis","submitted_at":"2011-12-24T11:21:26Z","abstract_excerpt":"In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this paper, the property sets take the form of hyperslabs. The goal is to find a point that belongs to the intersection of these hyperslabs. To this end, sparsity encouraging variable metric projections onto th"},"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":"1112.5716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-24T11:21:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49d977fb46d094c582344ee13ef234e5c0b383d08250c5ee6a0b1ebe95895125","abstract_canon_sha256":"39fb82c0d9b2d57a40eb3ac34e44bc39776d6790ff314198d815fb878e66938a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:00.748545Z","signature_b64":"dBTDnue3xViYgGCQdWQkr/8eaLutu10ku5A30sJ1ph3b2nYlkvxMLjkRuzdJyDbjO0cuHbiOPQSnSASRPuGSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8723af541afa578a5f4b2c8baeb32b0eb7fb87e8d4c485ae7f9f3d39d09e3879","last_reissued_at":"2026-05-18T01:59:00.747841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:00.747841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sparsity-Aware Adaptive Algorithm for Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Konstantinos Slavakis, Sergios Theodoridis, Symeon Chouvardas, Yannis Kopsinis","submitted_at":"2011-12-24T11:21:26Z","abstract_excerpt":"In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this paper, the property sets take the form of hyperslabs. The goal is to find a point that belongs to the intersection of these hyperslabs. To this end, sparsity encouraging variable metric projections onto th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5716","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":""},"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":"1112.5716","created_at":"2026-05-18T01:59:00.747945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5716v1","created_at":"2026-05-18T01:59:00.747945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5716","created_at":"2026-05-18T01:59:00.747945+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4R26VA27JLY","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4R26VA27JLYUX2L","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4R26VA2","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2","json":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2.json","graph_json":"https://pith.science/api/pith-number/Q4R26VA27JLYUX2LFSF25MZLB2/graph.json","events_json":"https://pith.science/api/pith-number/Q4R26VA27JLYUX2LFSF25MZLB2/events.json","paper":"https://pith.science/paper/Q4R26VA2"},"agent_actions":{"view_html":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2","download_json":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2.json","view_paper":"https://pith.science/paper/Q4R26VA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5716&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4R26VA27JLYUX2LFSF25MZLB2/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4R26VA27JLYUX2LFSF25MZLB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2/action/storage_attestation","attest_author":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2/action/author_attestation","sign_citation":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2/action/citation_signature","submit_replication":"https://pith.science/pith/Q4R26VA27JLYUX2LFSF25MZLB2/action/replication_record"}},"created_at":"2026-05-18T01:59:00.747945+00:00","updated_at":"2026-05-18T01:59:00.747945+00:00"}