{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6CP6QKYWJWQWZGVT3COS6PSTVW","short_pith_number":"pith:6CP6QKYW","schema_version":"1.0","canonical_sha256":"f09fe82b164da16c9ab3d89d2f3e53ad959d52dd97f95c8255a5089335fec86f","source":{"kind":"arxiv","id":"2508.19412","version":1},"attestation_state":"computed","paper":{"title":"A deep first-order system least squares method for the obstacle problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eugenia Bel\\'en, Francisco M. Bersetche, Gabriel Acosta, Juan Pablo Borthagaray","submitted_at":"2025-08-26T20:28:59Z","abstract_excerpt":"We propose a deep learning approach to the obstacle problem inspired by the first-order system least-squares (FOSLS) framework. This method reformulates the problem as a convex minimization task; by simultaneously approximating the solution, gradient, and Lagrange multiplier, our approach provides a flexible, mesh-free alternative that scales efficiently to high-dimensional settings. Key theoretical contributions include the coercivity and local Lipschitz continuity of the proposed least-squares functional, along with convergence guarantees via $\\Gamma$-convergence theory under mild regularity"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.19412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-08-26T20:28:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"52357b2eb5a78feb202c8af579c22a8be269a76ab7cc385371801d6d39967f91","abstract_canon_sha256":"420bef2845aa70a15c37326a7ff85775607459d6ff2004e8c24e6d2d195d8d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:11.048644Z","signature_b64":"3BPGU1A8Ps2xEdWTLxWm469dswTjfQXVZ3vWx36TvxdBMapvlscl5pfrgeVWwbkrYoz0J5QF6n1BSWF1KOf/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09fe82b164da16c9ab3d89d2f3e53ad959d52dd97f95c8255a5089335fec86f","last_reissued_at":"2026-07-05T12:00:11.047985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:11.047985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A deep first-order system least squares method for the obstacle problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eugenia Bel\\'en, Francisco M. Bersetche, Gabriel Acosta, Juan Pablo Borthagaray","submitted_at":"2025-08-26T20:28:59Z","abstract_excerpt":"We propose a deep learning approach to the obstacle problem inspired by the first-order system least-squares (FOSLS) framework. This method reformulates the problem as a convex minimization task; by simultaneously approximating the solution, gradient, and Lagrange multiplier, our approach provides a flexible, mesh-free alternative that scales efficiently to high-dimensional settings. Key theoretical contributions include the coercivity and local Lipschitz continuity of the proposed least-squares functional, along with convergence guarantees via $\\Gamma$-convergence theory under mild regularity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19412","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/2508.19412/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.19412","created_at":"2026-07-05T12:00:11.048064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19412v1","created_at":"2026-07-05T12:00:11.048064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19412","created_at":"2026-07-05T12:00:11.048064+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CP6QKYWJWQW","created_at":"2026-07-05T12:00:11.048064+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CP6QKYWJWQWZGVT","created_at":"2026-07-05T12:00:11.048064+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CP6QKYW","created_at":"2026-07-05T12:00:11.048064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW","json":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW.json","graph_json":"https://pith.science/api/pith-number/6CP6QKYWJWQWZGVT3COS6PSTVW/graph.json","events_json":"https://pith.science/api/pith-number/6CP6QKYWJWQWZGVT3COS6PSTVW/events.json","paper":"https://pith.science/paper/6CP6QKYW"},"agent_actions":{"view_html":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW","download_json":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW.json","view_paper":"https://pith.science/paper/6CP6QKYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19412&json=true","fetch_graph":"https://pith.science/api/pith-number/6CP6QKYWJWQWZGVT3COS6PSTVW/graph.json","fetch_events":"https://pith.science/api/pith-number/6CP6QKYWJWQWZGVT3COS6PSTVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW/action/storage_attestation","attest_author":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW/action/author_attestation","sign_citation":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW/action/citation_signature","submit_replication":"https://pith.science/pith/6CP6QKYWJWQWZGVT3COS6PSTVW/action/replication_record"}},"created_at":"2026-07-05T12:00:11.048064+00:00","updated_at":"2026-07-05T12:00:11.048064+00:00"}