{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6HUJAB7Q33GDLCBGWQUDXRSQBN","short_pith_number":"pith:6HUJAB7Q","canonical_record":{"source":{"id":"1805.11987","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T14:01:55Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"87bd95b45801416b1bb59b9d481351d7a3ad31804cd0741bdd312fc439eb60f6","abstract_canon_sha256":"dfdc401dc6b23dc1bdbd36c4be4d171e5ab57a64f8e842123bb965b88f9ff6f3"},"schema_version":"1.0"},"canonical_sha256":"f1e89007f0decc358826b4283bc6500b4ad495648a36dc64dafc6d88f96f0f68","source":{"kind":"arxiv","id":"1805.11987","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11987","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11987v3","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11987","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"6HUJAB7Q33GD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HUJAB7Q33GDLCBG","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HUJAB7Q","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6HUJAB7Q33GDLCBGWQUDXRSQBN","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11987","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T14:01:55Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"87bd95b45801416b1bb59b9d481351d7a3ad31804cd0741bdd312fc439eb60f6","abstract_canon_sha256":"dfdc401dc6b23dc1bdbd36c4be4d171e5ab57a64f8e842123bb965b88f9ff6f3"},"schema_version":"1.0"},"canonical_sha256":"f1e89007f0decc358826b4283bc6500b4ad495648a36dc64dafc6d88f96f0f68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:48.880257Z","signature_b64":"kLB1u6GVoobumue693bIBL+FY2eabolzlkBkho7eE7zRTsDcJHvjG3KDkxxuwWfxExM7TTIFUy2fYEQvhlRnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e89007f0decc358826b4283bc6500b4ad495648a36dc64dafc6d88f96f0f68","last_reissued_at":"2026-05-18T00:01:48.879760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:48.879760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11987","source_version":3,"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-18T00:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Grg42epcLEZZzAM51WlqNbxVB9efad7GPrvBXVVdsNtIQsGxfnxoe8bzidaGcZUKZSOieIpLCMX8qfQ4AXVkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T16:55:52.717760Z"},"content_sha256":"5a503a05453db49369884cdc27c10a2d542a08ae4803b2bb4df6862ee4422187","schema_version":"1.0","event_id":"sha256:5a503a05453db49369884cdc27c10a2d542a08ae4803b2bb4df6862ee4422187"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6HUJAB7Q33GDLCBGWQUDXRSQBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"l0-norm Based Centers Selection for Training Fault Tolerant RBF Networks and Selecting Centers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi-Sing Leung, Hao Wang, Hing Cheung So, Ruibin Feng, Zifa Han","submitted_at":"2018-05-30T14:01:55Z","abstract_excerpt":"The aim of this paper is to train an RBF neural network and select centers under concurrent faults. It is well known that fault tolerance is a very attractive property for neural networks. And center selection is an important procedure during the training process of an RBF neural network. In this paper, we devise two novel algorithms to address these two issues simultaneously. Both of them are based on the ADMM framework. In the first method, the minimax concave penalty (MCP) function is introduced to select centers. In the second method, an l0-norm term is directly used, and the hard threshol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11987","kind":"arxiv","version":3},"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-18T00:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWz/J6QZIMEo7Tep/VxSBg3VvHDu7pBGdcFqGdAzarohzJAkIyJGdyFxALLNY3OIbreIfQ4m1VibawQwfBMcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T16:55:52.718116Z"},"content_sha256":"b35db7bf0103fda6ebe649a8a59e748704658636400d3454ab48d94084d5395d","schema_version":"1.0","event_id":"sha256:b35db7bf0103fda6ebe649a8a59e748704658636400d3454ab48d94084d5395d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/bundle.json","state_url":"https://pith.science/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/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-07-26T16:55:52Z","links":{"resolver":"https://pith.science/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN","bundle":"https://pith.science/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/bundle.json","state":"https://pith.science/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HUJAB7Q33GDLCBGWQUDXRSQBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6HUJAB7Q33GDLCBGWQUDXRSQBN","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":"dfdc401dc6b23dc1bdbd36c4be4d171e5ab57a64f8e842123bb965b88f9ff6f3","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T14:01:55Z","title_canon_sha256":"87bd95b45801416b1bb59b9d481351d7a3ad31804cd0741bdd312fc439eb60f6"},"schema_version":"1.0","source":{"id":"1805.11987","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11987","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11987v3","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11987","created_at":"2026-05-18T00:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"6HUJAB7Q33GD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HUJAB7Q33GDLCBG","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HUJAB7Q","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b35db7bf0103fda6ebe649a8a59e748704658636400d3454ab48d94084d5395d","target":"graph","created_at":"2026-05-18T00:01:48Z","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":"The aim of this paper is to train an RBF neural network and select centers under concurrent faults. It is well known that fault tolerance is a very attractive property for neural networks. And center selection is an important procedure during the training process of an RBF neural network. In this paper, we devise two novel algorithms to address these two issues simultaneously. Both of them are based on the ADMM framework. In the first method, the minimax concave penalty (MCP) function is introduced to select centers. In the second method, an l0-norm term is directly used, and the hard threshol","authors_text":"Chi-Sing Leung, Hao Wang, Hing Cheung So, Ruibin Feng, Zifa Han","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T14:01:55Z","title":"l0-norm Based Centers Selection for Training Fault Tolerant RBF Networks and Selecting Centers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11987","kind":"arxiv","version":3},"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:5a503a05453db49369884cdc27c10a2d542a08ae4803b2bb4df6862ee4422187","target":"record","created_at":"2026-05-18T00:01:48Z","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":"dfdc401dc6b23dc1bdbd36c4be4d171e5ab57a64f8e842123bb965b88f9ff6f3","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T14:01:55Z","title_canon_sha256":"87bd95b45801416b1bb59b9d481351d7a3ad31804cd0741bdd312fc439eb60f6"},"schema_version":"1.0","source":{"id":"1805.11987","kind":"arxiv","version":3}},"canonical_sha256":"f1e89007f0decc358826b4283bc6500b4ad495648a36dc64dafc6d88f96f0f68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1e89007f0decc358826b4283bc6500b4ad495648a36dc64dafc6d88f96f0f68","first_computed_at":"2026-05-18T00:01:48.879760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:48.879760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kLB1u6GVoobumue693bIBL+FY2eabolzlkBkho7eE7zRTsDcJHvjG3KDkxxuwWfxExM7TTIFUy2fYEQvhlRnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:48.880257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11987","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a503a05453db49369884cdc27c10a2d542a08ae4803b2bb4df6862ee4422187","sha256:b35db7bf0103fda6ebe649a8a59e748704658636400d3454ab48d94084d5395d"],"state_sha256":"4ff00a56695a12b9cb0efce48f32f26000418ceb16c9b7c023294af72e50e410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ce6N3Z7ZZM0qLxSiRMvY7Ids0ech/1rZ7y4TFERQuWotYMZTkza+ZpIQfF2AkjRHzuvzDSTcexfJMCeCFM4TCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T16:55:52.721486Z","bundle_sha256":"f13c8776a761c5dbbac98b1aeb89700338a1d70b69d1492329dc8baab74facdf"}}