{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UH2ELDZ6P6HDD4XKW3NGGQHHE4","short_pith_number":"pith:UH2ELDZ6","schema_version":"1.0","canonical_sha256":"a1f4458f3e7f8e31f2eab6da6340e7271dadd81652a32fa4396a1a920ceab857","source":{"kind":"arxiv","id":"1301.2831","version":1},"attestation_state":"computed","paper":{"title":"Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Anders C. Hansen, Ben Adcock, Clarice Poon","submitted_at":"2013-01-13T22:17:01Z","abstract_excerpt":"Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with respect to an arbitrary frame. Unlike more common approaches for this problem, such as the consistent reconstruction technique of Eldar et al, it leads to completely stable numerical methods possessing both guaranteed stability and accuracy.\n  The purpose of this paper is twofold. First, we give a complete and formal analysis of generalized sampling, the main res"},"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":"1301.2831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-13T22:17:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"52c47d1f08331a590d8aad74d45f2f283c18adfe6a9119d86f267e29ea0c7b64","abstract_canon_sha256":"def03651e741cb2f3bb7f1392183cbea115ed189a8060117578ae58cc8f3bf0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:35.059700Z","signature_b64":"+PZc+xqp4i3Xo6t6qEQXGlip8Fc/dyVQOGSN2y8Cuud3ewj1/98DEM4KYghQ+ydeTFA7JrnoE3oe7GG9Bkz1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f4458f3e7f8e31f2eab6da6340e7271dadd81652a32fa4396a1a920ceab857","last_reissued_at":"2026-05-18T03:36:35.059101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:35.059101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Anders C. Hansen, Ben Adcock, Clarice Poon","submitted_at":"2013-01-13T22:17:01Z","abstract_excerpt":"Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with respect to an arbitrary frame. Unlike more common approaches for this problem, such as the consistent reconstruction technique of Eldar et al, it leads to completely stable numerical methods possessing both guaranteed stability and accuracy.\n  The purpose of this paper is twofold. First, we give a complete and formal analysis of generalized sampling, the main res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2831","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":"1301.2831","created_at":"2026-05-18T03:36:35.059200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2831v1","created_at":"2026-05-18T03:36:35.059200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2831","created_at":"2026-05-18T03:36:35.059200+00:00"},{"alias_kind":"pith_short_12","alias_value":"UH2ELDZ6P6HD","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UH2ELDZ6P6HDD4XK","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UH2ELDZ6","created_at":"2026-05-18T12:28:02.375192+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/UH2ELDZ6P6HDD4XKW3NGGQHHE4","json":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4.json","graph_json":"https://pith.science/api/pith-number/UH2ELDZ6P6HDD4XKW3NGGQHHE4/graph.json","events_json":"https://pith.science/api/pith-number/UH2ELDZ6P6HDD4XKW3NGGQHHE4/events.json","paper":"https://pith.science/paper/UH2ELDZ6"},"agent_actions":{"view_html":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4","download_json":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4.json","view_paper":"https://pith.science/paper/UH2ELDZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2831&json=true","fetch_graph":"https://pith.science/api/pith-number/UH2ELDZ6P6HDD4XKW3NGGQHHE4/graph.json","fetch_events":"https://pith.science/api/pith-number/UH2ELDZ6P6HDD4XKW3NGGQHHE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4/action/storage_attestation","attest_author":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4/action/author_attestation","sign_citation":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4/action/citation_signature","submit_replication":"https://pith.science/pith/UH2ELDZ6P6HDD4XKW3NGGQHHE4/action/replication_record"}},"created_at":"2026-05-18T03:36:35.059200+00:00","updated_at":"2026-05-18T03:36:35.059200+00:00"}