{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YHOUQB2HOUB5DLCI74RO2E4KR4","short_pith_number":"pith:YHOUQB2H","canonical_record":{"source":{"id":"2004.06479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-12T03:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"65f4b08b25090ac5829c83d5d50ad33c8e53773067623c5fc09de5328d0c408e","abstract_canon_sha256":"32ee8d16861b93d20572d456b364509ceae25914c8a9ebbbf7f6447f753fcd34"},"schema_version":"1.0"},"canonical_sha256":"c1dd4807477503d1ac48ff22ed138a8f39b10d62ffd88c60dd78658ee9fd339b","source":{"kind":"arxiv","id":"2004.06479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.06479","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"2004.06479v2","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06479","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"YHOUQB2HOUB5","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_16","alias_value":"YHOUQB2HOUB5DLCI","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_8","alias_value":"YHOUQB2H","created_at":"2026-07-05T02:18:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YHOUQB2HOUB5DLCI74RO2E4KR4","target":"record","payload":{"canonical_record":{"source":{"id":"2004.06479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-12T03:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"65f4b08b25090ac5829c83d5d50ad33c8e53773067623c5fc09de5328d0c408e","abstract_canon_sha256":"32ee8d16861b93d20572d456b364509ceae25914c8a9ebbbf7f6447f753fcd34"},"schema_version":"1.0"},"canonical_sha256":"c1dd4807477503d1ac48ff22ed138a8f39b10d62ffd88c60dd78658ee9fd339b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:15.538414Z","signature_b64":"adScgm1bmbLCHbbk86zCcpQnsINRcwO7EnPNgjFggblcn5dr5/QBRncZcWDj62VgW+WDM31EjJGhrbbq0eAvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1dd4807477503d1ac48ff22ed138a8f39b10d62ffd88c60dd78658ee9fd339b","last_reissued_at":"2026-07-05T02:18:15.537832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:15.537832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.06479","source_version":2,"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-05T02:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kM7ebUrUchAqz4KeRuH0QkNS2qGTLUW3xMMiaL+0bqgI54mjmZ/pglhkvi0imYHF7aw/Ru1KQdXq5VrtROh7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:10:17.998323Z"},"content_sha256":"cd873f66187121e78e0577bcb9d44e43e310956823fb52264e1a4bb7fbee2a4f","schema_version":"1.0","event_id":"sha256:cd873f66187121e78e0577bcb9d44e43e310956823fb52264e1a4bb7fbee2a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YHOUQB2HOUB5DLCI74RO2E4KR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Stochastic Quasi-Newton Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cheng Deng, Feihu Huang, Heng Huang, Qingsong Zhang","submitted_at":"2020-04-12T03:46:56Z","abstract_excerpt":"Stochastic optimization methods have become a class of popular optimization tools in machine learning. Especially, stochastic gradient descent (SGD) has been widely used for machine learning problems such as training neural networks due to low per-iteration computational complexity. In fact, the Newton or quasi-newton methods leveraging second-order information are able to achieve a better solution than the first-order methods. Thus, stochastic quasi-Newton (SQN) methods have been developed to achieve the better solution efficiently than the stochastic first-order methods by utilizing approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06479","kind":"arxiv","version":2},"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/2004.06479/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-05T02:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPq4GlLQkcZv/HsdarA2c8rnJ1QfdLTInCEY2zg7xL6vTQpAM3B1omvpq3Pq2d5DOlK+i9GaVyoJ5GVHXI4CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:10:17.998968Z"},"content_sha256":"be4e48b5faab1c5dcff4d36160a7d785f88621bc9f8e1bbb6054b07ba6ded698","schema_version":"1.0","event_id":"sha256:be4e48b5faab1c5dcff4d36160a7d785f88621bc9f8e1bbb6054b07ba6ded698"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/bundle.json","state_url":"https://pith.science/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/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-04T09:10:18Z","links":{"resolver":"https://pith.science/pith/YHOUQB2HOUB5DLCI74RO2E4KR4","bundle":"https://pith.science/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/bundle.json","state":"https://pith.science/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHOUQB2HOUB5DLCI74RO2E4KR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YHOUQB2HOUB5DLCI74RO2E4KR4","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":"32ee8d16861b93d20572d456b364509ceae25914c8a9ebbbf7f6447f753fcd34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-12T03:46:56Z","title_canon_sha256":"65f4b08b25090ac5829c83d5d50ad33c8e53773067623c5fc09de5328d0c408e"},"schema_version":"1.0","source":{"id":"2004.06479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.06479","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"2004.06479v2","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06479","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"YHOUQB2HOUB5","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_16","alias_value":"YHOUQB2HOUB5DLCI","created_at":"2026-07-05T02:18:15Z"},{"alias_kind":"pith_short_8","alias_value":"YHOUQB2H","created_at":"2026-07-05T02:18:15Z"}],"graph_snapshots":[{"event_id":"sha256:be4e48b5faab1c5dcff4d36160a7d785f88621bc9f8e1bbb6054b07ba6ded698","target":"graph","created_at":"2026-07-05T02:18:15Z","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/2004.06479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic optimization methods have become a class of popular optimization tools in machine learning. Especially, stochastic gradient descent (SGD) has been widely used for machine learning problems such as training neural networks due to low per-iteration computational complexity. In fact, the Newton or quasi-newton methods leveraging second-order information are able to achieve a better solution than the first-order methods. Thus, stochastic quasi-Newton (SQN) methods have been developed to achieve the better solution efficiently than the stochastic first-order methods by utilizing approxim","authors_text":"Cheng Deng, Feihu Huang, Heng Huang, Qingsong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-12T03:46:56Z","title":"Faster Stochastic Quasi-Newton Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06479","kind":"arxiv","version":2},"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:cd873f66187121e78e0577bcb9d44e43e310956823fb52264e1a4bb7fbee2a4f","target":"record","created_at":"2026-07-05T02:18:15Z","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":"32ee8d16861b93d20572d456b364509ceae25914c8a9ebbbf7f6447f753fcd34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-12T03:46:56Z","title_canon_sha256":"65f4b08b25090ac5829c83d5d50ad33c8e53773067623c5fc09de5328d0c408e"},"schema_version":"1.0","source":{"id":"2004.06479","kind":"arxiv","version":2}},"canonical_sha256":"c1dd4807477503d1ac48ff22ed138a8f39b10d62ffd88c60dd78658ee9fd339b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1dd4807477503d1ac48ff22ed138a8f39b10d62ffd88c60dd78658ee9fd339b","first_computed_at":"2026-07-05T02:18:15.537832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:15.537832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"adScgm1bmbLCHbbk86zCcpQnsINRcwO7EnPNgjFggblcn5dr5/QBRncZcWDj62VgW+WDM31EjJGhrbbq0eAvDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:15.538414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.06479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd873f66187121e78e0577bcb9d44e43e310956823fb52264e1a4bb7fbee2a4f","sha256:be4e48b5faab1c5dcff4d36160a7d785f88621bc9f8e1bbb6054b07ba6ded698"],"state_sha256":"1ae757b4cc0b65982f6f6dff7212bb4036aa72e50d1df404da4ce969c8642481"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPwB3cjJ9q+8gpdh+dkYYE7OrmFEnMqmymYESkzniX9tjv3bYNYh6ZDq7DKRkpw89a4Zw2yMue9Ffvg+js3uDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:10:18.003391Z","bundle_sha256":"954800eafdc181dfb3e6563de00ae662bf5e2f8944bb90992b2b4625368eece5"}}