{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KUIABCQLZD7GIMT4LOHVEC4VL2","short_pith_number":"pith:KUIABCQL","schema_version":"1.0","canonical_sha256":"5510008a0bc8fe64327c5b8f520b955ea1c26b8d254dfcfd38e49ce04ef30a8f","source":{"kind":"arxiv","id":"1605.08852","version":1},"attestation_state":"computed","paper":{"title":"Computing Overlaps of Two Quadrilateral Mesh Of the Same Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Shengxin Zhu, Xihua Xu","submitted_at":"2016-05-28T06:43:31Z","abstract_excerpt":"An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion on how to calculate overlaps of two grids. Computing the exact overlaps was believed complicated and often be avoided. This paper introduces the mathematical formulation of such a problem and tools to solve the problem. We propose methods to calculate the overlaps of two dismissable general quadrilateral mesh of the same logically structure in a planar domain"},"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":"1605.08852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-28T06:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"60c0d263556b1be7fd067d273db9252ce1c17758be7f41ac6c316ec157b37b4b","abstract_canon_sha256":"f629bac9722ab2c24e91336bbea1e5ac2b93982b6a6ac3d61914126b1ba52449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:22.889235Z","signature_b64":"zmN7xYDV08kI3H7aDtD1dTUwZ49UkmWTxmknq+9CEVbfLv3mtIfnKgl/sWbo5ulFaT2OfIoFE96ByzPGOZ2CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5510008a0bc8fe64327c5b8f520b955ea1c26b8d254dfcfd38e49ce04ef30a8f","last_reissued_at":"2026-05-18T01:13:22.888710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:22.888710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Overlaps of Two Quadrilateral Mesh Of the Same Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Shengxin Zhu, Xihua Xu","submitted_at":"2016-05-28T06:43:31Z","abstract_excerpt":"An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion on how to calculate overlaps of two grids. Computing the exact overlaps was believed complicated and often be avoided. This paper introduces the mathematical formulation of such a problem and tools to solve the problem. We propose methods to calculate the overlaps of two dismissable general quadrilateral mesh of the same logically structure in a planar domain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08852","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":""},"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":"1605.08852","created_at":"2026-05-18T01:13:22.888793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08852v1","created_at":"2026-05-18T01:13:22.888793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08852","created_at":"2026-05-18T01:13:22.888793+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUIABCQLZD7G","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUIABCQLZD7GIMT4","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUIABCQL","created_at":"2026-05-18T12:30:29.479603+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/KUIABCQLZD7GIMT4LOHVEC4VL2","json":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2.json","graph_json":"https://pith.science/api/pith-number/KUIABCQLZD7GIMT4LOHVEC4VL2/graph.json","events_json":"https://pith.science/api/pith-number/KUIABCQLZD7GIMT4LOHVEC4VL2/events.json","paper":"https://pith.science/paper/KUIABCQL"},"agent_actions":{"view_html":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2","download_json":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2.json","view_paper":"https://pith.science/paper/KUIABCQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08852&json=true","fetch_graph":"https://pith.science/api/pith-number/KUIABCQLZD7GIMT4LOHVEC4VL2/graph.json","fetch_events":"https://pith.science/api/pith-number/KUIABCQLZD7GIMT4LOHVEC4VL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2/action/storage_attestation","attest_author":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2/action/author_attestation","sign_citation":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2/action/citation_signature","submit_replication":"https://pith.science/pith/KUIABCQLZD7GIMT4LOHVEC4VL2/action/replication_record"}},"created_at":"2026-05-18T01:13:22.888793+00:00","updated_at":"2026-05-18T01:13:22.888793+00:00"}