{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OSBUOVR5HBSQUSS6A6VXR6ERJ3","short_pith_number":"pith:OSBUOVR5","schema_version":"1.0","canonical_sha256":"748347563d38650a4a5e07ab78f8914ec847fdf85cef041e0fac1c568aca8f0b","source":{"kind":"arxiv","id":"2203.03961","version":2},"attestation_state":"computed","paper":{"title":"Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.SC","authors_text":"\\'Eric Schost, Mohab Safey El Din (PolSys), R\\'emi Pr\\'ebet (PolSys)","submitted_at":"2022-03-08T09:35:01Z","abstract_excerpt":"Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is tackled through the computation of so-called roadmaps which are real algebraic subsets of the set V under study, of dimension at most one, and which have a connected intersection with all semi-algebraically connected components of V. Algorithms for computing roadmaps rely on statements establishing connectivity properties of some well-chosen subsets of V , assumin"},"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":"2203.03961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2022-03-08T09:35:01Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9e8b0aa647147bdb155398f3b61ee5eef0f66f74cbda0b292838648dc00be0dc","abstract_canon_sha256":"9856b6214597ea7aea27c007f20f210256bf69f3911af7131c279421c2261529"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:15.820401Z","signature_b64":"kCydgLIGNYXOxSZvr3xpK2vQF2WUyaM68mFDAFspG1W7kNAuR1h/vZSdOFtvxDMIQe73L5VyOj/j4juhmCL5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"748347563d38650a4a5e07ab78f8914ec847fdf85cef041e0fac1c568aca8f0b","last_reissued_at":"2026-07-05T06:18:15.819899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:15.819899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.SC","authors_text":"\\'Eric Schost, Mohab Safey El Din (PolSys), R\\'emi Pr\\'ebet (PolSys)","submitted_at":"2022-03-08T09:35:01Z","abstract_excerpt":"Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is tackled through the computation of so-called roadmaps which are real algebraic subsets of the set V under study, of dimension at most one, and which have a connected intersection with all semi-algebraically connected components of V. Algorithms for computing roadmaps rely on statements establishing connectivity properties of some well-chosen subsets of V , assumin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03961","kind":"arxiv","version":2},"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/2203.03961/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":"2203.03961","created_at":"2026-07-05T06:18:15.819960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03961v2","created_at":"2026-07-05T06:18:15.819960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03961","created_at":"2026-07-05T06:18:15.819960+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSBUOVR5HBSQ","created_at":"2026-07-05T06:18:15.819960+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSBUOVR5HBSQUSS6","created_at":"2026-07-05T06:18:15.819960+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSBUOVR5","created_at":"2026-07-05T06:18:15.819960+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11546","citing_title":"A certified classification of first-order controlled coaxial telescopes","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3","json":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3.json","graph_json":"https://pith.science/api/pith-number/OSBUOVR5HBSQUSS6A6VXR6ERJ3/graph.json","events_json":"https://pith.science/api/pith-number/OSBUOVR5HBSQUSS6A6VXR6ERJ3/events.json","paper":"https://pith.science/paper/OSBUOVR5"},"agent_actions":{"view_html":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3","download_json":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3.json","view_paper":"https://pith.science/paper/OSBUOVR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03961&json=true","fetch_graph":"https://pith.science/api/pith-number/OSBUOVR5HBSQUSS6A6VXR6ERJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/OSBUOVR5HBSQUSS6A6VXR6ERJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3/action/storage_attestation","attest_author":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3/action/author_attestation","sign_citation":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3/action/citation_signature","submit_replication":"https://pith.science/pith/OSBUOVR5HBSQUSS6A6VXR6ERJ3/action/replication_record"}},"created_at":"2026-07-05T06:18:15.819960+00:00","updated_at":"2026-07-05T06:18:15.819960+00:00"}