{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LV7DRL6FWXCCH5IWCI5F3QP2QE","short_pith_number":"pith:LV7DRL6F","canonical_record":{"source":{"id":"1708.07821","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T17:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"482771cc0fd1722f40debcb1e926382aad9b411d74567eacb19e75e88cdffac0","abstract_canon_sha256":"bbcf71c0eb3633cad35fb7de10236f68f8bffb40ef6d5a6efb704d0f7a82756f"},"schema_version":"1.0"},"canonical_sha256":"5d7e38afc5b5c423f516123a5dc1fa813e6b62bd105f5d56ec5361b18fc45124","source":{"kind":"arxiv","id":"1708.07821","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07821","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07821v3","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07821","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"LV7DRL6FWXCC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LV7DRL6FWXCCH5IW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LV7DRL6F","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LV7DRL6FWXCCH5IWCI5F3QP2QE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07821","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T17:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"482771cc0fd1722f40debcb1e926382aad9b411d74567eacb19e75e88cdffac0","abstract_canon_sha256":"bbcf71c0eb3633cad35fb7de10236f68f8bffb40ef6d5a6efb704d0f7a82756f"},"schema_version":"1.0"},"canonical_sha256":"5d7e38afc5b5c423f516123a5dc1fa813e6b62bd105f5d56ec5361b18fc45124","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:28.794908Z","signature_b64":"Fe2DO1MWIgQgUjG6Yx/aUk5bonkZt6lBQBrDvyR2H9huCf7F6oDtM23SwKjoixgl7QhD3pONWnRzsE6Bmb3xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7e38afc5b5c423f516123a5dc1fa813e6b62bd105f5d56ec5361b18fc45124","last_reissued_at":"2026-05-18T00:14:28.794200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:28.794200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07821","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-18T00:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2LEJbM4OrsuFzAYy2bqOXasrr4LqtGr7sB8QLj2wXB2S7SIsSWLIhw6C4tSEh0/UGFi04fUq3KJhsteAatSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:21:47.655742Z"},"content_sha256":"9ef2b0336fee859412fccf74b4b0ff776750112c86b1dedb4b2f008454d4766e","schema_version":"1.0","event_id":"sha256:9ef2b0336fee859412fccf74b4b0ff776750112c86b1dedb4b2f008454d4766e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LV7DRL6FWXCCH5IWCI5F3QP2QE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Durfee, Kevin A. Lai, Saurabh Sawlani","submitted_at":"2017-08-25T17:44:37Z","abstract_excerpt":"We present preconditioned stochastic gradient descent (SGD) algorithms for the $\\ell_1$ minimization problem $\\min_{x}\\|A x - b\\|_1$ in the overdetermined case, where there are far more constraints than variables. Specifically, we have $A \\in \\mathbb{R}^{n \\times d}$ for $n \\gg d$. Commonly known as the Least Absolute Deviations problem, $\\ell_1$ regression can be used to solve many important combinatorial problems, such as minimum cut and shortest path. SGD-based algorithms are appealing for their simplicity and practical efficiency. Our primary insight is that careful preprocessing can yield"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07821","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-18T00:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6/darrXC3/chXNJgVrCXrJVh1LJTUAbNWEM271wuNQo4kBT+7EgvkJ684WXpugF9L49zEekfht0e9PdtNF6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:21:47.656446Z"},"content_sha256":"334de9ee7c12c928c0c8bfbc10caf728209480fae1f31fcc1756fc1b34ff180e","schema_version":"1.0","event_id":"sha256:334de9ee7c12c928c0c8bfbc10caf728209480fae1f31fcc1756fc1b34ff180e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/bundle.json","state_url":"https://pith.science/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/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-26T13:21:47Z","links":{"resolver":"https://pith.science/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE","bundle":"https://pith.science/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/bundle.json","state":"https://pith.science/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LV7DRL6FWXCCH5IWCI5F3QP2QE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LV7DRL6FWXCCH5IWCI5F3QP2QE","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":"bbcf71c0eb3633cad35fb7de10236f68f8bffb40ef6d5a6efb704d0f7a82756f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T17:44:37Z","title_canon_sha256":"482771cc0fd1722f40debcb1e926382aad9b411d74567eacb19e75e88cdffac0"},"schema_version":"1.0","source":{"id":"1708.07821","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07821","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07821v3","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07821","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"LV7DRL6FWXCC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LV7DRL6FWXCCH5IW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LV7DRL6F","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:334de9ee7c12c928c0c8bfbc10caf728209480fae1f31fcc1756fc1b34ff180e","target":"graph","created_at":"2026-05-18T00:14:28Z","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 present preconditioned stochastic gradient descent (SGD) algorithms for the $\\ell_1$ minimization problem $\\min_{x}\\|A x - b\\|_1$ in the overdetermined case, where there are far more constraints than variables. Specifically, we have $A \\in \\mathbb{R}^{n \\times d}$ for $n \\gg d$. Commonly known as the Least Absolute Deviations problem, $\\ell_1$ regression can be used to solve many important combinatorial problems, such as minimum cut and shortest path. SGD-based algorithms are appealing for their simplicity and practical efficiency. Our primary insight is that careful preprocessing can yield","authors_text":"David Durfee, Kevin A. Lai, Saurabh Sawlani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T17:44:37Z","title":"$\\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07821","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:9ef2b0336fee859412fccf74b4b0ff776750112c86b1dedb4b2f008454d4766e","target":"record","created_at":"2026-05-18T00:14:28Z","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":"bbcf71c0eb3633cad35fb7de10236f68f8bffb40ef6d5a6efb704d0f7a82756f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T17:44:37Z","title_canon_sha256":"482771cc0fd1722f40debcb1e926382aad9b411d74567eacb19e75e88cdffac0"},"schema_version":"1.0","source":{"id":"1708.07821","kind":"arxiv","version":3}},"canonical_sha256":"5d7e38afc5b5c423f516123a5dc1fa813e6b62bd105f5d56ec5361b18fc45124","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d7e38afc5b5c423f516123a5dc1fa813e6b62bd105f5d56ec5361b18fc45124","first_computed_at":"2026-05-18T00:14:28.794200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:28.794200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fe2DO1MWIgQgUjG6Yx/aUk5bonkZt6lBQBrDvyR2H9huCf7F6oDtM23SwKjoixgl7QhD3pONWnRzsE6Bmb3xBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:28.794908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07821","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ef2b0336fee859412fccf74b4b0ff776750112c86b1dedb4b2f008454d4766e","sha256:334de9ee7c12c928c0c8bfbc10caf728209480fae1f31fcc1756fc1b34ff180e"],"state_sha256":"2ce66dc83cdb3eedf053254a498d5eb5f9ba51949b5f1a5fe58dae7788c8ac78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TM7dQ3Ow+XQoH29xq6RIANGcxwNdQmIXxE/3gy2ijL0+DjD4jxuM9e2jjsFoH4i93l9r2G2EHC+Z9zpWvdZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:21:47.659845Z","bundle_sha256":"6bc3edd7c3c06b851d748aaf62ef667409c79c2d2fe68717d10b52dc918ee814"}}