{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6SSXS4PYSR4AUXGEVBBR5Z544U","short_pith_number":"pith:6SSXS4PY","schema_version":"1.0","canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","source":{"kind":"arxiv","id":"1410.7530","version":1},"attestation_state":"computed","paper":{"title":"Random-Facet and Random-Bland require subexponential time even for shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick","submitted_at":"2014-10-28T06:47:55Z","abstract_excerpt":"The Random-Facet algorithm of Kalai and of Matousek, Sharir and Welzl is an elegant randomized algorithm for solving linear programs and more general LP-type problems. Its expected subexponential time of $2^{\\tilde{O}(\\sqrt{m})}$, where $m$ is the number of inequalities, makes it the fastest known combinatorial algorithm for solving linear programs. We previously showed that Random-Facet performs an expected number of $2^{\\tilde{\\Omega}(\\sqrt[3]{m})}$ pivoting steps on some LPs with $m$ inequalities that correspond to $m$-action Markov Decision Processes (MDPs). We also showed that Random-Face"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.7530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T06:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"0b25ea8f1f944434f171921a1ea2d218c2e88a6679af1bc2e0ac20787aebf389","abstract_canon_sha256":"6415b803091656ca32982bd2cd6c8f5f9a51c7b398719304fbb66c3080f36947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:10.119872Z","signature_b64":"jK+lbl8rKifYXHjLQE4n4Vr7/rT4OhstlmJFdX4RqOn0YFllhDH7jAMW4jw8u+QFTiyFKkRiVVLlcWyegfs+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","last_reissued_at":"2026-05-18T02:39:10.119113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:10.119113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random-Facet and Random-Bland require subexponential time even for shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick","submitted_at":"2014-10-28T06:47:55Z","abstract_excerpt":"The Random-Facet algorithm of Kalai and of Matousek, Sharir and Welzl is an elegant randomized algorithm for solving linear programs and more general LP-type problems. Its expected subexponential time of $2^{\\tilde{O}(\\sqrt{m})}$, where $m$ is the number of inequalities, makes it the fastest known combinatorial algorithm for solving linear programs. We previously showed that Random-Facet performs an expected number of $2^{\\tilde{\\Omega}(\\sqrt[3]{m})}$ pivoting steps on some LPs with $m$ inequalities that correspond to $m$-action Markov Decision Processes (MDPs). We also showed that Random-Face"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7530","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.7530","created_at":"2026-05-18T02:39:10.119241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7530v1","created_at":"2026-05-18T02:39:10.119241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7530","created_at":"2026-05-18T02:39:10.119241+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SSXS4PYSR4A","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SSXS4PYSR4AUXGE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SSXS4PY","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U","json":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U.json","graph_json":"https://pith.science/api/pith-number/6SSXS4PYSR4AUXGEVBBR5Z544U/graph.json","events_json":"https://pith.science/api/pith-number/6SSXS4PYSR4AUXGEVBBR5Z544U/events.json","paper":"https://pith.science/paper/6SSXS4PY"},"agent_actions":{"view_html":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U","download_json":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U.json","view_paper":"https://pith.science/paper/6SSXS4PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7530&json=true","fetch_graph":"https://pith.science/api/pith-number/6SSXS4PYSR4AUXGEVBBR5Z544U/graph.json","fetch_events":"https://pith.science/api/pith-number/6SSXS4PYSR4AUXGEVBBR5Z544U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/action/storage_attestation","attest_author":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/action/author_attestation","sign_citation":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/action/citation_signature","submit_replication":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/action/replication_record"}},"created_at":"2026-05-18T02:39:10.119241+00:00","updated_at":"2026-05-18T02:39:10.119241+00:00"}