{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GTZNLOQYSV5IKWF4N2ZL4LICRD","short_pith_number":"pith:GTZNLOQY","canonical_record":{"source":{"id":"1310.1518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-05T20:49:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"74af4e2cc54b3a6dd2b48314d540b2e05e02db4b9971660855cf4c9dbae29312","abstract_canon_sha256":"72a4f894cbec6089c8fba496ff2360c16625884665b81a04fd5694299ed9060d"},"schema_version":"1.0"},"canonical_sha256":"34f2d5ba18957a8558bc6eb2be2d0288fd4475e73d1d1460a9b6d738094d56df","source":{"kind":"arxiv","id":"1310.1518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1518","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1518v1","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1518","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"GTZNLOQYSV5I","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GTZNLOQYSV5IKWF4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GTZNLOQY","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GTZNLOQYSV5IKWF4N2ZL4LICRD","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-05T20:49:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"74af4e2cc54b3a6dd2b48314d540b2e05e02db4b9971660855cf4c9dbae29312","abstract_canon_sha256":"72a4f894cbec6089c8fba496ff2360c16625884665b81a04fd5694299ed9060d"},"schema_version":"1.0"},"canonical_sha256":"34f2d5ba18957a8558bc6eb2be2d0288fd4475e73d1d1460a9b6d738094d56df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:00.029281Z","signature_b64":"L2BSL0yoVvJ1Iw/NewmiN7ylj2KJTvyTl6LLE2en3h4LOlr1zr7XE51LYAcFNou7EAu3oRo7QzWETcxUQ6oIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34f2d5ba18957a8558bc6eb2be2d0288fd4475e73d1d1460a9b6d738094d56df","last_reissued_at":"2026-05-18T03:11:00.028574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:00.028574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1518","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"566iuSTRS2RyeciVfRTNBR2i0uaijNGKxECRCdaWSEkleZsLMToUojL7k0NQwkdZXFYijO5PS3nplijogPpqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:29:11.634680Z"},"content_sha256":"779a9813326317320d5cc81806b37cadb916badc43917200ca242c7587681e21","schema_version":"1.0","event_id":"sha256:779a9813326317320d5cc81806b37cadb916badc43917200ca242c7587681e21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GTZNLOQYSV5IKWF4N2ZL4LICRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contraction Principle based Robust Iterative Algorithms for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amit Kumar Mishra, Rangeet Mitra","submitted_at":"2013-10-05T20:49:37Z","abstract_excerpt":"Iterative algorithms are ubiquitous in the field of data mining. Widely known examples of such algorithms are the least mean square algorithm, backpropagation algorithm of neural networks. Our contribution in this paper is an improvement upon this iterative algorithms in terms of their respective performance metrics and robustness. This improvement is achieved by a new scaling factor which is multiplied to the error term. Our analysis shows that in essence, we are minimizing the corresponding LASSO cost function, which is the reason of its increased robustness. We also give closed form express"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1518","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDUN7WBlsTUhJV3sJWQ5UKByQTHULqBbFx5oyVO2uCQFXOyNxGDT1ciokyMBFBTmz3VDyqeTwM9/wJSWKE9UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:29:11.635221Z"},"content_sha256":"fe8dfe98baed3d4f6e293f298368893dbf906a46a95a3417f49704fc378a2996","schema_version":"1.0","event_id":"sha256:fe8dfe98baed3d4f6e293f298368893dbf906a46a95a3417f49704fc378a2996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/bundle.json","state_url":"https://pith.science/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/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-01T11:29:11Z","links":{"resolver":"https://pith.science/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD","bundle":"https://pith.science/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/bundle.json","state":"https://pith.science/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTZNLOQYSV5IKWF4N2ZL4LICRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GTZNLOQYSV5IKWF4N2ZL4LICRD","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":"72a4f894cbec6089c8fba496ff2360c16625884665b81a04fd5694299ed9060d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-05T20:49:37Z","title_canon_sha256":"74af4e2cc54b3a6dd2b48314d540b2e05e02db4b9971660855cf4c9dbae29312"},"schema_version":"1.0","source":{"id":"1310.1518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1518","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1518v1","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1518","created_at":"2026-05-18T03:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"GTZNLOQYSV5I","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GTZNLOQYSV5IKWF4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GTZNLOQY","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:fe8dfe98baed3d4f6e293f298368893dbf906a46a95a3417f49704fc378a2996","target":"graph","created_at":"2026-05-18T03:11: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Iterative algorithms are ubiquitous in the field of data mining. Widely known examples of such algorithms are the least mean square algorithm, backpropagation algorithm of neural networks. Our contribution in this paper is an improvement upon this iterative algorithms in terms of their respective performance metrics and robustness. This improvement is achieved by a new scaling factor which is multiplied to the error term. Our analysis shows that in essence, we are minimizing the corresponding LASSO cost function, which is the reason of its increased robustness. We also give closed form express","authors_text":"Amit Kumar Mishra, Rangeet Mitra","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-05T20:49:37Z","title":"Contraction Principle based Robust Iterative Algorithms for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1518","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:779a9813326317320d5cc81806b37cadb916badc43917200ca242c7587681e21","target":"record","created_at":"2026-05-18T03:11: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":"72a4f894cbec6089c8fba496ff2360c16625884665b81a04fd5694299ed9060d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-05T20:49:37Z","title_canon_sha256":"74af4e2cc54b3a6dd2b48314d540b2e05e02db4b9971660855cf4c9dbae29312"},"schema_version":"1.0","source":{"id":"1310.1518","kind":"arxiv","version":1}},"canonical_sha256":"34f2d5ba18957a8558bc6eb2be2d0288fd4475e73d1d1460a9b6d738094d56df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34f2d5ba18957a8558bc6eb2be2d0288fd4475e73d1d1460a9b6d738094d56df","first_computed_at":"2026-05-18T03:11:00.028574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:00.028574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2BSL0yoVvJ1Iw/NewmiN7ylj2KJTvyTl6LLE2en3h4LOlr1zr7XE51LYAcFNou7EAu3oRo7QzWETcxUQ6oIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:00.029281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:779a9813326317320d5cc81806b37cadb916badc43917200ca242c7587681e21","sha256:fe8dfe98baed3d4f6e293f298368893dbf906a46a95a3417f49704fc378a2996"],"state_sha256":"975b3bf191ef1ca54c317fbc2ae479a087895c963006064cf0982ad76de6ac1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQPX0oVTDuaznOGTD99X3btBrDCaQCykkHKyudvJ0V4yiZQFVevyvPc6kMicJSuNwlXt2bujMNMxi4618IWMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:29:11.638006Z","bundle_sha256":"021994d8b252a74ba1d2d0650e59e32cdf450c99d8f71020459f75ba32fec1c1"}}