{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NRJR3ZHHJ7HRDUBAUBEN5YLFDF","short_pith_number":"pith:NRJR3ZHH","canonical_record":{"source":{"id":"2605.26950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-26T12:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"58d8b69ea5881af7c062c9ac4a455e8240362dfcd2fe9a75087dba90e4aa01ab","abstract_canon_sha256":"312cc303113a9cd170f2f5687a34106c469342f8e6f8ec67c93e62fde2554fc8"},"schema_version":"1.0"},"canonical_sha256":"6c531de4e74fcf11d020a048dee16519517a54cc2b59f27b3d489e89879193b6","source":{"kind":"arxiv","id":"2605.26950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26950","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26950v1","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26950","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NRJR3ZHHJ7HR","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_16","alias_value":"NRJR3ZHHJ7HRDUBA","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_8","alias_value":"NRJR3ZHH","created_at":"2026-05-27T01:06:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NRJR3ZHHJ7HRDUBAUBEN5YLFDF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.26950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-26T12:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"58d8b69ea5881af7c062c9ac4a455e8240362dfcd2fe9a75087dba90e4aa01ab","abstract_canon_sha256":"312cc303113a9cd170f2f5687a34106c469342f8e6f8ec67c93e62fde2554fc8"},"schema_version":"1.0"},"canonical_sha256":"6c531de4e74fcf11d020a048dee16519517a54cc2b59f27b3d489e89879193b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:21.192161Z","signature_b64":"Hkf7l30niOatL4SUX2Qy2vmBdgXEI1IdATAck2exrxA2oIY2taqY0IwjZ4+76ampvOLLAP8hBD8GnyuIdkM1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c531de4e74fcf11d020a048dee16519517a54cc2b59f27b3d489e89879193b6","last_reissued_at":"2026-05-27T01:06:21.191441Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:21.191441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.26950","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-27T01:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzy1jRM6i8FVfDm7rEC5zqTGFNOemGeCPyX6wKFP21nkXCFNsCTbpHJXqYDJ0YWRyirGg9Y+i6HueYo4/8vpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:38:45.152724Z"},"content_sha256":"302f792e30e39d8877452432a5159386bed02c05020d88ca0486881b6b2afa73","schema_version":"1.0","event_id":"sha256:302f792e30e39d8877452432a5159386bed02c05020d88ca0486881b6b2afa73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NRJR3ZHHJ7HRDUBAUBEN5YLFDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Half-Quadratic Criterion based Adaptive Graph Signal Processing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chengjin Li, Chong Zhang, Haiquan Zhao","submitted_at":"2026-05-26T12:41:21Z","abstract_excerpt":"In recent years, progress in adaptive graph signal processing algorithms has provided effective solutions for processing signals defined on graph structures. As a classical strategy in information theory, the Generalized Maximum Correntropy Criterion (GMCC) exhibits good resistance to non-Gaussian noises. When non-Gaussian noise interferes with the graph signal, the graph signal processing algorithm based on GMCC (GSP GMCC) algorithm shows better performance. However, the GSP GMCC algorithm itself has three parameters that need to be manually tuned, and the process of manually tuning the param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26950","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/2605.26950/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"},"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-27T01:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PL70vlGc5cGLE48uCHzuUwdpNETWqVgFsUSTxq0dywrWLrzLC3w2eldcpt7/+uu47Ol3jsQVeTR9Js7Pcx8lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:38:45.153108Z"},"content_sha256":"db8b919b9ddef1fd71a0dc0242f7fcd254e72bf64b4135488a4b0e420ad5d0b0","schema_version":"1.0","event_id":"sha256:db8b919b9ddef1fd71a0dc0242f7fcd254e72bf64b4135488a4b0e420ad5d0b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/bundle.json","state_url":"https://pith.science/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/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-01T03:38:45Z","links":{"resolver":"https://pith.science/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF","bundle":"https://pith.science/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/bundle.json","state":"https://pith.science/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRJR3ZHHJ7HRDUBAUBEN5YLFDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NRJR3ZHHJ7HRDUBAUBEN5YLFDF","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":"312cc303113a9cd170f2f5687a34106c469342f8e6f8ec67c93e62fde2554fc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-26T12:41:21Z","title_canon_sha256":"58d8b69ea5881af7c062c9ac4a455e8240362dfcd2fe9a75087dba90e4aa01ab"},"schema_version":"1.0","source":{"id":"2605.26950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26950","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26950v1","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26950","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NRJR3ZHHJ7HR","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_16","alias_value":"NRJR3ZHHJ7HRDUBA","created_at":"2026-05-27T01:06:21Z"},{"alias_kind":"pith_short_8","alias_value":"NRJR3ZHH","created_at":"2026-05-27T01:06:21Z"}],"graph_snapshots":[{"event_id":"sha256:db8b919b9ddef1fd71a0dc0242f7fcd254e72bf64b4135488a4b0e420ad5d0b0","target":"graph","created_at":"2026-05-27T01:06:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26950/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, progress in adaptive graph signal processing algorithms has provided effective solutions for processing signals defined on graph structures. As a classical strategy in information theory, the Generalized Maximum Correntropy Criterion (GMCC) exhibits good resistance to non-Gaussian noises. When non-Gaussian noise interferes with the graph signal, the graph signal processing algorithm based on GMCC (GSP GMCC) algorithm shows better performance. However, the GSP GMCC algorithm itself has three parameters that need to be manually tuned, and the process of manually tuning the param","authors_text":"Chengjin Li, Chong Zhang, Haiquan Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-26T12:41:21Z","title":"Half-Quadratic Criterion based Adaptive Graph Signal Processing Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26950","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:302f792e30e39d8877452432a5159386bed02c05020d88ca0486881b6b2afa73","target":"record","created_at":"2026-05-27T01:06:21Z","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":"312cc303113a9cd170f2f5687a34106c469342f8e6f8ec67c93e62fde2554fc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-26T12:41:21Z","title_canon_sha256":"58d8b69ea5881af7c062c9ac4a455e8240362dfcd2fe9a75087dba90e4aa01ab"},"schema_version":"1.0","source":{"id":"2605.26950","kind":"arxiv","version":1}},"canonical_sha256":"6c531de4e74fcf11d020a048dee16519517a54cc2b59f27b3d489e89879193b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c531de4e74fcf11d020a048dee16519517a54cc2b59f27b3d489e89879193b6","first_computed_at":"2026-05-27T01:06:21.191441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:06:21.191441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hkf7l30niOatL4SUX2Qy2vmBdgXEI1IdATAck2exrxA2oIY2taqY0IwjZ4+76ampvOLLAP8hBD8GnyuIdkM1Ag==","signature_status":"signed_v1","signed_at":"2026-05-27T01:06:21.192161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:302f792e30e39d8877452432a5159386bed02c05020d88ca0486881b6b2afa73","sha256:db8b919b9ddef1fd71a0dc0242f7fcd254e72bf64b4135488a4b0e420ad5d0b0"],"state_sha256":"e7de6ab19ec23ecd2382fae3ff7cafebb9b23fc15d9cc1f545b4b72900053ac1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcRJTXVhg455Rp/XDhropYQMNp4J73dXzaQZ5LIBc5sYLRCkyrWlrh116bvd8e7dSHZGOP2LGheG27F/I7ECDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:38:45.155226Z","bundle_sha256":"ede9cf57fbbc6571be39e71c18f729a0d8f6734e72248090385fcdc67948cb26"}}