{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J6JLORGKZCGPZK37NESLW4TONF","short_pith_number":"pith:J6JLORGK","canonical_record":{"source":{"id":"2605.18432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T14:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"d40140e3ff0c94fb8dbef5b2ed40294f21e781d80325c1c64a845513086b486c","abstract_canon_sha256":"a89e1dd4d0086b09d11227f4956a7b554c8f11d0f0878c7552cfdc0cf52a5afc"},"schema_version":"1.0"},"canonical_sha256":"4f92b744cac88cfcab7f6924bb726e6964a41a587b91e2d2b15ac56f8460dbba","source":{"kind":"arxiv","id":"2605.18432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18432","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18432v1","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18432","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"J6JLORGKZCGP","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"J6JLORGKZCGPZK37","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"J6JLORGK","created_at":"2026-05-20T00:06:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J6JLORGKZCGPZK37NESLW4TONF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T14:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"d40140e3ff0c94fb8dbef5b2ed40294f21e781d80325c1c64a845513086b486c","abstract_canon_sha256":"a89e1dd4d0086b09d11227f4956a7b554c8f11d0f0878c7552cfdc0cf52a5afc"},"schema_version":"1.0"},"canonical_sha256":"4f92b744cac88cfcab7f6924bb726e6964a41a587b91e2d2b15ac56f8460dbba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:00.672848Z","signature_b64":"pg0OQn+buSTyleHwYMAwpSye/Z/WTxZsFLZVyzh2hFaCxRZm93aLLxVrrernvYgg7IQ+Q9TI6lDUFo1msFdhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f92b744cac88cfcab7f6924bb726e6964a41a587b91e2d2b15ac56f8460dbba","last_reissued_at":"2026-05-20T00:06:00.672052Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:00.672052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18432","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EumkpAxXKsEYROfYu820tF24f2krf1+VgbryRf8RP5vsAFo0IIGo2ewGUvouArOLOSE433WibIwhbT/5ElpiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:12.076837Z"},"content_sha256":"fd49e9314de1a2849d592ee553d63a1e9ea61fd9dc711064a4dd2d64ac4d02c7","schema_version":"1.0","event_id":"sha256:fd49e9314de1a2849d592ee553d63a1e9ea61fd9dc711064a4dd2d64ac4d02c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J6JLORGKZCGPZK37NESLW4TONF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Augmented Set-membership Affine Projection Algorithm and Its Performance Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chen Wang, Haiquan Zhao, Wenjing Luo, Xiaoqiang Long, Xinnian Guo, Yalin Liu","submitted_at":"2026-05-18T14:05:31Z","abstract_excerpt":"The augmented affine projection algorithm (AAPA) has considerably excellent performance for highly colored input signals. However, the direct matrix inversion operation leads to a high computational complexity, especially with high projection order. Inspired by the excellent characteristics of set-membership filtering (SMF), this paper proposes the augmented set-membership affine projection algorithm (ASM-APA), which not only has low computational complexity but also offers improved performance compared with AAPA. Then, the computational complexity and stability of ASM-APA are analyzed, and th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The augmented set-membership affine projection algorithm (ASM-APA) not only has low computational complexity but also offers improved performance compared with AAPA, with a provided condition for maintaining stability.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That directly incorporating set-membership filtering into the augmented APA structure preserves or enhances convergence behavior while cutting complexity, without introducing new instability or performance loss under the tested conditions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The ASM-APA combines set-membership filtering with augmented affine projection to deliver lower computational complexity and improved performance over AAPA for colored signals, supported by complexity and stability analysis.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"86820c262eebc6643d7c1f710195fbc0b02f4e24b0bf80199cc449171ad28a72"},"source":{"id":"2605.18432","kind":"arxiv","version":1},"verdict":{"id":"c8e690ce-39ca-4227-bfa9-be6e98b49cd0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:54:05.601351Z","strongest_claim":"The augmented set-membership affine projection algorithm (ASM-APA) not only has low computational complexity but also offers improved performance compared with AAPA, with a provided condition for maintaining stability.","one_line_summary":"The ASM-APA combines set-membership filtering with augmented affine projection to deliver lower computational complexity and improved performance over AAPA for colored signals, supported by complexity and stability analysis.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That directly incorporating set-membership filtering into the augmented APA structure preserves or enhances convergence behavior while cutting complexity, without introducing new instability or performance loss under the tested conditions.","pith_extraction_headline":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18432/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.244239Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-20T00:01:04.246261Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T23:49:49.183701Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:27.572307Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:32.553538Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T23:21:58.906203Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.654538Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"93fbe9520a838da7ff024f9d4c8d7a78856896e0bdb61e9db1693f4c20d228a0"},"references":{"count":28,"sample":[{"doi":"10.1007/s00034-","year":2022,"title":"A Family of Adaptive V olterra Filters Based on Maximum Correntropy Criterion for Improved Active Control of Impulsive Noise,","work_id":"8a1c2212-62c4-4359-909a-1fdb166a5e7d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00034-022-","year":2023,"title":"A New Affine Projection Algorithm with Adaptive l0-norm Constraint for Block-Sparse System Identification,","work_id":"28638abd-a258-4ff1-92d4-fe2ce7b41590","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tcsii.2021.3082425","year":2022,"title":"Robust Proportionate Normalized Least Mean M -Estimate Algorithm for Block -Sparse System Identification,","work_id":"10f5dbf1-0a14-44e0-ac0f-5fcfa91eef24","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00034-023-02303-8","year":2023,"title":"Variable Step -size LMS Algorithm Based on Hyperbolic Tangent Function,","work_id":"344ba5ae-5e6c-4a55-88ba-5235d5899f83","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tcsii.2022.3145569","year":2022,"title":"Lawson -Norm-Based Adaptive Filter for Channel Estimation and In -Car Echo Cancellation,","work_id":"b5aa2b82-f890-4539-b6e0-b78033ae82a4","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":28,"snapshot_sha256":"a2a0cc492bb18fea701dfe7706fb3672ea8b37c503020e4b4bb1195d285250ba","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"45299b80269ce2555d8b54156d329eaa0d50108a7ae990495eac14365fb24875"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c8e690ce-39ca-4227-bfa9-be6e98b49cd0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AfHd00oMa4/wazZlZOxwk6VG+btkLFa/n1JjKIWb3BW2JInpU9yt+aKXy5rr/WTzB5GyHvE2vjgOspx3MbdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:12.077463Z"},"content_sha256":"ca4217762a816356acdfb2134f53c3874d6a5726dfcd637352a6febcd1523007","schema_version":"1.0","event_id":"sha256:ca4217762a816356acdfb2134f53c3874d6a5726dfcd637352a6febcd1523007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6JLORGKZCGPZK37NESLW4TONF/bundle.json","state_url":"https://pith.science/pith/J6JLORGKZCGPZK37NESLW4TONF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6JLORGKZCGPZK37NESLW4TONF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:45:12Z","links":{"resolver":"https://pith.science/pith/J6JLORGKZCGPZK37NESLW4TONF","bundle":"https://pith.science/pith/J6JLORGKZCGPZK37NESLW4TONF/bundle.json","state":"https://pith.science/pith/J6JLORGKZCGPZK37NESLW4TONF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6JLORGKZCGPZK37NESLW4TONF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J6JLORGKZCGPZK37NESLW4TONF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a89e1dd4d0086b09d11227f4956a7b554c8f11d0f0878c7552cfdc0cf52a5afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T14:05:31Z","title_canon_sha256":"d40140e3ff0c94fb8dbef5b2ed40294f21e781d80325c1c64a845513086b486c"},"schema_version":"1.0","source":{"id":"2605.18432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18432","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18432v1","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18432","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"J6JLORGKZCGP","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"J6JLORGKZCGPZK37","created_at":"2026-05-20T00:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"J6JLORGK","created_at":"2026-05-20T00:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:ca4217762a816356acdfb2134f53c3874d6a5726dfcd637352a6febcd1523007","target":"graph","created_at":"2026-05-20T00:06:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The augmented set-membership affine projection algorithm (ASM-APA) not only has low computational complexity but also offers improved performance compared with AAPA, with a provided condition for maintaining stability."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That directly incorporating set-membership filtering into the augmented APA structure preserves or enhances convergence behavior while cutting complexity, without introducing new instability or performance loss under the tested conditions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The ASM-APA combines set-membership filtering with augmented affine projection to deliver lower computational complexity and improved performance over AAPA for colored signals, supported by complexity and stability analysis."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs."}],"snapshot_sha256":"86820c262eebc6643d7c1f710195fbc0b02f4e24b0bf80199cc449171ad28a72"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"45299b80269ce2555d8b54156d329eaa0d50108a7ae990495eac14365fb24875"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.244239Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T00:01:04.246261Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T23:49:49.183701Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:27.572307Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:31:32.553538Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T23:21:58.906203Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.654538Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18432/integrity.json","findings":[],"snapshot_sha256":"93fbe9520a838da7ff024f9d4c8d7a78856896e0bdb61e9db1693f4c20d228a0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The augmented affine projection algorithm (AAPA) has considerably excellent performance for highly colored input signals. However, the direct matrix inversion operation leads to a high computational complexity, especially with high projection order. Inspired by the excellent characteristics of set-membership filtering (SMF), this paper proposes the augmented set-membership affine projection algorithm (ASM-APA), which not only has low computational complexity but also offers improved performance compared with AAPA. Then, the computational complexity and stability of ASM-APA are analyzed, and th","authors_text":"Chen Wang, Haiquan Zhao, Wenjing Luo, Xiaoqiang Long, Xinnian Guo, Yalin Liu","cross_cats":[],"headline":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T14:05:31Z","title":"Augmented Set-membership Affine Projection Algorithm and Its Performance Analysis"},"references":{"count":28,"internal_anchors":0,"resolved_work":28,"sample":[{"cited_arxiv_id":"","doi":"10.1007/s00034-","is_internal_anchor":false,"ref_index":1,"title":"A Family of Adaptive V olterra Filters Based on Maximum Correntropy Criterion for Improved Active Control of Impulsive Noise,","work_id":"8a1c2212-62c4-4359-909a-1fdb166a5e7d","year":2022},{"cited_arxiv_id":"","doi":"10.1007/s00034-022-","is_internal_anchor":false,"ref_index":2,"title":"A New Affine Projection Algorithm with Adaptive l0-norm Constraint for Block-Sparse System Identification,","work_id":"28638abd-a258-4ff1-92d4-fe2ce7b41590","year":2023},{"cited_arxiv_id":"","doi":"10.1109/tcsii.2021.3082425","is_internal_anchor":false,"ref_index":3,"title":"Robust Proportionate Normalized Least Mean M -Estimate Algorithm for Block -Sparse System Identification,","work_id":"10f5dbf1-0a14-44e0-ac0f-5fcfa91eef24","year":2022},{"cited_arxiv_id":"","doi":"10.1007/s00034-023-02303-8","is_internal_anchor":false,"ref_index":4,"title":"Variable Step -size LMS Algorithm Based on Hyperbolic Tangent Function,","work_id":"344ba5ae-5e6c-4a55-88ba-5235d5899f83","year":2023},{"cited_arxiv_id":"","doi":"10.1109/tcsii.2022.3145569","is_internal_anchor":false,"ref_index":5,"title":"Lawson -Norm-Based Adaptive Filter for Channel Estimation and In -Car Echo Cancellation,","work_id":"b5aa2b82-f890-4539-b6e0-b78033ae82a4","year":2022}],"snapshot_sha256":"a2a0cc492bb18fea701dfe7706fb3672ea8b37c503020e4b4bb1195d285250ba"},"source":{"id":"2605.18432","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:54:05.601351Z","id":"c8e690ce-39ca-4227-bfa9-be6e98b49cd0","model_set":{"reader":"grok-4.3"},"one_line_summary":"The ASM-APA combines set-membership filtering with augmented affine projection to deliver lower computational complexity and improved performance over AAPA for colored signals, supported by complexity and stability analysis.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The augmented set-membership affine projection algorithm reduces computational complexity while delivering better performance than the standard augmented affine projection algorithm on colored inputs.","strongest_claim":"The augmented set-membership affine projection algorithm (ASM-APA) not only has low computational complexity but also offers improved performance compared with AAPA, with a provided condition for maintaining stability.","weakest_assumption":"That directly incorporating set-membership filtering into the augmented APA structure preserves or enhances convergence behavior while cutting complexity, without introducing new instability or performance loss under the tested conditions."}},"verdict_id":"c8e690ce-39ca-4227-bfa9-be6e98b49cd0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fd49e9314de1a2849d592ee553d63a1e9ea61fd9dc711064a4dd2d64ac4d02c7","target":"record","created_at":"2026-05-20T00:06:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a89e1dd4d0086b09d11227f4956a7b554c8f11d0f0878c7552cfdc0cf52a5afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T14:05:31Z","title_canon_sha256":"d40140e3ff0c94fb8dbef5b2ed40294f21e781d80325c1c64a845513086b486c"},"schema_version":"1.0","source":{"id":"2605.18432","kind":"arxiv","version":1}},"canonical_sha256":"4f92b744cac88cfcab7f6924bb726e6964a41a587b91e2d2b15ac56f8460dbba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f92b744cac88cfcab7f6924bb726e6964a41a587b91e2d2b15ac56f8460dbba","first_computed_at":"2026-05-20T00:06:00.672052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:06:00.672052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pg0OQn+buSTyleHwYMAwpSye/Z/WTxZsFLZVyzh2hFaCxRZm93aLLxVrrernvYgg7IQ+Q9TI6lDUFo1msFdhAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:06:00.672848Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd49e9314de1a2849d592ee553d63a1e9ea61fd9dc711064a4dd2d64ac4d02c7","sha256:ca4217762a816356acdfb2134f53c3874d6a5726dfcd637352a6febcd1523007"],"state_sha256":"cfc900098a21047fc45e782a6c1f985484fe6239730177448ae509d492a64d12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5dznQJ+Oxt+FUCqKmY8gu4+k0JC6Z5A/2+5DOnfwObFeNBKElmlasDDR7gfXv3yQslcIK1CdZUeZ3z1YB6gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:45:12.079963Z","bundle_sha256":"06a1d86e9da2ab71d5ad11901118ed40182483f95ea0dd18e97eea5c9a7e8b0b"}}