{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P3SSXISMIMPSPZZIQ5VPXUCXDI","short_pith_number":"pith:P3SSXISM","canonical_record":{"source":{"id":"1211.2713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T17:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"685d5886f77606fa737c7186c4350d2a41c9c94b2b09ebcd39f2b10abc9c9942","abstract_canon_sha256":"26e500bebe4c01d15c10bb9fb4456932a02695e03e3b8a26a1915fa269d43ead"},"schema_version":"1.0"},"canonical_sha256":"7ee52ba24c431f27e728876afbd0571a042e2ddb050315098f7f1bd8d859bc0d","source":{"kind":"arxiv","id":"1211.2713","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2713","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2713v2","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2713","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"P3SSXISMIMPS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P3SSXISMIMPSPZZI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P3SSXISM","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P3SSXISMIMPSPZZIQ5VPXUCXDI","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T17:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"685d5886f77606fa737c7186c4350d2a41c9c94b2b09ebcd39f2b10abc9c9942","abstract_canon_sha256":"26e500bebe4c01d15c10bb9fb4456932a02695e03e3b8a26a1915fa269d43ead"},"schema_version":"1.0"},"canonical_sha256":"7ee52ba24c431f27e728876afbd0571a042e2ddb050315098f7f1bd8d859bc0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:03.855569Z","signature_b64":"pCxkCGY9uoyY4tDXkqlhRvfNiE6myDHPsL1skgW+WbW2cp3FTtaGGCtBR5ecknCvA0RNtnyXuB33Y6cHf4i+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ee52ba24c431f27e728876afbd0571a042e2ddb050315098f7f1bd8d859bc0d","last_reissued_at":"2026-05-18T03:29:03.854954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:03.854954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2713","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:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CayL+q33hQOS/EqLDPIE4Fps5Mnl7ZF8UagBzeDG5jKGZiokG7orMVrDPAk1wBUMWkPhWOgWPZ4GyGKG/CxXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:14.462747Z"},"content_sha256":"cff7e8ad233a6f29adedab7ce1301276cc7cc552d3bb6570ecb67b06db18d8a3","schema_version":"1.0","event_id":"sha256:cff7e8ad233a6f29adedab7ce1301276cc7cc552d3bb6570ecb67b06db18d8a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P3SSXISMIMPSPZZIQ5VPXUCXDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Row Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gary L. Miller, Mu Li, Richard Peng","submitted_at":"2012-11-12T17:58:38Z","abstract_excerpt":"There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms find shorter equivalent of a n*d matrix where n >> d, which allows one to solve a poly(d) sized problem instead. In practice, the best performances are often obtained by invoking these routines in an iterative fashion. We show these iterative methods can be adapted to give theoretical guarantees comparable and better than the current state of the art.\n  Our approaches are based on computing the importances of the rows, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2713","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:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvyC9y2o4pvAKZEn1MgGNkwSUSRTP6UlT+7Qk9VnuwEkmgtQ5sN4tKaiTNWqUUpRvuxo0aeqBcqrOs2XGivKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:14.463428Z"},"content_sha256":"4ac9693dd48b40c938b64ed396b45e90cfa88a099136cd2bb0f00c137723b20f","schema_version":"1.0","event_id":"sha256:4ac9693dd48b40c938b64ed396b45e90cfa88a099136cd2bb0f00c137723b20f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/bundle.json","state_url":"https://pith.science/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/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-25T19:52:14Z","links":{"resolver":"https://pith.science/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI","bundle":"https://pith.science/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/bundle.json","state":"https://pith.science/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3SSXISMIMPSPZZIQ5VPXUCXDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P3SSXISMIMPSPZZIQ5VPXUCXDI","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":"26e500bebe4c01d15c10bb9fb4456932a02695e03e3b8a26a1915fa269d43ead","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T17:58:38Z","title_canon_sha256":"685d5886f77606fa737c7186c4350d2a41c9c94b2b09ebcd39f2b10abc9c9942"},"schema_version":"1.0","source":{"id":"1211.2713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2713","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2713v2","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2713","created_at":"2026-05-18T03:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"P3SSXISMIMPS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P3SSXISMIMPSPZZI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P3SSXISM","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:4ac9693dd48b40c938b64ed396b45e90cfa88a099136cd2bb0f00c137723b20f","target":"graph","created_at":"2026-05-18T03:29:03Z","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":"There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms find shorter equivalent of a n*d matrix where n >> d, which allows one to solve a poly(d) sized problem instead. In practice, the best performances are often obtained by invoking these routines in an iterative fashion. We show these iterative methods can be adapted to give theoretical guarantees comparable and better than the current state of the art.\n  Our approaches are based on computing the importances of the rows, ","authors_text":"Gary L. Miller, Mu Li, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T17:58:38Z","title":"Iterative Row Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2713","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:cff7e8ad233a6f29adedab7ce1301276cc7cc552d3bb6570ecb67b06db18d8a3","target":"record","created_at":"2026-05-18T03:29:03Z","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":"26e500bebe4c01d15c10bb9fb4456932a02695e03e3b8a26a1915fa269d43ead","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T17:58:38Z","title_canon_sha256":"685d5886f77606fa737c7186c4350d2a41c9c94b2b09ebcd39f2b10abc9c9942"},"schema_version":"1.0","source":{"id":"1211.2713","kind":"arxiv","version":2}},"canonical_sha256":"7ee52ba24c431f27e728876afbd0571a042e2ddb050315098f7f1bd8d859bc0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ee52ba24c431f27e728876afbd0571a042e2ddb050315098f7f1bd8d859bc0d","first_computed_at":"2026-05-18T03:29:03.854954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:03.854954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pCxkCGY9uoyY4tDXkqlhRvfNiE6myDHPsL1skgW+WbW2cp3FTtaGGCtBR5ecknCvA0RNtnyXuB33Y6cHf4i+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:03.855569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cff7e8ad233a6f29adedab7ce1301276cc7cc552d3bb6570ecb67b06db18d8a3","sha256:4ac9693dd48b40c938b64ed396b45e90cfa88a099136cd2bb0f00c137723b20f"],"state_sha256":"315b02c6aeebc6fa8d371f2dddd3cc66e6943f84f4f1eb84182b3a08d5259c37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EoQj6bREgbAGRceYwAi/MqXwWjHUGm3PkflAhQCocZs6Q+X5s2NHdRSL/pbgp1A/qbdva/NzpQOdInpX6HUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:52:14.467505Z","bundle_sha256":"45052ea7db9cc26fb395755105496d041a9ce49b126072bd3f13ef605586a36d"}}