{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E6RALYJPBR77XJF3SV3NUASV66","short_pith_number":"pith:E6RALYJP","schema_version":"1.0","canonical_sha256":"27a205e12f0c7ffba4bb9576da0255f78f7bf25d67c765fb186a2de2072c3c4e","source":{"kind":"arxiv","id":"1705.11032","version":3},"attestation_state":"computed","paper":{"title":"Application of projection algorithms to differential equations: boundary value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.OC"],"primary_cat":"math.NA","authors_text":"Bishnu P. Lamichhane, Brailey Sims, Scott B. Lindstrom","submitted_at":"2017-05-31T11:13:03Z","abstract_excerpt":"The Douglas-Rachford method has been employed successfully to solve many kinds of non-convex feasibility problems. In particular, recent research has shown surprising stability for the method when it is applied to finding the intersections of hypersurfaces. Motivated by these discoveries, we reformulate a second order boundary valued problem (BVP) as a feasibility problem where the sets are hypersurfaces. We show that such a problem may always be reformulated as a feasibility problem on no more than three sets and is well-suited to parallelization. We explore the stability of the method by app"},"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":"1705.11032","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-31T11:13:03Z","cross_cats_sorted":["math.CA","math.OC"],"title_canon_sha256":"08b801416c320b4633db92548eb049e36c30d0e60fa69ebd0ef0ca4c8ed1a523","abstract_canon_sha256":"44cd6bb4b91a892bfaf7601f5f887aeac164bcb6423c32efc51b54be207c909f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.806680Z","signature_b64":"I9A7Ap/L/VR/Bilb6QiSSpo0tiVwh1jseb8KuVQ8itt69FLu/8IxTxnrkk//WqVQ1AinVE5fe8n7xO2aIhpOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a205e12f0c7ffba4bb9576da0255f78f7bf25d67c765fb186a2de2072c3c4e","last_reissued_at":"2026-05-18T00:05:19.806224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.806224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application of projection algorithms to differential equations: boundary value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.OC"],"primary_cat":"math.NA","authors_text":"Bishnu P. Lamichhane, Brailey Sims, Scott B. Lindstrom","submitted_at":"2017-05-31T11:13:03Z","abstract_excerpt":"The Douglas-Rachford method has been employed successfully to solve many kinds of non-convex feasibility problems. In particular, recent research has shown surprising stability for the method when it is applied to finding the intersections of hypersurfaces. Motivated by these discoveries, we reformulate a second order boundary valued problem (BVP) as a feasibility problem where the sets are hypersurfaces. We show that such a problem may always be reformulated as a feasibility problem on no more than three sets and is well-suited to parallelization. We explore the stability of the method by app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11032","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.11032","created_at":"2026-05-18T00:05:19.806298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.11032v3","created_at":"2026-05-18T00:05:19.806298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11032","created_at":"2026-05-18T00:05:19.806298+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6RALYJPBR77","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6RALYJPBR77XJF3","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6RALYJP","created_at":"2026-05-18T12:31:12.930513+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/E6RALYJPBR77XJF3SV3NUASV66","json":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66.json","graph_json":"https://pith.science/api/pith-number/E6RALYJPBR77XJF3SV3NUASV66/graph.json","events_json":"https://pith.science/api/pith-number/E6RALYJPBR77XJF3SV3NUASV66/events.json","paper":"https://pith.science/paper/E6RALYJP"},"agent_actions":{"view_html":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66","download_json":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66.json","view_paper":"https://pith.science/paper/E6RALYJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.11032&json=true","fetch_graph":"https://pith.science/api/pith-number/E6RALYJPBR77XJF3SV3NUASV66/graph.json","fetch_events":"https://pith.science/api/pith-number/E6RALYJPBR77XJF3SV3NUASV66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66/action/storage_attestation","attest_author":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66/action/author_attestation","sign_citation":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66/action/citation_signature","submit_replication":"https://pith.science/pith/E6RALYJPBR77XJF3SV3NUASV66/action/replication_record"}},"created_at":"2026-05-18T00:05:19.806298+00:00","updated_at":"2026-05-18T00:05:19.806298+00:00"}