{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WMQRU3FJCDRYF6AKPFKU6ACJ2J","short_pith_number":"pith:WMQRU3FJ","schema_version":"1.0","canonical_sha256":"b3211a6ca910e382f80a79554f0049d272551b7b3342e8555d8926c572fd7723","source":{"kind":"arxiv","id":"2505.08427","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for the reach and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Platt, Ra\\'ul S\\'anchez Gal\\'an","submitted_at":"2025-05-13T10:45:39Z","abstract_excerpt":"The reach of a submanifold of $\\mathbb{R}^N$ is defined as the largest radius of a tubular neighbourhood around the submanifold that avoids self-intersections. While essential in geometric and topological applications, computing the reach explicitly is notoriously difficult. In this paper, we introduce a rigorous and practical method to compute a guaranteed lower bound for the reach of a submanifold described as the common zero-set of finitely many smooth functions, not necessarily polynomials. Our algorithm uses techniques from numerically verified proofs and is particularly suitable for high"},"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":"2505.08427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-05-13T10:45:39Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b4ee4609190bba0653057bab707d99a12dad733858fbce41b9387dfbf717391e","abstract_canon_sha256":"249fc7c4820621f82069daf7bc69fb2880dde3f954246a23c73a8410b92573bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:30.384550Z","signature_b64":"g7A6zFvU2y2VJSmRzRX0NjvvNgDiStPOV3HNhUxhyiEIr+VugoLvFr9ltvlLIaIA5/edbj88IUMAHF3FI/p6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3211a6ca910e382f80a79554f0049d272551b7b3342e8555d8926c572fd7723","last_reissued_at":"2026-07-05T11:02:30.384030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:30.384030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for the reach and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Platt, Ra\\'ul S\\'anchez Gal\\'an","submitted_at":"2025-05-13T10:45:39Z","abstract_excerpt":"The reach of a submanifold of $\\mathbb{R}^N$ is defined as the largest radius of a tubular neighbourhood around the submanifold that avoids self-intersections. While essential in geometric and topological applications, computing the reach explicitly is notoriously difficult. In this paper, we introduce a rigorous and practical method to compute a guaranteed lower bound for the reach of a submanifold described as the common zero-set of finitely many smooth functions, not necessarily polynomials. Our algorithm uses techniques from numerically verified proofs and is particularly suitable for high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08427","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.08427/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":"2505.08427","created_at":"2026-07-05T11:02:30.384104+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08427v1","created_at":"2026-07-05T11:02:30.384104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08427","created_at":"2026-07-05T11:02:30.384104+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMQRU3FJCDRY","created_at":"2026-07-05T11:02:30.384104+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMQRU3FJCDRYF6AK","created_at":"2026-07-05T11:02:30.384104+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMQRU3FJ","created_at":"2026-07-05T11:02:30.384104+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/WMQRU3FJCDRYF6AKPFKU6ACJ2J","json":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J.json","graph_json":"https://pith.science/api/pith-number/WMQRU3FJCDRYF6AKPFKU6ACJ2J/graph.json","events_json":"https://pith.science/api/pith-number/WMQRU3FJCDRYF6AKPFKU6ACJ2J/events.json","paper":"https://pith.science/paper/WMQRU3FJ"},"agent_actions":{"view_html":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J","download_json":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J.json","view_paper":"https://pith.science/paper/WMQRU3FJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08427&json=true","fetch_graph":"https://pith.science/api/pith-number/WMQRU3FJCDRYF6AKPFKU6ACJ2J/graph.json","fetch_events":"https://pith.science/api/pith-number/WMQRU3FJCDRYF6AKPFKU6ACJ2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J/action/storage_attestation","attest_author":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J/action/author_attestation","sign_citation":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J/action/citation_signature","submit_replication":"https://pith.science/pith/WMQRU3FJCDRYF6AKPFKU6ACJ2J/action/replication_record"}},"created_at":"2026-07-05T11:02:30.384104+00:00","updated_at":"2026-07-05T11:02:30.384104+00:00"}