{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PJARAEOT5IFSSKJ4MY4BPU6K4Y","short_pith_number":"pith:PJARAEOT","schema_version":"1.0","canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","source":{"kind":"arxiv","id":"1812.01558","version":3},"attestation_state":"computed","paper":{"title":"Recursive process for constructing the refinement rules of new combined subdivision schemes and its extended form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ghulam Mustafa, Rabia Hameed","submitted_at":"2018-12-04T17:55:28Z","abstract_excerpt":"In this article, we present a new method to construct a family of (2N+2)-point binary subdivision schemes with one tension parameter where N is a non-negative integer. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, the refinement rules of a (2N+2)-point scheme for N=M are recursively obtained from the refinement rules of the (2N+2)-point schemes for N=0,1,2,...,M-1. The complexity, polynomial reproduction and polynomial generation of these schemes are increased by two for the successive values of $N$. Furth"},"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":"1812.01558","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-04T17:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"07e70d443b2875c672b03ea6f6134989cfc9d0a4e903d9405678de77944f0fd1","abstract_canon_sha256":"ef3cbb50fb1dbb4fe61dcf1549663a1d005444635cf070665ba433ed2f6301b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:33.901441Z","signature_b64":"brLGDrhYA9ryWeHorvuznqiLWKLtokwxwlZKDVwiWSStf05Ae1B9k4YsemL9ZenOU0Y3su+Tknwy3yeSYMGtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","last_reissued_at":"2026-05-17T23:55:33.900958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:33.900958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive process for constructing the refinement rules of new combined subdivision schemes and its extended form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ghulam Mustafa, Rabia Hameed","submitted_at":"2018-12-04T17:55:28Z","abstract_excerpt":"In this article, we present a new method to construct a family of (2N+2)-point binary subdivision schemes with one tension parameter where N is a non-negative integer. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, the refinement rules of a (2N+2)-point scheme for N=M are recursively obtained from the refinement rules of the (2N+2)-point schemes for N=0,1,2,...,M-1. The complexity, polynomial reproduction and polynomial generation of these schemes are increased by two for the successive values of $N$. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01558","kind":"arxiv","version":3},"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":"1812.01558","created_at":"2026-05-17T23:55:33.901029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01558v3","created_at":"2026-05-17T23:55:33.901029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01558","created_at":"2026-05-17T23:55:33.901029+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJARAEOT5IFS","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJARAEOT5IFSSKJ4","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJARAEOT","created_at":"2026-05-18T12:32:43.782077+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/PJARAEOT5IFSSKJ4MY4BPU6K4Y","json":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y.json","graph_json":"https://pith.science/api/pith-number/PJARAEOT5IFSSKJ4MY4BPU6K4Y/graph.json","events_json":"https://pith.science/api/pith-number/PJARAEOT5IFSSKJ4MY4BPU6K4Y/events.json","paper":"https://pith.science/paper/PJARAEOT"},"agent_actions":{"view_html":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y","download_json":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y.json","view_paper":"https://pith.science/paper/PJARAEOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01558&json=true","fetch_graph":"https://pith.science/api/pith-number/PJARAEOT5IFSSKJ4MY4BPU6K4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/PJARAEOT5IFSSKJ4MY4BPU6K4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/action/storage_attestation","attest_author":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/action/author_attestation","sign_citation":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/action/citation_signature","submit_replication":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/action/replication_record"}},"created_at":"2026-05-17T23:55:33.901029+00:00","updated_at":"2026-05-17T23:55:33.901029+00:00"}