{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WNYNCNFQLC5JLLRXIT7W3OPELX","short_pith_number":"pith:WNYNCNFQ","canonical_record":{"source":{"id":"1907.08653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-19T19:16:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b42763188db00282d92f853a9fca37e62a900fd78f675eb858c20378bae03e3f","abstract_canon_sha256":"de6ce443733f7472438baa977e054ab12a303f4526a7db0ba8425397d3c63cdc"},"schema_version":"1.0"},"canonical_sha256":"b370d134b058ba95ae3744ff6db9e45ddded3868adae435022702d08bca40454","source":{"kind":"arxiv","id":"1907.08653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08653","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08653v1","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08653","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"WNYNCNFQLC5J","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WNYNCNFQLC5JLLRX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WNYNCNFQ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WNYNCNFQLC5JLLRXIT7W3OPELX","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-19T19:16:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b42763188db00282d92f853a9fca37e62a900fd78f675eb858c20378bae03e3f","abstract_canon_sha256":"de6ce443733f7472438baa977e054ab12a303f4526a7db0ba8425397d3c63cdc"},"schema_version":"1.0"},"canonical_sha256":"b370d134b058ba95ae3744ff6db9e45ddded3868adae435022702d08bca40454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:08.281237Z","signature_b64":"O06WruUYE3hLQSUliAun5XiA8KuvtZLBkBl2shucssNphdxvsCc0nsU3ruA0F4R3AQUEDkuCHy2sP8ecFPnqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b370d134b058ba95ae3744ff6db9e45ddded3868adae435022702d08bca40454","last_reissued_at":"2026-05-17T23:40:08.280450Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:08.280450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08653","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-17T23:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bg+x1TuD35WS4m3QVEggc7SgQDpq1LMjeUvK74S2LjK1K8HG0UIJGPFxjDdGaqUEMtLNsJ73GOveMIaTCcSfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:51:10.529835Z"},"content_sha256":"da346086b8d0f17e76ea99fcd8838f44d6f47c1f63c11823aa9d88a1a3ad267f","schema_version":"1.0","event_id":"sha256:da346086b8d0f17e76ea99fcd8838f44d6f47c1f63c11823aa9d88a1a3ad267f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WNYNCNFQLC5JLLRXIT7W3OPELX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surfing: Iterative optimization over incrementally trained deep networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ganlin Song, John Lafferty, Zhou Fan","submitted_at":"2019-07-19T19:16:04Z","abstract_excerpt":"We investigate a sequential optimization procedure to minimize the empirical risk functional $f_{\\hat\\theta}(x) = \\frac{1}{2}\\|G_{\\hat\\theta}(x) - y\\|^2$ for certain families of deep networks $G_{\\theta}(x)$. The approach is to optimize a sequence of objective functions that use network parameters obtained during different stages of the training process. When initialized with random parameters $\\theta_0$, we show that the objective $f_{\\theta_0}(x)$ is \"nice'' and easy to optimize with gradient descent. As learning is carried out, we obtain a sequence of generative networks $x \\mapsto G_{\\thet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08653","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-17T23:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pP83M7Tm0M3ky6+Aktwlw1tDKnQ1q08HeJlqBNjaeQELWHuAsrXITT7NN/XDW/ikhlKkjfz7hNGeNi4Vux13BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:51:10.530169Z"},"content_sha256":"410827ae24397d94d7e55a59fefd5599b7c1324d235d3665cd9eca41cf87dab4","schema_version":"1.0","event_id":"sha256:410827ae24397d94d7e55a59fefd5599b7c1324d235d3665cd9eca41cf87dab4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/bundle.json","state_url":"https://pith.science/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/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-03T02:51:10Z","links":{"resolver":"https://pith.science/pith/WNYNCNFQLC5JLLRXIT7W3OPELX","bundle":"https://pith.science/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/bundle.json","state":"https://pith.science/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNYNCNFQLC5JLLRXIT7W3OPELX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WNYNCNFQLC5JLLRXIT7W3OPELX","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":"de6ce443733f7472438baa977e054ab12a303f4526a7db0ba8425397d3c63cdc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-19T19:16:04Z","title_canon_sha256":"b42763188db00282d92f853a9fca37e62a900fd78f675eb858c20378bae03e3f"},"schema_version":"1.0","source":{"id":"1907.08653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08653","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08653v1","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08653","created_at":"2026-05-17T23:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"WNYNCNFQLC5J","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WNYNCNFQLC5JLLRX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WNYNCNFQ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:410827ae24397d94d7e55a59fefd5599b7c1324d235d3665cd9eca41cf87dab4","target":"graph","created_at":"2026-05-17T23:40:08Z","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":"We investigate a sequential optimization procedure to minimize the empirical risk functional $f_{\\hat\\theta}(x) = \\frac{1}{2}\\|G_{\\hat\\theta}(x) - y\\|^2$ for certain families of deep networks $G_{\\theta}(x)$. The approach is to optimize a sequence of objective functions that use network parameters obtained during different stages of the training process. When initialized with random parameters $\\theta_0$, we show that the objective $f_{\\theta_0}(x)$ is \"nice'' and easy to optimize with gradient descent. As learning is carried out, we obtain a sequence of generative networks $x \\mapsto G_{\\thet","authors_text":"Ganlin Song, John Lafferty, Zhou Fan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-19T19:16:04Z","title":"Surfing: Iterative optimization over incrementally trained deep networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08653","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:da346086b8d0f17e76ea99fcd8838f44d6f47c1f63c11823aa9d88a1a3ad267f","target":"record","created_at":"2026-05-17T23:40:08Z","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":"de6ce443733f7472438baa977e054ab12a303f4526a7db0ba8425397d3c63cdc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-19T19:16:04Z","title_canon_sha256":"b42763188db00282d92f853a9fca37e62a900fd78f675eb858c20378bae03e3f"},"schema_version":"1.0","source":{"id":"1907.08653","kind":"arxiv","version":1}},"canonical_sha256":"b370d134b058ba95ae3744ff6db9e45ddded3868adae435022702d08bca40454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b370d134b058ba95ae3744ff6db9e45ddded3868adae435022702d08bca40454","first_computed_at":"2026-05-17T23:40:08.280450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:08.280450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O06WruUYE3hLQSUliAun5XiA8KuvtZLBkBl2shucssNphdxvsCc0nsU3ruA0F4R3AQUEDkuCHy2sP8ecFPnqAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:08.281237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da346086b8d0f17e76ea99fcd8838f44d6f47c1f63c11823aa9d88a1a3ad267f","sha256:410827ae24397d94d7e55a59fefd5599b7c1324d235d3665cd9eca41cf87dab4"],"state_sha256":"72b73e94d34645688367166aca4f8d8d4976ee29af7749e88008819d8996369f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z3PtlaCRCiXxAbenJfiFmAlUImsXeshDY2ve9FBiqGQ6L99GXuQdPkntD0u3BeCk3OXzL9YPoePhEwgu8vYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:51:10.532096Z","bundle_sha256":"edb9b637322cdc163fd90c05fddacfb5a69bc283354e513b5c7b38ba985da622"}}