{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RT2MKFUNQELXKYJJBBAOBQMKO2","short_pith_number":"pith:RT2MKFUN","canonical_record":{"source":{"id":"2505.07311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-12T07:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"5e956ab87d359ed2f562e742f968bf1a3a31504cb9aa33bb18985fe467ed26a2","abstract_canon_sha256":"c996def22f14fe49e84a2055ed2c891d4afdf64f9538d261826e43a3f7eac0a1"},"schema_version":"1.0"},"canonical_sha256":"8cf4c5168d81177561290840e0c18a768a9590631a95e9c692c188a41f984838","source":{"kind":"arxiv","id":"2505.07311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07311","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07311v1","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07311","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"RT2MKFUNQELX","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"RT2MKFUNQELXKYJJ","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"RT2MKFUN","created_at":"2026-07-05T11:01:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RT2MKFUNQELXKYJJBBAOBQMKO2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.07311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-12T07:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"5e956ab87d359ed2f562e742f968bf1a3a31504cb9aa33bb18985fe467ed26a2","abstract_canon_sha256":"c996def22f14fe49e84a2055ed2c891d4afdf64f9538d261826e43a3f7eac0a1"},"schema_version":"1.0"},"canonical_sha256":"8cf4c5168d81177561290840e0c18a768a9590631a95e9c692c188a41f984838","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:45.960563Z","signature_b64":"Clf5lRYT1mhGYS5uy9Uy5x7P6WopPLYZ5Fe77kFtPlbwrcShZUjm+P3aD2FepOQzhgGO1wJJBVgX1f9NY7ZOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cf4c5168d81177561290840e0c18a768a9590631a95e9c692c188a41f984838","last_reissued_at":"2026-07-05T11:01:45.960078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:45.960078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.07311","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-05T11:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rimqMFFWtJAqceTA5OzhaJakOo3TwWmB+ERMWa7nIo3bBoVhqL55wueQvSNBMV/a8oxQjaikCSjaGhPovmWxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:17:58.640030Z"},"content_sha256":"e2d8cc438fc99d985c3bdd90b10eebf4ce4fb0219cd10951f5f2b950b1e6e787","schema_version":"1.0","event_id":"sha256:e2d8cc438fc99d985c3bdd90b10eebf4ce4fb0219cd10951f5f2b950b1e6e787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RT2MKFUNQELXKYJJBBAOBQMKO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Analysis of Projected Gradient Descent for Physics-Informed Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Johannes M\\\"uller, Jonas Nie{\\ss}en","submitted_at":"2025-05-12T07:55:56Z","abstract_excerpt":"In this work, we provide a non-asymptotic convergence analysis of projected gradient descent for physics-informed neural networks for the Poisson equation. Under suitable assumptions, we show that the optimization error can be bounded by $\\mathcal{O}(1/\\sqrt{T} + 1/\\sqrt{m} + \\epsilon_{\\text{approx}})$, where $T$ is the number of algorithm time steps, $m$ is the width of the neural network and $\\epsilon_{\\text{approx}}$ is an approximation error. The proof of our optimization result relies on bounding the linearization error and using this result together with a Lyapunov drift analysis. Additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07311","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/2505.07311/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-05T11:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/giVvXEOxLpCZHxLkl9HT8q8u7zG7SOZHbm1KP5Yah6WOaF+efiRF0XZ+LviKEIDYHC/2QcJOF3ugKIJ7hHOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:17:58.640548Z"},"content_sha256":"33a932f6c475b13c7521d4d092ded8b8fff790833739dc844d265ae863c934c6","schema_version":"1.0","event_id":"sha256:33a932f6c475b13c7521d4d092ded8b8fff790833739dc844d265ae863c934c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/bundle.json","state_url":"https://pith.science/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/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-18T00:17:58Z","links":{"resolver":"https://pith.science/pith/RT2MKFUNQELXKYJJBBAOBQMKO2","bundle":"https://pith.science/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/bundle.json","state":"https://pith.science/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RT2MKFUNQELXKYJJBBAOBQMKO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RT2MKFUNQELXKYJJBBAOBQMKO2","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":"c996def22f14fe49e84a2055ed2c891d4afdf64f9538d261826e43a3f7eac0a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-12T07:55:56Z","title_canon_sha256":"5e956ab87d359ed2f562e742f968bf1a3a31504cb9aa33bb18985fe467ed26a2"},"schema_version":"1.0","source":{"id":"2505.07311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07311","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07311v1","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07311","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"RT2MKFUNQELX","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"RT2MKFUNQELXKYJJ","created_at":"2026-07-05T11:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"RT2MKFUN","created_at":"2026-07-05T11:01:45Z"}],"graph_snapshots":[{"event_id":"sha256:33a932f6c475b13c7521d4d092ded8b8fff790833739dc844d265ae863c934c6","target":"graph","created_at":"2026-07-05T11:01:45Z","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/2505.07311/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we provide a non-asymptotic convergence analysis of projected gradient descent for physics-informed neural networks for the Poisson equation. Under suitable assumptions, we show that the optimization error can be bounded by $\\mathcal{O}(1/\\sqrt{T} + 1/\\sqrt{m} + \\epsilon_{\\text{approx}})$, where $T$ is the number of algorithm time steps, $m$ is the width of the neural network and $\\epsilon_{\\text{approx}}$ is an approximation error. The proof of our optimization result relies on bounding the linearization error and using this result together with a Lyapunov drift analysis. Additi","authors_text":"Johannes M\\\"uller, Jonas Nie{\\ss}en","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-12T07:55:56Z","title":"Non-Asymptotic Analysis of Projected Gradient Descent for Physics-Informed Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07311","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:e2d8cc438fc99d985c3bdd90b10eebf4ce4fb0219cd10951f5f2b950b1e6e787","target":"record","created_at":"2026-07-05T11:01:45Z","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":"c996def22f14fe49e84a2055ed2c891d4afdf64f9538d261826e43a3f7eac0a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-12T07:55:56Z","title_canon_sha256":"5e956ab87d359ed2f562e742f968bf1a3a31504cb9aa33bb18985fe467ed26a2"},"schema_version":"1.0","source":{"id":"2505.07311","kind":"arxiv","version":1}},"canonical_sha256":"8cf4c5168d81177561290840e0c18a768a9590631a95e9c692c188a41f984838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cf4c5168d81177561290840e0c18a768a9590631a95e9c692c188a41f984838","first_computed_at":"2026-07-05T11:01:45.960078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:45.960078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Clf5lRYT1mhGYS5uy9Uy5x7P6WopPLYZ5Fe77kFtPlbwrcShZUjm+P3aD2FepOQzhgGO1wJJBVgX1f9NY7ZOAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:45.960563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.07311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2d8cc438fc99d985c3bdd90b10eebf4ce4fb0219cd10951f5f2b950b1e6e787","sha256:33a932f6c475b13c7521d4d092ded8b8fff790833739dc844d265ae863c934c6"],"state_sha256":"2c8bcdaa5ba1855005e51ddfa638a58d9fc2a36fb838892b62dae561295ea4d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QL2252PfX41dGYY4PLgLtnxEAbsDQ2YjA9vXaH9oXwCOAftV3sjyd29rCJAcdDnp29DI8lmWAG4e83x2zI5MBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T00:17:58.645794Z","bundle_sha256":"aca0fd4a1c8c213dd0b2183bf3dfe63b37e6dab630d709c4e301f106008726bc"}}