{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3BKOQWFMYQS6VMWSZFQEPHAZMC","short_pith_number":"pith:3BKOQWFM","canonical_record":{"source":{"id":"1811.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-13T21:47:27Z","cross_cats_sorted":["cs.LG","cs.NE","math.DS","stat.ML"],"title_canon_sha256":"59e73c2f5a0e71e8d2c24f42c543c204a075af8112bfe914b19010dec54558c0","abstract_canon_sha256":"d947e1e7d1048ec3c972470a26ee81eb91e60af221381e2eaec5945a1b86f217"},"schema_version":"1.0"},"canonical_sha256":"d854e858acc425eab2d2c960479c196085ea718b9907240373c48675e00d681d","source":{"kind":"arxiv","id":"1811.05537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05537","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05537v1","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05537","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BKOQWFMYQS6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3BKOQWFMYQS6VMWS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3BKOQWFM","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3BKOQWFMYQS6VMWSZFQEPHAZMC","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-13T21:47:27Z","cross_cats_sorted":["cs.LG","cs.NE","math.DS","stat.ML"],"title_canon_sha256":"59e73c2f5a0e71e8d2c24f42c543c204a075af8112bfe914b19010dec54558c0","abstract_canon_sha256":"d947e1e7d1048ec3c972470a26ee81eb91e60af221381e2eaec5945a1b86f217"},"schema_version":"1.0"},"canonical_sha256":"d854e858acc425eab2d2c960479c196085ea718b9907240373c48675e00d681d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:57.882286Z","signature_b64":"g5r7vLppbXCSeELPT/JkbqyfSQgaBWrKrcwPTWkJmBPyDIDTOB13tZi8K3gV04k5CfISU0x3dVpxHF0pzOh0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d854e858acc425eab2d2c960479c196085ea718b9907240373c48675e00d681d","last_reissued_at":"2026-05-17T23:39:57.881789Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:57.881789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05537","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdsEj95Dc8ml6Zn0/BI8bttZsDEWA6apV7gRQ9YdUEabtV68jQs8dsdwPOb9Ld/UKwvfVkwL4vr/613w/l6SCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:57.985817Z"},"content_sha256":"798db6ebb63acef40c28f3ead882ee0d2ad0962d86cf6917b7d2b9e8253f1b35","schema_version":"1.0","event_id":"sha256:798db6ebb63acef40c28f3ead882ee0d2ad0962d86cf6917b7d2b9e8253f1b35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3BKOQWFMYQS6VMWSZFQEPHAZMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Driven Governing Equations Approximation Using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","math.DS","stat.ML"],"primary_cat":"math.NA","authors_text":"Dongbin Xiu, Kailiang Wu, Tong Qin","submitted_at":"2018-11-13T21:47:27Z","abstract_excerpt":"We present a numerical framework for approximating unknown governing equations using observation data and deep neural networks (DNN). In particular, we propose to use residual network (ResNet) as the basic building block for equation approximation. We demonstrate that the ResNet block can be considered as a one-step method that is exact in temporal integration. We then present two multi-step methods, recurrent ResNet (RT-ResNet) method and recursive ReNet (RS-ResNet) method. The RT-ResNet is a multi-step method on uniform time steps, whereas the RS-ResNet is an adaptive multi-step method using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05537","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2QGRGp54veCCFPpXZS1mp5XJU+vCI/S6otJPTKmIwNrXPqlzUPEY8SZRfsaqv3ypN55U29UBKflQ6k4wACsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:57.986175Z"},"content_sha256":"64906eec9b1b96898b9c69647ed765548020e3b2685fb9e1dfca932ca3990f5a","schema_version":"1.0","event_id":"sha256:64906eec9b1b96898b9c69647ed765548020e3b2685fb9e1dfca932ca3990f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/bundle.json","state_url":"https://pith.science/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/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-02T01:27:57Z","links":{"resolver":"https://pith.science/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC","bundle":"https://pith.science/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/bundle.json","state":"https://pith.science/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BKOQWFMYQS6VMWSZFQEPHAZMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3BKOQWFMYQS6VMWSZFQEPHAZMC","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":"d947e1e7d1048ec3c972470a26ee81eb91e60af221381e2eaec5945a1b86f217","cross_cats_sorted":["cs.LG","cs.NE","math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-13T21:47:27Z","title_canon_sha256":"59e73c2f5a0e71e8d2c24f42c543c204a075af8112bfe914b19010dec54558c0"},"schema_version":"1.0","source":{"id":"1811.05537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05537","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05537v1","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05537","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BKOQWFMYQS6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3BKOQWFMYQS6VMWS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3BKOQWFM","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:64906eec9b1b96898b9c69647ed765548020e3b2685fb9e1dfca932ca3990f5a","target":"graph","created_at":"2026-05-17T23:39:57Z","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 present a numerical framework for approximating unknown governing equations using observation data and deep neural networks (DNN). In particular, we propose to use residual network (ResNet) as the basic building block for equation approximation. We demonstrate that the ResNet block can be considered as a one-step method that is exact in temporal integration. We then present two multi-step methods, recurrent ResNet (RT-ResNet) method and recursive ReNet (RS-ResNet) method. The RT-ResNet is a multi-step method on uniform time steps, whereas the RS-ResNet is an adaptive multi-step method using","authors_text":"Dongbin Xiu, Kailiang Wu, Tong Qin","cross_cats":["cs.LG","cs.NE","math.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-13T21:47:27Z","title":"Data Driven Governing Equations Approximation Using Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05537","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:798db6ebb63acef40c28f3ead882ee0d2ad0962d86cf6917b7d2b9e8253f1b35","target":"record","created_at":"2026-05-17T23:39:57Z","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":"d947e1e7d1048ec3c972470a26ee81eb91e60af221381e2eaec5945a1b86f217","cross_cats_sorted":["cs.LG","cs.NE","math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-13T21:47:27Z","title_canon_sha256":"59e73c2f5a0e71e8d2c24f42c543c204a075af8112bfe914b19010dec54558c0"},"schema_version":"1.0","source":{"id":"1811.05537","kind":"arxiv","version":1}},"canonical_sha256":"d854e858acc425eab2d2c960479c196085ea718b9907240373c48675e00d681d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d854e858acc425eab2d2c960479c196085ea718b9907240373c48675e00d681d","first_computed_at":"2026-05-17T23:39:57.881789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:57.881789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g5r7vLppbXCSeELPT/JkbqyfSQgaBWrKrcwPTWkJmBPyDIDTOB13tZi8K3gV04k5CfISU0x3dVpxHF0pzOh0Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:57.882286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:798db6ebb63acef40c28f3ead882ee0d2ad0962d86cf6917b7d2b9e8253f1b35","sha256:64906eec9b1b96898b9c69647ed765548020e3b2685fb9e1dfca932ca3990f5a"],"state_sha256":"e48b95c5aa2f4b75837e457219f207f22239cb45d5734ccc74ca4d327e94e39b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDGYJrnes8mLllWdoTLQeCdYaPebLBrB2VYgJuqLEc5pSf7xyzYbmxSfjn3stEMZjFUbkh6cF7noEBdgxu4IBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:27:57.988295Z","bundle_sha256":"180d484974a9d6fa8750b49190241a4ff53c442ca8799af916e6d7e9cc0bafec"}}