{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OZGBIRTSO5VAPZ6VWBWMD3FF4A","short_pith_number":"pith:OZGBIRTS","schema_version":"1.0","canonical_sha256":"764c144672776a07e7d5b06cc1eca5e017fea6ad79a48e0e5fccea522b993c1d","source":{"kind":"arxiv","id":"2607.25457","version":1},"attestation_state":"computed","paper":{"title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.CG","authors_text":"J\\'er\\^ome Michaud, Sergey Korotov","submitted_at":"2026-07-28T08:47:20Z","abstract_excerpt":"We define a mesh refinement algorithm based on the rule of dividing the largest angles of triangular elements of planar partitions in focus into $n$ equal parts, and analyse the (geometric) properties of triangulations generated by this technique. This largest-angle $n$-section rule is compared with the classical longest-edge $n$-section rule, where it is the longest edges which are split into $n$ equal parts. The longest-edge bisection and trisection are known to produce nondegenerate triangulations (possibly with hanging nodes), but the longest-edge $n$-sections with $n\\geq 4$ always produce"},"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":"2607.25457","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-28T08:47:20Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"c35a6ce2ecc0f343f22f0defd19a39a987eea5547660de3f5549954c46c9d2cc","abstract_canon_sha256":"6b428284280a6c6a25baacea803c883a62a6735910a3c941599220a5829f23c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:16.339986Z","signature_b64":"Q6Rqs6GHGwyoj+LdVlAtdqNtLtD4b2uqWXpSbfwMEnAwbe0xPvfkjBa76PjxGkyKd+PEMFgvR5LbA9rSS4pJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"764c144672776a07e7d5b06cc1eca5e017fea6ad79a48e0e5fccea522b993c1d","last_reissued_at":"2026-07-29T01:25:16.339111Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:16.339111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.CG","authors_text":"J\\'er\\^ome Michaud, Sergey Korotov","submitted_at":"2026-07-28T08:47:20Z","abstract_excerpt":"We define a mesh refinement algorithm based on the rule of dividing the largest angles of triangular elements of planar partitions in focus into $n$ equal parts, and analyse the (geometric) properties of triangulations generated by this technique. This largest-angle $n$-section rule is compared with the classical longest-edge $n$-section rule, where it is the longest edges which are split into $n$ equal parts. The longest-edge bisection and trisection are known to produce nondegenerate triangulations (possibly with hanging nodes), but the longest-edge $n$-sections with $n\\geq 4$ always produce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25457","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/2607.25457/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":"2607.25457","created_at":"2026-07-29T01:25:16.339563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25457v1","created_at":"2026-07-29T01:25:16.339563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25457","created_at":"2026-07-29T01:25:16.339563+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZGBIRTSO5VA","created_at":"2026-07-29T01:25:16.339563+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZGBIRTSO5VAPZ6V","created_at":"2026-07-29T01:25:16.339563+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZGBIRTS","created_at":"2026-07-29T01:25:16.339563+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/OZGBIRTSO5VAPZ6VWBWMD3FF4A","json":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A.json","graph_json":"https://pith.science/api/pith-number/OZGBIRTSO5VAPZ6VWBWMD3FF4A/graph.json","events_json":"https://pith.science/api/pith-number/OZGBIRTSO5VAPZ6VWBWMD3FF4A/events.json","paper":"https://pith.science/paper/OZGBIRTS"},"agent_actions":{"view_html":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A","download_json":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A.json","view_paper":"https://pith.science/paper/OZGBIRTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25457&json=true","fetch_graph":"https://pith.science/api/pith-number/OZGBIRTSO5VAPZ6VWBWMD3FF4A/graph.json","fetch_events":"https://pith.science/api/pith-number/OZGBIRTSO5VAPZ6VWBWMD3FF4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A/action/storage_attestation","attest_author":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A/action/author_attestation","sign_citation":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A/action/citation_signature","submit_replication":"https://pith.science/pith/OZGBIRTSO5VAPZ6VWBWMD3FF4A/action/replication_record"}},"created_at":"2026-07-29T01:25:16.339563+00:00","updated_at":"2026-07-29T01:25:16.339563+00:00"}