{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XXMSGB57372F63IGVGGUKDDRZ3","short_pith_number":"pith:XXMSGB57","canonical_record":{"source":{"id":"2410.02017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T20:34:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"595c02ed4c3a857940698ad54f5d32b6b2f727ef7115d70e0b9ce59c156a9daf","abstract_canon_sha256":"9acf61ccd2347fdda227e6862655bba7e5efa9806eb251f5cc6fabf5843f608a"},"schema_version":"1.0"},"canonical_sha256":"bdd92307bfdff45f6d06a98d450c71cec54b10557109539944321c79ca63af8f","source":{"kind":"arxiv","id":"2410.02017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02017","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02017v1","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02017","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"XXMSGB57372F","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_16","alias_value":"XXMSGB57372F63IG","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_8","alias_value":"XXMSGB57","created_at":"2026-07-05T09:14:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XXMSGB57372F63IGVGGUKDDRZ3","target":"record","payload":{"canonical_record":{"source":{"id":"2410.02017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T20:34:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"595c02ed4c3a857940698ad54f5d32b6b2f727ef7115d70e0b9ce59c156a9daf","abstract_canon_sha256":"9acf61ccd2347fdda227e6862655bba7e5efa9806eb251f5cc6fabf5843f608a"},"schema_version":"1.0"},"canonical_sha256":"bdd92307bfdff45f6d06a98d450c71cec54b10557109539944321c79ca63af8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:59.242458Z","signature_b64":"UYSXIS6eR+lVN73TLg1M/bsVLgaGy4y7Be7y9tIcz94XWF7WwYkfswzgQGEIR2Uem8JwQ59gLx6rh+lzxKRPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd92307bfdff45f6d06a98d450c71cec54b10557109539944321c79ca63af8f","last_reissued_at":"2026-07-05T09:14:59.242037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:59.242037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.02017","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-07-05T09:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFJ+xX8ebKSCpSFrn2iLGQiR4KlkXB1i2ae0lqudAW/r4G9kmzMx7GZB5VAq+jJTfgUSZ5jvuu+7Dd8Eez6HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:23:08.609069Z"},"content_sha256":"58953342498d98767c6fbab783e63e033e557f35886b28b258f202670648f9bd","schema_version":"1.0","event_id":"sha256:58953342498d98767c6fbab783e63e033e557f35886b28b258f202670648f9bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XXMSGB57372F63IGVGGUKDDRZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Review Non-convex Optimization Method for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Greg B Fotopoulos, Nicholas Hall Papadopoulos, Paul Popovich","submitted_at":"2024-10-02T20:34:33Z","abstract_excerpt":"Non-convex optimization is a critical tool in advancing machine learning, especially for complex models like deep neural networks and support vector machines. Despite challenges such as multiple local minima and saddle points, non-convex techniques offer various pathways to reduce computational costs. These include promoting sparsity through regularization, efficiently escaping saddle points, and employing subsampling and approximation strategies like stochastic gradient descent. Additionally, non-convex methods enable model pruning and compression, which reduce the size of models while mainta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02017","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/2410.02017/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-07-05T09:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGUOy2iOMq4GqmaB/HAY070y1NSSK7yHIRcxECBBHBaw/n/bdqpVC7CcccNuYpqfer0e0gRvJEjnhhyfogNcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:23:08.609591Z"},"content_sha256":"ff172074717a90e9c967c4b4864b45e7062662541943d3f40f6d264f680cedcb","schema_version":"1.0","event_id":"sha256:ff172074717a90e9c967c4b4864b45e7062662541943d3f40f6d264f680cedcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXMSGB57372F63IGVGGUKDDRZ3/bundle.json","state_url":"https://pith.science/pith/XXMSGB57372F63IGVGGUKDDRZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXMSGB57372F63IGVGGUKDDRZ3/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-08-06T07:23:08Z","links":{"resolver":"https://pith.science/pith/XXMSGB57372F63IGVGGUKDDRZ3","bundle":"https://pith.science/pith/XXMSGB57372F63IGVGGUKDDRZ3/bundle.json","state":"https://pith.science/pith/XXMSGB57372F63IGVGGUKDDRZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXMSGB57372F63IGVGGUKDDRZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XXMSGB57372F63IGVGGUKDDRZ3","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":"9acf61ccd2347fdda227e6862655bba7e5efa9806eb251f5cc6fabf5843f608a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T20:34:33Z","title_canon_sha256":"595c02ed4c3a857940698ad54f5d32b6b2f727ef7115d70e0b9ce59c156a9daf"},"schema_version":"1.0","source":{"id":"2410.02017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02017","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02017v1","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02017","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"XXMSGB57372F","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_16","alias_value":"XXMSGB57372F63IG","created_at":"2026-07-05T09:14:59Z"},{"alias_kind":"pith_short_8","alias_value":"XXMSGB57","created_at":"2026-07-05T09:14:59Z"}],"graph_snapshots":[{"event_id":"sha256:ff172074717a90e9c967c4b4864b45e7062662541943d3f40f6d264f680cedcb","target":"graph","created_at":"2026-07-05T09:14:59Z","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/2410.02017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Non-convex optimization is a critical tool in advancing machine learning, especially for complex models like deep neural networks and support vector machines. Despite challenges such as multiple local minima and saddle points, non-convex techniques offer various pathways to reduce computational costs. These include promoting sparsity through regularization, efficiently escaping saddle points, and employing subsampling and approximation strategies like stochastic gradient descent. Additionally, non-convex methods enable model pruning and compression, which reduce the size of models while mainta","authors_text":"Greg B Fotopoulos, Nicholas Hall Papadopoulos, Paul Popovich","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T20:34:33Z","title":"Review Non-convex Optimization Method for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02017","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:58953342498d98767c6fbab783e63e033e557f35886b28b258f202670648f9bd","target":"record","created_at":"2026-07-05T09:14:59Z","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":"9acf61ccd2347fdda227e6862655bba7e5efa9806eb251f5cc6fabf5843f608a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T20:34:33Z","title_canon_sha256":"595c02ed4c3a857940698ad54f5d32b6b2f727ef7115d70e0b9ce59c156a9daf"},"schema_version":"1.0","source":{"id":"2410.02017","kind":"arxiv","version":1}},"canonical_sha256":"bdd92307bfdff45f6d06a98d450c71cec54b10557109539944321c79ca63af8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdd92307bfdff45f6d06a98d450c71cec54b10557109539944321c79ca63af8f","first_computed_at":"2026-07-05T09:14:59.242037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:14:59.242037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UYSXIS6eR+lVN73TLg1M/bsVLgaGy4y7Be7y9tIcz94XWF7WwYkfswzgQGEIR2Uem8JwQ59gLx6rh+lzxKRPDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:14:59.242458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.02017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58953342498d98767c6fbab783e63e033e557f35886b28b258f202670648f9bd","sha256:ff172074717a90e9c967c4b4864b45e7062662541943d3f40f6d264f680cedcb"],"state_sha256":"f03376547b7f025a4f27fd08fb30cd1ff4e181b88dcc7aeada15e5a06e90cb24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMay2z4FZfCbmdC3nGdmziILLzqyFJhcqc/IBv8BbVKyTcHJoxQ80uNd9t6udde8GorZgXrEYNsGwrS7ar8ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:23:08.614739Z","bundle_sha256":"38c8d248f88ec24db8f529e0b853c5e6c759f7ba277ca6c96107b2fb749cafc9"}}