{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3K7NXQMICWKFLMWIZUEECDCVHM","short_pith_number":"pith:3K7NXQMI","schema_version":"1.0","canonical_sha256":"dabedbc188159455b2c8cd08410c553b2a10b96e8688b0d3c09d1da9369f3d1e","source":{"kind":"arxiv","id":"1805.01307","version":1},"attestation_state":"computed","paper":{"title":"Convex Combination of Overlap-Save Frequency-Domain Adaptive Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sihai Guan, Zhi Li","submitted_at":"2018-05-03T13:45:09Z","abstract_excerpt":"In order to decrease the steady-state error and reduce the computational complexity and increase the ability to identify a large unknown system, a convex combination of overlap-save frequency-domain adaptive filters (COSFDAF) algorithm is proposed. From the articles available, most papers discuss convex combinations of adaptive-filter algorithms focusing on the time domain. Those algorithms show better performances in convergence speed and steady-state error. The major defect of those algorithms, however, is the computational complexity. To deal with this problem and motivated by frequency-dom"},"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":"1805.01307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-03T13:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"1e178e4a49af3786418b3a3d197c18a781e5a6d32e081588ec030763044e4089","abstract_canon_sha256":"9e11b9fd28f4ba5a8dba75ee155b3e4f49c270be677aa38e3c27865d5aa0ace1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:51.811289Z","signature_b64":"70PdMQo+egOc958+R2WQRvRK4edZHn+KyhAmuf3TDifORfkiRQ9/39ZZy/4StJQF4cdJd0JLVWwH7R8fViJVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabedbc188159455b2c8cd08410c553b2a10b96e8688b0d3c09d1da9369f3d1e","last_reissued_at":"2026-05-18T00:16:51.810640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:51.810640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Combination of Overlap-Save Frequency-Domain Adaptive Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sihai Guan, Zhi Li","submitted_at":"2018-05-03T13:45:09Z","abstract_excerpt":"In order to decrease the steady-state error and reduce the computational complexity and increase the ability to identify a large unknown system, a convex combination of overlap-save frequency-domain adaptive filters (COSFDAF) algorithm is proposed. From the articles available, most papers discuss convex combinations of adaptive-filter algorithms focusing on the time domain. Those algorithms show better performances in convergence speed and steady-state error. The major defect of those algorithms, however, is the computational complexity. To deal with this problem and motivated by frequency-dom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01307","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":"1805.01307","created_at":"2026-05-18T00:16:51.810742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01307v1","created_at":"2026-05-18T00:16:51.810742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01307","created_at":"2026-05-18T00:16:51.810742+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K7NXQMICWKF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K7NXQMICWKFLMWI","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K7NXQMI","created_at":"2026-05-18T12:32:02.567920+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/3K7NXQMICWKFLMWIZUEECDCVHM","json":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM.json","graph_json":"https://pith.science/api/pith-number/3K7NXQMICWKFLMWIZUEECDCVHM/graph.json","events_json":"https://pith.science/api/pith-number/3K7NXQMICWKFLMWIZUEECDCVHM/events.json","paper":"https://pith.science/paper/3K7NXQMI"},"agent_actions":{"view_html":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM","download_json":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM.json","view_paper":"https://pith.science/paper/3K7NXQMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01307&json=true","fetch_graph":"https://pith.science/api/pith-number/3K7NXQMICWKFLMWIZUEECDCVHM/graph.json","fetch_events":"https://pith.science/api/pith-number/3K7NXQMICWKFLMWIZUEECDCVHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM/action/storage_attestation","attest_author":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM/action/author_attestation","sign_citation":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM/action/citation_signature","submit_replication":"https://pith.science/pith/3K7NXQMICWKFLMWIZUEECDCVHM/action/replication_record"}},"created_at":"2026-05-18T00:16:51.810742+00:00","updated_at":"2026-05-18T00:16:51.810742+00:00"}