{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2WLCILAE4ZB72KHVAFAOEQE7L3","short_pith_number":"pith:2WLCILAE","schema_version":"1.0","canonical_sha256":"d596242c04e643fd28f50140e2409f5ec8e69e0a755a98bd1d00eecc69006833","source":{"kind":"arxiv","id":"1004.1295","version":1},"attestation_state":"computed","paper":{"title":"Convexity preserving interpolatory subdivision with conic precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gudrun Albrecht, Lucia Romani","submitted_at":"2010-04-08T10:00:37Z","abstract_excerpt":"The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method."},"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":"1004.1295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-04-08T10:00:37Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e8290b05c49e191cd4a21c71e09b07e83fbb0350b05b7e69203ef4fd8023643d","abstract_canon_sha256":"f74818b4d258f108eaec971fd9f99df9af70b18fee9c474cb10e8e0229243fec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:35.282027Z","signature_b64":"OJt5WOHDej3cCURlFhgOCYYIBt+jMGi1S9IjDgjKQt6BuzyBDNLBdyjsQZ2Xf/OorpCou2A+p5QZo6odO8lZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d596242c04e643fd28f50140e2409f5ec8e69e0a755a98bd1d00eecc69006833","last_reissued_at":"2026-06-03T23:06:35.281595Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:35.281595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convexity preserving interpolatory subdivision with conic precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gudrun Albrecht, Lucia Romani","submitted_at":"2010-04-08T10:00:37Z","abstract_excerpt":"The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1295","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/1004.1295/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":"1004.1295","created_at":"2026-06-03T23:06:35.281654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1295v1","created_at":"2026-06-03T23:06:35.281654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1295","created_at":"2026-06-03T23:06:35.281654+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WLCILAE4ZB7","created_at":"2026-06-03T23:06:35.281654+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WLCILAE4ZB72KHV","created_at":"2026-06-03T23:06:35.281654+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WLCILAE","created_at":"2026-06-03T23:06:35.281654+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/2WLCILAE4ZB72KHVAFAOEQE7L3","json":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3.json","graph_json":"https://pith.science/api/pith-number/2WLCILAE4ZB72KHVAFAOEQE7L3/graph.json","events_json":"https://pith.science/api/pith-number/2WLCILAE4ZB72KHVAFAOEQE7L3/events.json","paper":"https://pith.science/paper/2WLCILAE"},"agent_actions":{"view_html":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3","download_json":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3.json","view_paper":"https://pith.science/paper/2WLCILAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1295&json=true","fetch_graph":"https://pith.science/api/pith-number/2WLCILAE4ZB72KHVAFAOEQE7L3/graph.json","fetch_events":"https://pith.science/api/pith-number/2WLCILAE4ZB72KHVAFAOEQE7L3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3/action/storage_attestation","attest_author":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3/action/author_attestation","sign_citation":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3/action/citation_signature","submit_replication":"https://pith.science/pith/2WLCILAE4ZB72KHVAFAOEQE7L3/action/replication_record"}},"created_at":"2026-06-03T23:06:35.281654+00:00","updated_at":"2026-06-03T23:06:35.281654+00:00"}