{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C5EWXCUUMRFBTPMTFSQFXDVZIN","short_pith_number":"pith:C5EWXCUU","canonical_record":{"source":{"id":"1910.08033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"73bee2703812cd8294ba6e462b4cf201fa52136d77f8ef0f9e7eb999c887e9ba","abstract_canon_sha256":"1f67cfaa214e8fe6440784957e354e4d2cb8718c5c82567529ce3b3580e543d7"},"schema_version":"1.0"},"canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","source":{"kind":"arxiv","id":"1910.08033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08033","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08033v2","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08033","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_12","alias_value":"C5EWXCUUMRFB","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"C5EWXCUUMRFBTPMT","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"C5EWXCUU","created_at":"2026-07-05T01:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C5EWXCUUMRFBTPMTFSQFXDVZIN","target":"record","payload":{"canonical_record":{"source":{"id":"1910.08033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"73bee2703812cd8294ba6e462b4cf201fa52136d77f8ef0f9e7eb999c887e9ba","abstract_canon_sha256":"1f67cfaa214e8fe6440784957e354e4d2cb8718c5c82567529ce3b3580e543d7"},"schema_version":"1.0"},"canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:49.954839Z","signature_b64":"Rku170p/AbDu0gym8hurok3pOB60siitmoNXT7IBH2oba45GiMYmqdAZVMgtbzV6rLQWCkMi8Il0Ile5S5FsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","last_reissued_at":"2026-07-05T01:31:49.954414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:49.954414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.08033","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-07-05T01:31:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zh0XeTFbylZb51gNej++Nsa4gmdDO2I872mgQZOO5ic0R9VgiS5B3C/Yegckuwb/vI04fZ+nEoLWlLOUfm3QDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T09:54:14.875091Z"},"content_sha256":"3bc6592ceb8056793691dbbab23ee024a474a64699a8c340bed74bcfa8d5dd89","schema_version":"1.0","event_id":"sha256:3bc6592ceb8056793691dbbab23ee024a474a64699a8c340bed74bcfa8d5dd89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C5EWXCUUMRFBTPMTFSQFXDVZIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2019-10-17T16:59:29Z","abstract_excerpt":"We present an algorithm that given a linear program with $n$ variables, $m$ constraints, and constraint matrix $A$, computes an $\\epsilon$-approximate solution in $\\tilde{O}(\\sqrt{rank(A)}\\log(1/\\epsilon))$ iterations with high probability. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation, improving by a factor of $\\tilde{\\Omega}((m/rank(A))^{1/2})$ over the previous fastest method with this iteration cost due to Renegar (1988). Further, we provide a deterministic polynomial time computable $\\tilde{O}(rank(A))$-self-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08033","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.08033/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-07-05T01:31:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlyS/G+65OQRz31qtjDI12V6dzRe96+i5xv06vD6WGQabmY6kTAfsz9sMgGiR5l2MFyafxkUf8bOH3mZb20PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T09:54:14.875474Z"},"content_sha256":"b46c6987f58e28a662583580975c3454e81f5b9b8f611dae0fc9c07c4c6603b4","schema_version":"1.0","event_id":"sha256:b46c6987f58e28a662583580975c3454e81f5b9b8f611dae0fc9c07c4c6603b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/bundle.json","state_url":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/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-07-14T09:54:14Z","links":{"resolver":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN","bundle":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/bundle.json","state":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C5EWXCUUMRFBTPMTFSQFXDVZIN","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":"1f67cfaa214e8fe6440784957e354e4d2cb8718c5c82567529ce3b3580e543d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","title_canon_sha256":"73bee2703812cd8294ba6e462b4cf201fa52136d77f8ef0f9e7eb999c887e9ba"},"schema_version":"1.0","source":{"id":"1910.08033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08033","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08033v2","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08033","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_12","alias_value":"C5EWXCUUMRFB","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"C5EWXCUUMRFBTPMT","created_at":"2026-07-05T01:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"C5EWXCUU","created_at":"2026-07-05T01:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b46c6987f58e28a662583580975c3454e81f5b9b8f611dae0fc9c07c4c6603b4","target":"graph","created_at":"2026-07-05T01:31:49Z","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/1910.08033/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an algorithm that given a linear program with $n$ variables, $m$ constraints, and constraint matrix $A$, computes an $\\epsilon$-approximate solution in $\\tilde{O}(\\sqrt{rank(A)}\\log(1/\\epsilon))$ iterations with high probability. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation, improving by a factor of $\\tilde{\\Omega}((m/rank(A))^{1/2})$ over the previous fastest method with this iteration cost due to Renegar (1988). Further, we provide a deterministic polynomial time computable $\\tilde{O}(rank(A))$-self-co","authors_text":"Aaron Sidford, Yin Tat Lee","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08033","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:3bc6592ceb8056793691dbbab23ee024a474a64699a8c340bed74bcfa8d5dd89","target":"record","created_at":"2026-07-05T01:31:49Z","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":"1f67cfaa214e8fe6440784957e354e4d2cb8718c5c82567529ce3b3580e543d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","title_canon_sha256":"73bee2703812cd8294ba6e462b4cf201fa52136d77f8ef0f9e7eb999c887e9ba"},"schema_version":"1.0","source":{"id":"1910.08033","kind":"arxiv","version":2}},"canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","first_computed_at":"2026-07-05T01:31:49.954414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:31:49.954414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rku170p/AbDu0gym8hurok3pOB60siitmoNXT7IBH2oba45GiMYmqdAZVMgtbzV6rLQWCkMi8Il0Ile5S5FsAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:31:49.954839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.08033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bc6592ceb8056793691dbbab23ee024a474a64699a8c340bed74bcfa8d5dd89","sha256:b46c6987f58e28a662583580975c3454e81f5b9b8f611dae0fc9c07c4c6603b4"],"state_sha256":"62f97583f9653abf8908e5b133c50509db37eef7617d4b2de9386a9093f2f5d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Ha4uHpVswqsKgZj9/0+Yeev1dnrdFtv5q+NJWpqwJ5Di6EQroWHVTO2aGZ9FuJaPm+rkITIjqsmobyS0h1bBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T09:54:14.877909Z","bundle_sha256":"f84b6b49dc7ee738bbfa59015dc0353676bac530f0ef986fdc308c1e0d3408f1"}}