{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B2YQJD32Z5IXUOJPS6PTMZXEVV","short_pith_number":"pith:B2YQJD32","canonical_record":{"source":{"id":"1306.6378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T23:28:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fde9c77e63859a1e6e746817818530a3d265e08e665b7619b5ba064807bb1a83","abstract_canon_sha256":"716631a7d760fa4059c8b44f961df8f9b544a31f9ac869a5e99f57e331fca3b7"},"schema_version":"1.0"},"canonical_sha256":"0eb1048f7acf517a392f979f3666e4ad6afabb630dc5f063be668f5b7c513e5f","source":{"kind":"arxiv","id":"1306.6378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6378","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6378v1","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6378","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"B2YQJD32Z5IX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B2YQJD32Z5IXUOJP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B2YQJD32","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B2YQJD32Z5IXUOJPS6PTMZXEVV","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T23:28:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fde9c77e63859a1e6e746817818530a3d265e08e665b7619b5ba064807bb1a83","abstract_canon_sha256":"716631a7d760fa4059c8b44f961df8f9b544a31f9ac869a5e99f57e331fca3b7"},"schema_version":"1.0"},"canonical_sha256":"0eb1048f7acf517a392f979f3666e4ad6afabb630dc5f063be668f5b7c513e5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:44.952998Z","signature_b64":"5kPCqXjngYcNrYSbSO1Q1hTq5NgFpuf9KMZCK7bXNXeDzRqB8+3nw9YprORIggVVchjJvU7oS4CHdwpQ5JdUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb1048f7acf517a392f979f3666e4ad6afabb630dc5f063be668f5b7c513e5f","last_reissued_at":"2026-05-18T03:19:44.952351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:44.952351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6378","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-18T03:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDSkD6tb7y00050T85B6o9mnfo9oJ5Rt/n+T11UhICHXF2upV9FRm9ZJzpuRTQb8c66JvCEdZo7C718WOJQ+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:17:21.274168Z"},"content_sha256":"8b467602142000c88e084b0cc8ddaeacf5f1ddebd2b75b5d5e4457a2f62d33bb","schema_version":"1.0","event_id":"sha256:8b467602142000c88e084b0cc8ddaeacf5f1ddebd2b75b5d5e4457a2f62d33bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B2YQJD32Z5IXUOJPS6PTMZXEVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Reduced-Rank Adaptive Processing Based on Parallel Subgradient Projection and Krylov Subspace Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I. Yamada, M. Yukawa, R. C. de Lamare","submitted_at":"2013-06-26T23:28:51Z","abstract_excerpt":"In this paper, we propose a novel reduced-rank adaptive filtering algorithm by blending the idea of the Krylov subspace methods with the set-theoretic adaptive filtering framework. Unlike the existing Krylov-subspace-based reduced-rank methods, the proposed algorithm tracks the optimal point in the sense of minimizing the \\sinq{true} mean square error (MSE) in the Krylov subspace, even when the estimated statistics become erroneous (e.g., due to sudden changes of environments). Therefore, compared with those existing methods, the proposed algorithm is more suited to adaptive filtering applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6378","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8reBZQTB1q+uBAmcJ3kPP2xHzMBcrMJHyke5VBMZ0u1v8Pq0uspoG9gEoiKzOMvNxdU7BjaPzo610svvSONDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:17:21.274561Z"},"content_sha256":"616a193460e283478fdcb58f7545c9c8055225f5fad453dfda859b28e40c7357","schema_version":"1.0","event_id":"sha256:616a193460e283478fdcb58f7545c9c8055225f5fad453dfda859b28e40c7357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/bundle.json","state_url":"https://pith.science/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/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-05-20T07:17:21Z","links":{"resolver":"https://pith.science/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV","bundle":"https://pith.science/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/bundle.json","state":"https://pith.science/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2YQJD32Z5IXUOJPS6PTMZXEVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B2YQJD32Z5IXUOJPS6PTMZXEVV","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":"716631a7d760fa4059c8b44f961df8f9b544a31f9ac869a5e99f57e331fca3b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T23:28:51Z","title_canon_sha256":"fde9c77e63859a1e6e746817818530a3d265e08e665b7619b5ba064807bb1a83"},"schema_version":"1.0","source":{"id":"1306.6378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6378","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6378v1","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6378","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"B2YQJD32Z5IX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B2YQJD32Z5IXUOJP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B2YQJD32","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:616a193460e283478fdcb58f7545c9c8055225f5fad453dfda859b28e40c7357","target":"graph","created_at":"2026-05-18T03:19:44Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a novel reduced-rank adaptive filtering algorithm by blending the idea of the Krylov subspace methods with the set-theoretic adaptive filtering framework. Unlike the existing Krylov-subspace-based reduced-rank methods, the proposed algorithm tracks the optimal point in the sense of minimizing the \\sinq{true} mean square error (MSE) in the Krylov subspace, even when the estimated statistics become erroneous (e.g., due to sudden changes of environments). Therefore, compared with those existing methods, the proposed algorithm is more suited to adaptive filtering applicat","authors_text":"I. Yamada, M. Yukawa, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T23:28:51Z","title":"Robust Reduced-Rank Adaptive Processing Based on Parallel Subgradient Projection and Krylov Subspace Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6378","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b467602142000c88e084b0cc8ddaeacf5f1ddebd2b75b5d5e4457a2f62d33bb","target":"record","created_at":"2026-05-18T03:19:44Z","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":"716631a7d760fa4059c8b44f961df8f9b544a31f9ac869a5e99f57e331fca3b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T23:28:51Z","title_canon_sha256":"fde9c77e63859a1e6e746817818530a3d265e08e665b7619b5ba064807bb1a83"},"schema_version":"1.0","source":{"id":"1306.6378","kind":"arxiv","version":1}},"canonical_sha256":"0eb1048f7acf517a392f979f3666e4ad6afabb630dc5f063be668f5b7c513e5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eb1048f7acf517a392f979f3666e4ad6afabb630dc5f063be668f5b7c513e5f","first_computed_at":"2026-05-18T03:19:44.952351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:44.952351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5kPCqXjngYcNrYSbSO1Q1hTq5NgFpuf9KMZCK7bXNXeDzRqB8+3nw9YprORIggVVchjJvU7oS4CHdwpQ5JdUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:44.952998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b467602142000c88e084b0cc8ddaeacf5f1ddebd2b75b5d5e4457a2f62d33bb","sha256:616a193460e283478fdcb58f7545c9c8055225f5fad453dfda859b28e40c7357"],"state_sha256":"5b3f3e6f05d4b8f88bdacfa08419a80bdb8d95d1cad350e352ef1eeb0523f7f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fOukMh9MHFbwFB/AJdtlSB+gEBVLhTvsfNNihqsdMHyoMcH3pDuMP/HWKO7KKupekyYgOsKDIKt/zRU5aMKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T07:17:21.276794Z","bundle_sha256":"60ef78995228dab01091363b44533cbe9e68f65a03a14e75a5f9f0a048bc074d"}}