{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PJARAEOT5IFSSKJ4MY4BPU6K4Y","short_pith_number":"pith:PJARAEOT","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"},"canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","source":{"kind":"arxiv","id":"1812.01558","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01558","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01558v3","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01558","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"PJARAEOT5IFS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJARAEOT5IFSSKJ4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJARAEOT","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PJARAEOT5IFSSKJ4MY4BPU6K4Y","target":"record","payload":{"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"},"canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","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"},"source_kind":"arxiv","source_id":"1812.01558","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ta7mWbR+0dxFiTtsfscyHi3/USs15EkoGagzo9RNnK2cq3eB8VqZLnC1yjeQpfdOaR71LcaFVVM+G8cgRTBECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:02:19.272445Z"},"content_sha256":"3fa8deba199da099e125d84a8db0604dbf4d040c6c37561857b8d74eafcd8b69","schema_version":"1.0","event_id":"sha256:3fa8deba199da099e125d84a8db0604dbf4d040c6c37561857b8d74eafcd8b69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PJARAEOT5IFSSKJ4MY4BPU6K4Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/Hmf12VPDO8v4UTKGFg3Q3xMHJ+0NOfICpCnOC2gjuMni06+A+WSDDlQ/iDkY9r9i1kqcp4sCwCvIrf2mxYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:02:19.272787Z"},"content_sha256":"d856e05bd9e9817cf75ce0a1baeb8009b2d66f92b2e649f2959dc402d10d888a","schema_version":"1.0","event_id":"sha256:d856e05bd9e9817cf75ce0a1baeb8009b2d66f92b2e649f2959dc402d10d888a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/bundle.json","state_url":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T10:02:19Z","links":{"resolver":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y","bundle":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/bundle.json","state":"https://pith.science/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJARAEOT5IFSSKJ4MY4BPU6K4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PJARAEOT5IFSSKJ4MY4BPU6K4Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ef3cbb50fb1dbb4fe61dcf1549663a1d005444635cf070665ba433ed2f6301b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-04T17:55:28Z","title_canon_sha256":"07e70d443b2875c672b03ea6f6134989cfc9d0a4e903d9405678de77944f0fd1"},"schema_version":"1.0","source":{"id":"1812.01558","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01558","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01558v3","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01558","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"PJARAEOT5IFS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJARAEOT5IFSSKJ4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJARAEOT","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:d856e05bd9e9817cf75ce0a1baeb8009b2d66f92b2e649f2959dc402d10d888a","target":"graph","created_at":"2026-05-17T23:55:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ghulam Mustafa, Rabia Hameed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-04T17:55:28Z","title":"Recursive process for constructing the refinement rules of new combined subdivision schemes and its extended form"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01558","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3fa8deba199da099e125d84a8db0604dbf4d040c6c37561857b8d74eafcd8b69","target":"record","created_at":"2026-05-17T23:55:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ef3cbb50fb1dbb4fe61dcf1549663a1d005444635cf070665ba433ed2f6301b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-04T17:55:28Z","title_canon_sha256":"07e70d443b2875c672b03ea6f6134989cfc9d0a4e903d9405678de77944f0fd1"},"schema_version":"1.0","source":{"id":"1812.01558","kind":"arxiv","version":3}},"canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a411011d3ea0b29293c663817d3cae637692a36d79b947a017b3d8581edd531","first_computed_at":"2026-05-17T23:55:33.900958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:33.900958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brLGDrhYA9ryWeHorvuznqiLWKLtokwxwlZKDVwiWSStf05Ae1B9k4YsemL9ZenOU0Y3su+Tknwy3yeSYMGtAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:33.901441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01558","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fa8deba199da099e125d84a8db0604dbf4d040c6c37561857b8d74eafcd8b69","sha256:d856e05bd9e9817cf75ce0a1baeb8009b2d66f92b2e649f2959dc402d10d888a"],"state_sha256":"573729704f96313a4733e5b561e1899470b5f3daef84b16a8038058de092b3c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0J1FsEACIN5wF3lhNNAeZyHWs0KRyblRFK+WdmcwOcjeBPyWCAvRfA6x0l9upQenthzUiMka0iPVtZdc8jHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:02:19.274663Z","bundle_sha256":"30e85e53ad9b27c820c7976d359560b980aadf4e7c8578168ebaef3bec66560d"}}