{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OCR5UWT7U655555QD2H2HP2EQ7","short_pith_number":"pith:OCR5UWT7","schema_version":"1.0","canonical_sha256":"70a3da5a7fa7bbdef7b01e8fa3bf4487dad00b3e7e139b9c1b3bfc973a506da5","source":{"kind":"arxiv","id":"1902.01814","version":2},"attestation_state":"computed","paper":{"title":"A non-iterative method for robustly computing the intersections between a line and a curve or surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.NA","math.AG"],"primary_cat":"math.NA","authors_text":"Fehmi Cirak, Laurent Buse, Xiao Xiao","submitted_at":"2019-02-05T17:39:31Z","abstract_excerpt":"The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a non-iterative method for computing intersections by solving a matrix singular value decomposition (SVD) and an eigenvalue problem. That is, all intersection points and their parametric coordinates are determined in one-shot using only standard linear algebra techniques available in most software libraries. As a result, the introduced technique is far more robust"},"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":"1902.01814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-05T17:39:31Z","cross_cats_sorted":["cs.CG","cs.NA","math.AG"],"title_canon_sha256":"dd0042ecfb5cdfd667550a21090359f59cc185e3dcc8d37f1aae1ff71f1c507d","abstract_canon_sha256":"fd35b97566931a72fceb4932c4b2c04ef6ef25e5973f8756c32ecd9d6dc67166"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:34.505599Z","signature_b64":"h614MxAQaddSEGndv9xU19cRYVyXYEyb7fHy/R/pTODpIdpJucQ/3Umldbu0moLMeqvEIGayH2vQNry0XA5FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70a3da5a7fa7bbdef7b01e8fa3bf4487dad00b3e7e139b9c1b3bfc973a506da5","last_reissued_at":"2026-07-05T01:49:34.505242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:34.505242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A non-iterative method for robustly computing the intersections between a line and a curve or surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.NA","math.AG"],"primary_cat":"math.NA","authors_text":"Fehmi Cirak, Laurent Buse, Xiao Xiao","submitted_at":"2019-02-05T17:39:31Z","abstract_excerpt":"The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a non-iterative method for computing intersections by solving a matrix singular value decomposition (SVD) and an eigenvalue problem. That is, all intersection points and their parametric coordinates are determined in one-shot using only standard linear algebra techniques available in most software libraries. As a result, the introduced technique is far more robust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01814","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/1902.01814/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":"1902.01814","created_at":"2026-07-05T01:49:34.505297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01814v2","created_at":"2026-07-05T01:49:34.505297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01814","created_at":"2026-07-05T01:49:34.505297+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCR5UWT7U655","created_at":"2026-07-05T01:49:34.505297+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCR5UWT7U655555Q","created_at":"2026-07-05T01:49:34.505297+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCR5UWT7","created_at":"2026-07-05T01:49:34.505297+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/OCR5UWT7U655555QD2H2HP2EQ7","json":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7.json","graph_json":"https://pith.science/api/pith-number/OCR5UWT7U655555QD2H2HP2EQ7/graph.json","events_json":"https://pith.science/api/pith-number/OCR5UWT7U655555QD2H2HP2EQ7/events.json","paper":"https://pith.science/paper/OCR5UWT7"},"agent_actions":{"view_html":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7","download_json":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7.json","view_paper":"https://pith.science/paper/OCR5UWT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01814&json=true","fetch_graph":"https://pith.science/api/pith-number/OCR5UWT7U655555QD2H2HP2EQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/OCR5UWT7U655555QD2H2HP2EQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7/action/storage_attestation","attest_author":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7/action/author_attestation","sign_citation":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7/action/citation_signature","submit_replication":"https://pith.science/pith/OCR5UWT7U655555QD2H2HP2EQ7/action/replication_record"}},"created_at":"2026-07-05T01:49:34.505297+00:00","updated_at":"2026-07-05T01:49:34.505297+00:00"}