{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:33BOP2XWGHWBTLRG3UHAI3C7DS","short_pith_number":"pith:33BOP2XW","canonical_record":{"source":{"id":"1207.4684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eaaae3a67274572e9684302bba95bf716356cc85e6d6c742a3563eabfd477aea","abstract_canon_sha256":"6e41f2d2ebd9c17708e6d25387dddb0aec024745315d569e91f005e7fe135e00"},"schema_version":"1.0"},"canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","source":{"kind":"arxiv","id":"1207.4684","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4684","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4684v3","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4684","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"33BOP2XWGHWB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33BOP2XWGHWBTLRG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33BOP2XW","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:33BOP2XWGHWBTLRG3UHAI3C7DS","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eaaae3a67274572e9684302bba95bf716356cc85e6d6c742a3563eabfd477aea","abstract_canon_sha256":"6e41f2d2ebd9c17708e6d25387dddb0aec024745315d569e91f005e7fe135e00"},"schema_version":"1.0"},"canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.289383Z","signature_b64":"lotiQbePHCe8SxH3g6Z0lWC5H3XlKwJw6ndUNNB+FnzHpQjUl0pbfpGb0B5HkOwZ0X5RadXkt960tPg3LRobCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","last_reissued_at":"2026-05-18T02:54:47.288990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.288990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4684","source_version":3,"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-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5yCP1vf5i0iMDblpXdxAoz4hg/J8sioqb3a4o3WUuc/9NhAqoHVvwX45BU2kOaDyfWzyS3bjf+40iLjPGD7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:23:17.860694Z"},"content_sha256":"def20e92de263a40beac850d74e5df0cc90d4d26ac3b1a3d0778899c1ce8bc6f","schema_version":"1.0","event_id":"sha256:def20e92de263a40beac850d74e5df0cc90d4d26ac3b1a3d0778899c1ce8bc6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:33BOP2XWGHWBTLRG3UHAI3C7DS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Fast Cauchy Transform and Faster Robust Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Kenneth L. Clarkson, Malik Magdon-Ismail, Michael W. Mahoney, Petros Drineas, Xiangrui Meng","submitted_at":"2012-07-19T14:26:05Z","abstract_excerpt":"We provide fast algorithms for overconstrained $\\ell_p$ regression and related problems: for an $n\\times d$ input matrix $A$ and vector $b\\in\\mathbb{R}^n$, in $O(nd\\log n)$ time we reduce the problem $\\min_{x\\in\\mathbb{R}^d} \\|Ax-b\\|_p$ to the same problem with input matrix $\\tilde A$ of dimension $s \\times d$ and corresponding $\\tilde b$ of dimension $s\\times 1$. Here, $\\tilde A$ and $\\tilde b$ are a coreset for the problem, consisting of sampled and rescaled rows of $A$ and $b$; and $s$ is independent of $n$ and polynomial in $d$. Our results improve on the best previous algorithms when $n\\g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4684","kind":"arxiv","version":3},"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-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2khLs0Q/AYUD5ZirtLboYni/ZtySWHMZjtbbZENp5UObmMIXAQXMu01FUBZ1aODukrQBQyvxZZLzxtX826zCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:23:17.861430Z"},"content_sha256":"2d595007d5cad84142e69c853934c1b252a037e28513b8ee7862da5f7bd74ad1","schema_version":"1.0","event_id":"sha256:2d595007d5cad84142e69c853934c1b252a037e28513b8ee7862da5f7bd74ad1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/bundle.json","state_url":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/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-05-25T14:23:17Z","links":{"resolver":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS","bundle":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/bundle.json","state":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:33BOP2XWGHWBTLRG3UHAI3C7DS","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":"6e41f2d2ebd9c17708e6d25387dddb0aec024745315d569e91f005e7fe135e00","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","title_canon_sha256":"eaaae3a67274572e9684302bba95bf716356cc85e6d6c742a3563eabfd477aea"},"schema_version":"1.0","source":{"id":"1207.4684","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4684","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4684v3","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4684","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"33BOP2XWGHWB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33BOP2XWGHWBTLRG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33BOP2XW","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:2d595007d5cad84142e69c853934c1b252a037e28513b8ee7862da5f7bd74ad1","target":"graph","created_at":"2026-05-18T02:54:47Z","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":"We provide fast algorithms for overconstrained $\\ell_p$ regression and related problems: for an $n\\times d$ input matrix $A$ and vector $b\\in\\mathbb{R}^n$, in $O(nd\\log n)$ time we reduce the problem $\\min_{x\\in\\mathbb{R}^d} \\|Ax-b\\|_p$ to the same problem with input matrix $\\tilde A$ of dimension $s \\times d$ and corresponding $\\tilde b$ of dimension $s\\times 1$. Here, $\\tilde A$ and $\\tilde b$ are a coreset for the problem, consisting of sampled and rescaled rows of $A$ and $b$; and $s$ is independent of $n$ and polynomial in $d$. Our results improve on the best previous algorithms when $n\\g","authors_text":"David P. Woodruff, Kenneth L. Clarkson, Malik Magdon-Ismail, Michael W. Mahoney, Petros Drineas, Xiangrui Meng","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","title":"The Fast Cauchy Transform and Faster Robust Linear Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4684","kind":"arxiv","version":3},"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:def20e92de263a40beac850d74e5df0cc90d4d26ac3b1a3d0778899c1ce8bc6f","target":"record","created_at":"2026-05-18T02:54:47Z","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":"6e41f2d2ebd9c17708e6d25387dddb0aec024745315d569e91f005e7fe135e00","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","title_canon_sha256":"eaaae3a67274572e9684302bba95bf716356cc85e6d6c742a3563eabfd477aea"},"schema_version":"1.0","source":{"id":"1207.4684","kind":"arxiv","version":3}},"canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","first_computed_at":"2026-05-18T02:54:47.288990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:47.288990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lotiQbePHCe8SxH3g6Z0lWC5H3XlKwJw6ndUNNB+FnzHpQjUl0pbfpGb0B5HkOwZ0X5RadXkt960tPg3LRobCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:47.289383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4684","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def20e92de263a40beac850d74e5df0cc90d4d26ac3b1a3d0778899c1ce8bc6f","sha256:2d595007d5cad84142e69c853934c1b252a037e28513b8ee7862da5f7bd74ad1"],"state_sha256":"eb30480502b7215a6e5190ed1d2c69f11127d685521f79bea0b32154fc370763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Re/2weGydESeNZJN7DIpREoZoqMMXt9tRI9lJ2N7bJPwshxi95t+5VA6VyXRLgR8P5suQr3XD3yjuTzHzXG5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:23:17.866086Z","bundle_sha256":"fbd28005e91ad6bd26ddc1c10e33b0e17ee81be025847fe39f38a3471f79bd8b"}}