{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FV5XUHX3OXEZD73YITEDAS7XRX","short_pith_number":"pith:FV5XUHX3","canonical_record":{"source":{"id":"1312.6677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"f143678c656e1b3965dd11c7e3ec9610ef7f68a87b4731c4e2937d7f55487a96","abstract_canon_sha256":"a8828a70de1e8cab844f6a2ab396d08a904342468de7f6e11fd36f54744b4e49"},"schema_version":"1.0"},"canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","source":{"kind":"arxiv","id":"1312.6677","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6677","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6677v3","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6677","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"FV5XUHX3OXEZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FV5XUHX3OXEZD73Y","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FV5XUHX3","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FV5XUHX3OXEZD73YITEDAS7XRX","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"f143678c656e1b3965dd11c7e3ec9610ef7f68a87b4731c4e2937d7f55487a96","abstract_canon_sha256":"a8828a70de1e8cab844f6a2ab396d08a904342468de7f6e11fd36f54744b4e49"},"schema_version":"1.0"},"canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.253299Z","signature_b64":"JigxB0BmKlrCHLgDIgg3fDuVclm9p1EylQoHoz/PyC2zZvPn+0s6a5+fI4APdrLAS58jIw2itnVAOUftZxBFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","last_reissued_at":"2026-05-18T02:25:34.252909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.252909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6677","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:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6920OXvczzP6y5TEhg9G0Uq66+hjTL80Gm2wnoPvrBdXOY66OwGwCNy/iIOqfRdlIty1cMkJDIGurA0TOXG2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:36:45.302822Z"},"content_sha256":"019c3de2f5371b6929e8b845f5edc3e71412952af8d298ea6a33da35730333da","schema_version":"1.0","event_id":"sha256:019c3de2f5371b6929e8b845f5edc3e71412952af8d298ea6a33da35730333da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FV5XUHX3OXEZD73YITEDAS7XRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2013-12-23T20:54:43Z","abstract_excerpt":"In this paper we present a new algorithm for solving linear programs that requires only $\\tilde{O}(\\sqrt{rank(A)}L)$ iterations to solve a linear program with $m$ constraints, $n$ variables, and constraint matrix $A$, and bit complexity $L$. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation.\n  Our method improves upon the previous best iteration bound by factor of $\\tilde{\\Omega}((m/rank(A))^{1/4})$ for methods with polynomial time computable iterations and by $\\tilde{\\Omega}((m/rank(A))^{1/2})$ for methods which solve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6677","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:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0EOnFie/42XoqpnvRRA/61AzHE7RvNl9t3KX1MQKCwrMozq2fQl/w9kALW44sP+dwP+xJfy+hQkb+RGStSsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:36:45.303308Z"},"content_sha256":"92cd8485d9da4f072b21820bda3b26b4d61a4f130574a4d43d376990aeadf28e","schema_version":"1.0","event_id":"sha256:92cd8485d9da4f072b21820bda3b26b4d61a4f130574a4d43d376990aeadf28e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/bundle.json","state_url":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FV5XUHX3OXEZD73YITEDAS7XRX/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-08-08T18:36:45Z","links":{"resolver":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX","bundle":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/bundle.json","state":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FV5XUHX3OXEZD73YITEDAS7XRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FV5XUHX3OXEZD73YITEDAS7XRX","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":"a8828a70de1e8cab844f6a2ab396d08a904342468de7f6e11fd36f54744b4e49","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","title_canon_sha256":"f143678c656e1b3965dd11c7e3ec9610ef7f68a87b4731c4e2937d7f55487a96"},"schema_version":"1.0","source":{"id":"1312.6677","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6677","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6677v3","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6677","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"FV5XUHX3OXEZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FV5XUHX3OXEZD73Y","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FV5XUHX3","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:92cd8485d9da4f072b21820bda3b26b4d61a4f130574a4d43d376990aeadf28e","target":"graph","created_at":"2026-05-18T02:25:34Z","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":"In this paper we present a new algorithm for solving linear programs that requires only $\\tilde{O}(\\sqrt{rank(A)}L)$ iterations to solve a linear program with $m$ constraints, $n$ variables, and constraint matrix $A$, and bit complexity $L$. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation.\n  Our method improves upon the previous best iteration bound by factor of $\\tilde{\\Omega}((m/rank(A))^{1/4})$ for methods with polynomial time computable iterations and by $\\tilde{\\Omega}((m/rank(A))^{1/2})$ for methods which solve ","authors_text":"Aaron Sidford, Yin Tat Lee","cross_cats":["math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6677","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:019c3de2f5371b6929e8b845f5edc3e71412952af8d298ea6a33da35730333da","target":"record","created_at":"2026-05-18T02:25:34Z","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":"a8828a70de1e8cab844f6a2ab396d08a904342468de7f6e11fd36f54744b4e49","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","title_canon_sha256":"f143678c656e1b3965dd11c7e3ec9610ef7f68a87b4731c4e2937d7f55487a96"},"schema_version":"1.0","source":{"id":"1312.6677","kind":"arxiv","version":3}},"canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","first_computed_at":"2026-05-18T02:25:34.252909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.252909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JigxB0BmKlrCHLgDIgg3fDuVclm9p1EylQoHoz/PyC2zZvPn+0s6a5+fI4APdrLAS58jIw2itnVAOUftZxBFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.253299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6677","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:019c3de2f5371b6929e8b845f5edc3e71412952af8d298ea6a33da35730333da","sha256:92cd8485d9da4f072b21820bda3b26b4d61a4f130574a4d43d376990aeadf28e"],"state_sha256":"fbcd16c3329dfd5aad162b89374a92f46a0ad1467955a8585de34b7a045abb75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXRlYx/QtrdcuKu8oJcbXqe7d+xa2r3+hl7gAe7QNgou9I/NzLIRWAGTwyPmMItoxNCXFnarCOaFf8Q/7AmCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T18:36:45.306839Z","bundle_sha256":"8481f9f2c3777891295a421e5233ff808c2fc1894c464ca65b78f4a8b1d72411"}}