{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OET7DDHU77AKFFY25MEIEBGQSK","short_pith_number":"pith:OET7DDHU","canonical_record":{"source":{"id":"1110.4193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-19T06:36:02Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"eca4d03edc1a9cc69226f3b0b47c68a9de1be8697e09c5f9846252d8f0f453e3","abstract_canon_sha256":"dd74101a85d2c5f7773bd000f806f7507d4f701fad5352bce23f39447357c433"},"schema_version":"1.0"},"canonical_sha256":"7127f18cf4ffc0a2971aeb088204d092aae2f8048473b0209b740b38857dbee5","source":{"kind":"arxiv","id":"1110.4193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4193","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4193v2","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4193","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"OET7DDHU77AK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OET7DDHU77AKFFY2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OET7DDHU","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OET7DDHU77AKFFY25MEIEBGQSK","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-19T06:36:02Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"eca4d03edc1a9cc69226f3b0b47c68a9de1be8697e09c5f9846252d8f0f453e3","abstract_canon_sha256":"dd74101a85d2c5f7773bd000f806f7507d4f701fad5352bce23f39447357c433"},"schema_version":"1.0"},"canonical_sha256":"7127f18cf4ffc0a2971aeb088204d092aae2f8048473b0209b740b38857dbee5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.945005Z","signature_b64":"Go0IcUm4pigEE1/iXzLHPwnUZuKb9jqrM3SupJHIYznlqplyzvO2hJrvSXP8dBXHa04SPXDo6YO7Qk7N+n+oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7127f18cf4ffc0a2971aeb088204d092aae2f8048473b0209b740b38857dbee5","last_reissued_at":"2026-05-18T03:58:13.944167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.944167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4193","source_version":2,"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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqI95gXndPu+0pILtL15EJjaAOn4dkicNQ9WESCnbQbWxKQIS8hUJJQCZUkTdq1uwBaIu4mnIeOgQ05nLzPWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:52:33.607050Z"},"content_sha256":"f3e6d74885ba4d1e85e6e635ac6aca497fb707a19a723ed0b4961e141f1791fc","schema_version":"1.0","event_id":"sha256:f3e6d74885ba4d1e85e6e635ac6aca497fb707a19a723ed0b4961e141f1791fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OET7DDHU77AKFFY25MEIEBGQSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear randomized algorithms for skeleton decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jiawei Chiu, Laurent Demanet","submitted_at":"2011-10-19T06:36:02Z","abstract_excerpt":"Let $A$ be a $n$ by $n$ matrix. A skeleton decomposition is any factorization of the form $CUR$ where $C$ comprises columns of $A$, and $R$ comprises rows of $A$. In this paper, we consider uniformly sampling $\\l\\simeq k \\log n$ rows and columns to produce a skeleton decomposition. The algorithm runs in $O(\\l^3)$ time, and has the following error guarantee. Let $\\norm{\\cdot}$ denote the 2-norm. Suppose $A\\simeq X B Y^T$ where $X,Y$ each have $k$ orthonormal columns. Assuming that $X,Y$ are incoherent, we show that with high probability, the approximation error $\\norm{A-CUR}$ will scale with $("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4193","kind":"arxiv","version":2},"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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uezm8kdDI3jhya/I2odC1A5Yqwx+9KTZkjsjs9TmML+2Y6RthI5bNx4iKx9pp40zTnfdJAA3cCP+WMhvzNroBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:52:33.607409Z"},"content_sha256":"73bd853f06f60bb0231095766e5ac5120629033f9b53df5eebb0d17ac20262af","schema_version":"1.0","event_id":"sha256:73bd853f06f60bb0231095766e5ac5120629033f9b53df5eebb0d17ac20262af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OET7DDHU77AKFFY25MEIEBGQSK/bundle.json","state_url":"https://pith.science/pith/OET7DDHU77AKFFY25MEIEBGQSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OET7DDHU77AKFFY25MEIEBGQSK/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-26T08:52:33Z","links":{"resolver":"https://pith.science/pith/OET7DDHU77AKFFY25MEIEBGQSK","bundle":"https://pith.science/pith/OET7DDHU77AKFFY25MEIEBGQSK/bundle.json","state":"https://pith.science/pith/OET7DDHU77AKFFY25MEIEBGQSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OET7DDHU77AKFFY25MEIEBGQSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OET7DDHU77AKFFY25MEIEBGQSK","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":"dd74101a85d2c5f7773bd000f806f7507d4f701fad5352bce23f39447357c433","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-19T06:36:02Z","title_canon_sha256":"eca4d03edc1a9cc69226f3b0b47c68a9de1be8697e09c5f9846252d8f0f453e3"},"schema_version":"1.0","source":{"id":"1110.4193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4193","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4193v2","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4193","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"OET7DDHU77AK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OET7DDHU77AKFFY2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OET7DDHU","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:73bd853f06f60bb0231095766e5ac5120629033f9b53df5eebb0d17ac20262af","target":"graph","created_at":"2026-05-18T03:58:13Z","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":"Let $A$ be a $n$ by $n$ matrix. A skeleton decomposition is any factorization of the form $CUR$ where $C$ comprises columns of $A$, and $R$ comprises rows of $A$. In this paper, we consider uniformly sampling $\\l\\simeq k \\log n$ rows and columns to produce a skeleton decomposition. The algorithm runs in $O(\\l^3)$ time, and has the following error guarantee. Let $\\norm{\\cdot}$ denote the 2-norm. Suppose $A\\simeq X B Y^T$ where $X,Y$ each have $k$ orthonormal columns. Assuming that $X,Y$ are incoherent, we show that with high probability, the approximation error $\\norm{A-CUR}$ will scale with $(","authors_text":"Jiawei Chiu, Laurent Demanet","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-19T06:36:02Z","title":"Sublinear randomized algorithms for skeleton decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4193","kind":"arxiv","version":2},"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:f3e6d74885ba4d1e85e6e635ac6aca497fb707a19a723ed0b4961e141f1791fc","target":"record","created_at":"2026-05-18T03:58:13Z","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":"dd74101a85d2c5f7773bd000f806f7507d4f701fad5352bce23f39447357c433","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-19T06:36:02Z","title_canon_sha256":"eca4d03edc1a9cc69226f3b0b47c68a9de1be8697e09c5f9846252d8f0f453e3"},"schema_version":"1.0","source":{"id":"1110.4193","kind":"arxiv","version":2}},"canonical_sha256":"7127f18cf4ffc0a2971aeb088204d092aae2f8048473b0209b740b38857dbee5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7127f18cf4ffc0a2971aeb088204d092aae2f8048473b0209b740b38857dbee5","first_computed_at":"2026-05-18T03:58:13.944167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:13.944167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Go0IcUm4pigEE1/iXzLHPwnUZuKb9jqrM3SupJHIYznlqplyzvO2hJrvSXP8dBXHa04SPXDo6YO7Qk7N+n+oAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:13.945005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e6d74885ba4d1e85e6e635ac6aca497fb707a19a723ed0b4961e141f1791fc","sha256:73bd853f06f60bb0231095766e5ac5120629033f9b53df5eebb0d17ac20262af"],"state_sha256":"4aa78d6b4c0ecf9448c8af4924afe629a250602d5429134f89b1b69b13abfb00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNtfONHgQixtgw0HQwS9QGH+JWKkjWqK7bg0d6AMs3wbmptyozVBm6vNYY9GUYwrCrQUM1qxFXz6Q3ofT8/0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:52:33.609389Z","bundle_sha256":"c80cb213e0fdf44c035806187e48fa3b3d2b62d173a45c5750c33b34e69dd5f8"}}