{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U7UKS5UNON7ZXBDWQDMASGV6C7","short_pith_number":"pith:U7UKS5UN","canonical_record":{"source":{"id":"1704.01382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T12:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"2be888ccf3226cf7fc5ebbca5b8d7908e963b25b20b2d099fccceb260227855f","abstract_canon_sha256":"817db8afdeedbf380e31aebb2bda6aa12a89836cdd772eb6f5d26582fe8d7324"},"schema_version":"1.0"},"canonical_sha256":"a7e8a9768d737f9b847680d8091abe17e6989baeb6153390f0bed4fb22d6dcb2","source":{"kind":"arxiv","id":"1704.01382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01382","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01382v1","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01382","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"U7UKS5UNON7Z","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7UKS5UNON7ZXBDW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7UKS5UN","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U7UKS5UNON7ZXBDWQDMASGV6C7","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T12:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"2be888ccf3226cf7fc5ebbca5b8d7908e963b25b20b2d099fccceb260227855f","abstract_canon_sha256":"817db8afdeedbf380e31aebb2bda6aa12a89836cdd772eb6f5d26582fe8d7324"},"schema_version":"1.0"},"canonical_sha256":"a7e8a9768d737f9b847680d8091abe17e6989baeb6153390f0bed4fb22d6dcb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:58.320374Z","signature_b64":"0QqVcB0NUfIFvhpq8USM2cEllH7T8ZEbYS10Ktuf67lrVeJrJsRoGiEVXkyajfx+nvrcE+x8W7rYeBE8S7f1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e8a9768d737f9b847680d8091abe17e6989baeb6153390f0bed4fb22d6dcb2","last_reissued_at":"2026-05-18T00:46:58.319912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:58.319912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01382","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-18T00:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/G0Z/zyxhiuQpYf2NHnPuVAFDB3OoLJPpk4YZVnd4lopaoMXr0macy9kG9E/ZkPPpn9+eBzj+pWZlRgpitaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:58:01.508263Z"},"content_sha256":"c56072b804e2050db1e127b004572f84d7e9a9bee54275c30cf8bf11de6280bd","schema_version":"1.0","event_id":"sha256:c56072b804e2050db1e127b004572f84d7e9a9bee54275c30cf8bf11de6280bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U7UKS5UNON7ZXBDWQDMASGV6C7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the construction of probabilistic Newton-type algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Adrian G. Wills, Thomas B. Sch\\\"on","submitted_at":"2017-04-05T12:34:20Z","abstract_excerpt":"It has recently been shown that many of the existing quasi-Newton algorithms can be formulated as learning algorithms, capable of learning local models of the cost functions. Importantly, this understanding allows us to safely start assembling probabilistic Newton-type algorithms, applicable in situations where we only have access to noisy observations of the cost function and its derivatives. This is where our interest lies.\n  We make contributions to the use of the non-parametric and probabilistic Gaussian process models in solving these stochastic optimisation problems. Specifically, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01382","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-18T00:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsMwFhjSbwGwwKEYErpEizFfgQu9xxziZEfA6eqcx1QNuPhXO07zI9IUoBNWg+PvoZNuTyBjpBgpdtZjZEc+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:58:01.508947Z"},"content_sha256":"cac00b20d835a7a8ead518f8891956dbedb45fbf2b4db310d817f07ec25432ee","schema_version":"1.0","event_id":"sha256:cac00b20d835a7a8ead518f8891956dbedb45fbf2b4db310d817f07ec25432ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/bundle.json","state_url":"https://pith.science/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/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-11T02:58:01Z","links":{"resolver":"https://pith.science/pith/U7UKS5UNON7ZXBDWQDMASGV6C7","bundle":"https://pith.science/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/bundle.json","state":"https://pith.science/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7UKS5UNON7ZXBDWQDMASGV6C7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U7UKS5UNON7ZXBDWQDMASGV6C7","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":"817db8afdeedbf380e31aebb2bda6aa12a89836cdd772eb6f5d26582fe8d7324","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T12:34:20Z","title_canon_sha256":"2be888ccf3226cf7fc5ebbca5b8d7908e963b25b20b2d099fccceb260227855f"},"schema_version":"1.0","source":{"id":"1704.01382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01382","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01382v1","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01382","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"U7UKS5UNON7Z","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7UKS5UNON7ZXBDW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7UKS5UN","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:cac00b20d835a7a8ead518f8891956dbedb45fbf2b4db310d817f07ec25432ee","target":"graph","created_at":"2026-05-18T00:46:58Z","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":"It has recently been shown that many of the existing quasi-Newton algorithms can be formulated as learning algorithms, capable of learning local models of the cost functions. Importantly, this understanding allows us to safely start assembling probabilistic Newton-type algorithms, applicable in situations where we only have access to noisy observations of the cost function and its derivatives. This is where our interest lies.\n  We make contributions to the use of the non-parametric and probabilistic Gaussian process models in solving these stochastic optimisation problems. Specifically, we pre","authors_text":"Adrian G. Wills, Thomas B. Sch\\\"on","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T12:34:20Z","title":"On the construction of probabilistic Newton-type algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01382","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:c56072b804e2050db1e127b004572f84d7e9a9bee54275c30cf8bf11de6280bd","target":"record","created_at":"2026-05-18T00:46:58Z","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":"817db8afdeedbf380e31aebb2bda6aa12a89836cdd772eb6f5d26582fe8d7324","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T12:34:20Z","title_canon_sha256":"2be888ccf3226cf7fc5ebbca5b8d7908e963b25b20b2d099fccceb260227855f"},"schema_version":"1.0","source":{"id":"1704.01382","kind":"arxiv","version":1}},"canonical_sha256":"a7e8a9768d737f9b847680d8091abe17e6989baeb6153390f0bed4fb22d6dcb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e8a9768d737f9b847680d8091abe17e6989baeb6153390f0bed4fb22d6dcb2","first_computed_at":"2026-05-18T00:46:58.319912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:58.319912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QqVcB0NUfIFvhpq8USM2cEllH7T8ZEbYS10Ktuf67lrVeJrJsRoGiEVXkyajfx+nvrcE+x8W7rYeBE8S7f1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:58.320374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c56072b804e2050db1e127b004572f84d7e9a9bee54275c30cf8bf11de6280bd","sha256:cac00b20d835a7a8ead518f8891956dbedb45fbf2b4db310d817f07ec25432ee"],"state_sha256":"9dc93f7b774609014b5e6d377594a77d3eadd865f4a040231a23a02de98b20c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Ebhx26mVyK7i2Wyy9k7GubcxkUm69HFOeUHWvZ+6BLqek39XnLAtEMu0uGAfjPw9oQterK8qnTyt0x+MujZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:58:01.512591Z","bundle_sha256":"0115f61eccfde8d5aebb3b865c8a61315d4a4e6a1e5d66d27163f4e38558d3a3"}}