{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ESDMF7N6CU6KHD3PDNR272HVAR","short_pith_number":"pith:ESDMF7N6","canonical_record":{"source":{"id":"2509.14017","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-17T14:24:47Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d74d53c740d6358c3214b4f1047d85277f82d497b0f0201beb7bdef3ec402949","abstract_canon_sha256":"765d385bcfab198e71bd350279fbd79eb5cb68ab052a1b7e6540645c3a294fc9"},"schema_version":"1.0"},"canonical_sha256":"2486c2fdbe153ca38f6f1b63afe8f5045dbc50cb269969749d9e5dd776acfb7b","source":{"kind":"arxiv","id":"2509.14017","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.14017","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"2509.14017v4","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.14017","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"ESDMF7N6CU6K","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESDMF7N6CU6KHD3P","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESDMF7N6","created_at":"2026-06-19T16:11:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ESDMF7N6CU6KHD3PDNR272HVAR","target":"record","payload":{"canonical_record":{"source":{"id":"2509.14017","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-17T14:24:47Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d74d53c740d6358c3214b4f1047d85277f82d497b0f0201beb7bdef3ec402949","abstract_canon_sha256":"765d385bcfab198e71bd350279fbd79eb5cb68ab052a1b7e6540645c3a294fc9"},"schema_version":"1.0"},"canonical_sha256":"2486c2fdbe153ca38f6f1b63afe8f5045dbc50cb269969749d9e5dd776acfb7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:12.856469Z","signature_b64":"C56Hk5dpKTbcDrwQMEa2VWgTCErEH+z015acIOWa8N5rQ3Wonr9d3Kj6DskMA9+6DsBPEyPBIGv7fpt42sbUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2486c2fdbe153ca38f6f1b63afe8f5045dbc50cb269969749d9e5dd776acfb7b","last_reissued_at":"2026-06-19T16:11:12.856064Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:12.856064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.14017","source_version":4,"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-06-19T16:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/zwNYuKMvZ/Wdsk3x/jpXydPgFzA6EvZzMQIgaLwwKiW+V7o+BICIS/1IhtNpf7WNfSiZ0swWDKyZf+40a1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:08:06.542985Z"},"content_sha256":"d5da97c8dfec90a7dec81d0e21c429dcd728294593df9064232fb830c49421e1","schema_version":"1.0","event_id":"sha256:d5da97c8dfec90a7dec81d0e21c429dcd728294593df9064232fb830c49421e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ESDMF7N6CU6KHD3PDNR272HVAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank approximation of analytic kernels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Marcus Webb","submitted_at":"2025-09-17T14:24:47Z","abstract_excerpt":"Many algorithms in scientific computing and data science take advantage of low-rank approximation of matrices and kernels, and understanding why nearly-low-rank structure occurs is essential for their analysis and further development. This paper provides a framework for bounding the best low-rank approximation error of matrices arising from samples of a kernel that is analytically continuable in one of its variables to an open region of the complex plane. Elegantly, the low-rank approximations used in the proof are computable by rational interpolation using the roots and poles of Zolotarev rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.14017","kind":"arxiv","version":4},"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/2509.14017/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"},"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-06-19T16:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fF7Ixm/eYHJjzkyHCpuEl5iIPf4Jh/iyoMxJizGHH7pKDfCS3u4+RO+OYPzK6O4QfIzZqbGJ5QkkdRxvwMSaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:08:06.543375Z"},"content_sha256":"f8fc285017e223904ab101ed66e2abb6a2ae6e8a0024aa93c611bc68e58d3887","schema_version":"1.0","event_id":"sha256:f8fc285017e223904ab101ed66e2abb6a2ae6e8a0024aa93c611bc68e58d3887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESDMF7N6CU6KHD3PDNR272HVAR/bundle.json","state_url":"https://pith.science/pith/ESDMF7N6CU6KHD3PDNR272HVAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESDMF7N6CU6KHD3PDNR272HVAR/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-06-20T16:08:06Z","links":{"resolver":"https://pith.science/pith/ESDMF7N6CU6KHD3PDNR272HVAR","bundle":"https://pith.science/pith/ESDMF7N6CU6KHD3PDNR272HVAR/bundle.json","state":"https://pith.science/pith/ESDMF7N6CU6KHD3PDNR272HVAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESDMF7N6CU6KHD3PDNR272HVAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ESDMF7N6CU6KHD3PDNR272HVAR","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":"765d385bcfab198e71bd350279fbd79eb5cb68ab052a1b7e6540645c3a294fc9","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-17T14:24:47Z","title_canon_sha256":"d74d53c740d6358c3214b4f1047d85277f82d497b0f0201beb7bdef3ec402949"},"schema_version":"1.0","source":{"id":"2509.14017","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.14017","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"2509.14017v4","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.14017","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"ESDMF7N6CU6K","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESDMF7N6CU6KHD3P","created_at":"2026-06-19T16:11:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESDMF7N6","created_at":"2026-06-19T16:11:12Z"}],"graph_snapshots":[{"event_id":"sha256:f8fc285017e223904ab101ed66e2abb6a2ae6e8a0024aa93c611bc68e58d3887","target":"graph","created_at":"2026-06-19T16:11:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.14017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many algorithms in scientific computing and data science take advantage of low-rank approximation of matrices and kernels, and understanding why nearly-low-rank structure occurs is essential for their analysis and further development. This paper provides a framework for bounding the best low-rank approximation error of matrices arising from samples of a kernel that is analytically continuable in one of its variables to an open region of the complex plane. Elegantly, the low-rank approximations used in the proof are computable by rational interpolation using the roots and poles of Zolotarev rat","authors_text":"Marcus Webb","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-17T14:24:47Z","title":"Low-rank approximation of analytic kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.14017","kind":"arxiv","version":4},"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:d5da97c8dfec90a7dec81d0e21c429dcd728294593df9064232fb830c49421e1","target":"record","created_at":"2026-06-19T16:11:12Z","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":"765d385bcfab198e71bd350279fbd79eb5cb68ab052a1b7e6540645c3a294fc9","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-17T14:24:47Z","title_canon_sha256":"d74d53c740d6358c3214b4f1047d85277f82d497b0f0201beb7bdef3ec402949"},"schema_version":"1.0","source":{"id":"2509.14017","kind":"arxiv","version":4}},"canonical_sha256":"2486c2fdbe153ca38f6f1b63afe8f5045dbc50cb269969749d9e5dd776acfb7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2486c2fdbe153ca38f6f1b63afe8f5045dbc50cb269969749d9e5dd776acfb7b","first_computed_at":"2026-06-19T16:11:12.856064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:12.856064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C56Hk5dpKTbcDrwQMEa2VWgTCErEH+z015acIOWa8N5rQ3Wonr9d3Kj6DskMA9+6DsBPEyPBIGv7fpt42sbUCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:12.856469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.14017","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5da97c8dfec90a7dec81d0e21c429dcd728294593df9064232fb830c49421e1","sha256:f8fc285017e223904ab101ed66e2abb6a2ae6e8a0024aa93c611bc68e58d3887"],"state_sha256":"122c0087bf6c4a5c2865d507a83d04ce47187413f247d6c879651a91d79a6579"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liIX2fkbcjyqQfXa0Nc9xYh+hCkpysYpk5DChpB0q8+jOqg/3rQ10pz8arToYr3rm39tcwJX5N2zAXTj/xhFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:08:06.545343Z","bundle_sha256":"67a3b51007cdeea918d48eaeabea76d6d59cedc301869a13fe816e6e430f856c"}}