{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5ZHDCMFS3MONGA3MT57XT4KGC4","short_pith_number":"pith:5ZHDCMFS","schema_version":"1.0","canonical_sha256":"ee4e3130b2db1cd3036c9f7f79f1461707b742060e23e0b85560f2ec69e90a81","source":{"kind":"arxiv","id":"1105.0011","version":1},"attestation_state":"computed","paper":{"title":"Optimized Spline Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Ali Ayremlou, Arash Amini, Farrokh Marvasti, Ramtin Madani","submitted_at":"2011-04-29T20:05:52Z","abstract_excerpt":"In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite dimensional linear case, and then find the optimum compact support function that best approximates a given filter in the least square sense (l2 norm). The benefit of compact support interpolants is the low computational complexity in the interpolation process while the optimum compact support interpolant gaurantees the highest achivable Signal to Noise Ratio"},"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":"1105.0011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-04-29T20:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"4bedca88d259078799f786c621c44ada0c2026f6f11169dbbdb4c35e67f21751","abstract_canon_sha256":"29eaa3021d4f6d3c274e771b7e49dcd90a437afda5785d5135654740655b53fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:12.705883Z","signature_b64":"Eu02vpWK+iODG9xdfg2T1dUcZQigx4IiLJCszLjBrklM9DPGylPzhNMMTx5Uaxum7vU+JS4LgQE+SLJwMY8UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4e3130b2db1cd3036c9f7f79f1461707b742060e23e0b85560f2ec69e90a81","last_reissued_at":"2026-05-18T04:23:12.705256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:12.705256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized Spline Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Ali Ayremlou, Arash Amini, Farrokh Marvasti, Ramtin Madani","submitted_at":"2011-04-29T20:05:52Z","abstract_excerpt":"In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite dimensional linear case, and then find the optimum compact support function that best approximates a given filter in the least square sense (l2 norm). The benefit of compact support interpolants is the low computational complexity in the interpolation process while the optimum compact support interpolant gaurantees the highest achivable Signal to Noise Ratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0011","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":""},"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":"1105.0011","created_at":"2026-05-18T04:23:12.705370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0011v1","created_at":"2026-05-18T04:23:12.705370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0011","created_at":"2026-05-18T04:23:12.705370+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZHDCMFS3MON","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZHDCMFS3MONGA3M","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZHDCMFS","created_at":"2026-05-18T12:26:22.705136+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/5ZHDCMFS3MONGA3MT57XT4KGC4","json":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4.json","graph_json":"https://pith.science/api/pith-number/5ZHDCMFS3MONGA3MT57XT4KGC4/graph.json","events_json":"https://pith.science/api/pith-number/5ZHDCMFS3MONGA3MT57XT4KGC4/events.json","paper":"https://pith.science/paper/5ZHDCMFS"},"agent_actions":{"view_html":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4","download_json":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4.json","view_paper":"https://pith.science/paper/5ZHDCMFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0011&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZHDCMFS3MONGA3MT57XT4KGC4/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZHDCMFS3MONGA3MT57XT4KGC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4/action/storage_attestation","attest_author":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4/action/author_attestation","sign_citation":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4/action/citation_signature","submit_replication":"https://pith.science/pith/5ZHDCMFS3MONGA3MT57XT4KGC4/action/replication_record"}},"created_at":"2026-05-18T04:23:12.705370+00:00","updated_at":"2026-05-18T04:23:12.705370+00:00"}