{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A2RXZWS6M3N22SYIE4U5RLTUFB","short_pith_number":"pith:A2RXZWS6","schema_version":"1.0","canonical_sha256":"06a37cda5e66dbad4b082729d8ae7428421cbaadd12b91a065d37ab7ce9969ec","source":{"kind":"arxiv","id":"1407.6175","version":4},"attestation_state":"computed","paper":{"title":"Analysis-suitable adaptive T-mesh refinement with linear complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Peterseim, Philipp Morgenstern","submitted_at":"2014-07-23T11:11:11Z","abstract_excerpt":"We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements."},"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":"1407.6175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-23T11:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"ad9ac3f8b295decef5039864cbde3642e73f9ff25cf6ed6aa67f2d029723cd22","abstract_canon_sha256":"4a29d511176bd2fc75c50ac5070dd11d2b7531ce56a56196394ad1011979e824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:53.335131Z","signature_b64":"yE24b9jYxEaGr+V0It0sTA9ZkPbD4M/LjqWdPDqqVWzyXI2VIFN3QsYkhpV2pBo7UCOADEEO3J77UBE0aoZOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a37cda5e66dbad4b082729d8ae7428421cbaadd12b91a065d37ab7ce9969ec","last_reissued_at":"2026-05-18T01:15:53.334680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:53.334680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis-suitable adaptive T-mesh refinement with linear complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Peterseim, Philipp Morgenstern","submitted_at":"2014-07-23T11:11:11Z","abstract_excerpt":"We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6175","kind":"arxiv","version":4},"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":"1407.6175","created_at":"2026-05-18T01:15:53.334742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6175v4","created_at":"2026-05-18T01:15:53.334742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6175","created_at":"2026-05-18T01:15:53.334742+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2RXZWS6M3N2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2RXZWS6M3N22SYI","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2RXZWS6","created_at":"2026-05-18T12:28:19.803747+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/A2RXZWS6M3N22SYIE4U5RLTUFB","json":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB.json","graph_json":"https://pith.science/api/pith-number/A2RXZWS6M3N22SYIE4U5RLTUFB/graph.json","events_json":"https://pith.science/api/pith-number/A2RXZWS6M3N22SYIE4U5RLTUFB/events.json","paper":"https://pith.science/paper/A2RXZWS6"},"agent_actions":{"view_html":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB","download_json":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB.json","view_paper":"https://pith.science/paper/A2RXZWS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6175&json=true","fetch_graph":"https://pith.science/api/pith-number/A2RXZWS6M3N22SYIE4U5RLTUFB/graph.json","fetch_events":"https://pith.science/api/pith-number/A2RXZWS6M3N22SYIE4U5RLTUFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB/action/storage_attestation","attest_author":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB/action/author_attestation","sign_citation":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB/action/citation_signature","submit_replication":"https://pith.science/pith/A2RXZWS6M3N22SYIE4U5RLTUFB/action/replication_record"}},"created_at":"2026-05-18T01:15:53.334742+00:00","updated_at":"2026-05-18T01:15:53.334742+00:00"}