{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LIIPFO32F5M7XURUE4UNGR3C5E","short_pith_number":"pith:LIIPFO32","schema_version":"1.0","canonical_sha256":"5a10f2bb7a2f59fbd2342728d34762e92493682d4426f17f4ff0e32fb994214b","source":{"kind":"arxiv","id":"2409.00809","version":2},"attestation_state":"computed","paper":{"title":"Constructing stable, high-order finite-difference operators on point clouds over complex geometries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ge Yan, Jason Hicken, Sharanjeet Kaur","submitted_at":"2024-09-01T18:56:27Z","abstract_excerpt":"High-order difference operators with the summation-by-parts (SBP) property can be used to build stable discretizations of hyperbolic conservation laws; however, most high-order SBP operators require a conforming, high-order mesh for the domain of interest. To circumvent this requirement, we present an algorithm for building high-order, diagonal-norm, first-derivative SBP operators on point clouds over level-set geometries. The algorithm is not mesh-free, since it uses a Cartesian cut-cell mesh to define the sparsity pattern of the operators and to provide intermediate quadrature rules; however"},"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":"2409.00809","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-09-01T18:56:27Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"9c06358d52e82b830bb424f1864f8e0de928db6e8abf2b95d320a709630bcd1b","abstract_canon_sha256":"38306309e3b76e536039a4bf9b2554512524a9ae193c534adc912bab52512102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:05.833470Z","signature_b64":"oxIMi3gLjrKXp0SGbyN0RRS4YbPGcTuNwvRBnc2sku7GkCnYqFgrO9Zsj5z81qR+yA1QKYgKoJGlyDt601QtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a10f2bb7a2f59fbd2342728d34762e92493682d4426f17f4ff0e32fb994214b","last_reissued_at":"2026-07-05T10:06:05.832942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:05.832942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing stable, high-order finite-difference operators on point clouds over complex geometries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ge Yan, Jason Hicken, Sharanjeet Kaur","submitted_at":"2024-09-01T18:56:27Z","abstract_excerpt":"High-order difference operators with the summation-by-parts (SBP) property can be used to build stable discretizations of hyperbolic conservation laws; however, most high-order SBP operators require a conforming, high-order mesh for the domain of interest. To circumvent this requirement, we present an algorithm for building high-order, diagonal-norm, first-derivative SBP operators on point clouds over level-set geometries. The algorithm is not mesh-free, since it uses a Cartesian cut-cell mesh to define the sparsity pattern of the operators and to provide intermediate quadrature rules; however"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00809","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/2409.00809/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":"2409.00809","created_at":"2026-07-05T10:06:05.832992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.00809v2","created_at":"2026-07-05T10:06:05.832992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00809","created_at":"2026-07-05T10:06:05.832992+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIIPFO32F5M7","created_at":"2026-07-05T10:06:05.832992+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIIPFO32F5M7XURU","created_at":"2026-07-05T10:06:05.832992+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIIPFO32","created_at":"2026-07-05T10:06:05.832992+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21427","citing_title":"Computing Radially-Symmetric Solutions of the Ultra-Relativistic Euler Equations with Entropy-Stable Discontinuous Galerkin Methods","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E","json":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E.json","graph_json":"https://pith.science/api/pith-number/LIIPFO32F5M7XURUE4UNGR3C5E/graph.json","events_json":"https://pith.science/api/pith-number/LIIPFO32F5M7XURUE4UNGR3C5E/events.json","paper":"https://pith.science/paper/LIIPFO32"},"agent_actions":{"view_html":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E","download_json":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E.json","view_paper":"https://pith.science/paper/LIIPFO32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.00809&json=true","fetch_graph":"https://pith.science/api/pith-number/LIIPFO32F5M7XURUE4UNGR3C5E/graph.json","fetch_events":"https://pith.science/api/pith-number/LIIPFO32F5M7XURUE4UNGR3C5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E/action/storage_attestation","attest_author":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E/action/author_attestation","sign_citation":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E/action/citation_signature","submit_replication":"https://pith.science/pith/LIIPFO32F5M7XURUE4UNGR3C5E/action/replication_record"}},"created_at":"2026-07-05T10:06:05.832992+00:00","updated_at":"2026-07-05T10:06:05.832992+00:00"}