{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6SSXS4PYSR4AUXGEVBBR5Z544U","short_pith_number":"pith:6SSXS4PY","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"},"canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","source":{"kind":"arxiv","id":"1410.7530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7530","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7530v1","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7530","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"6SSXS4PYSR4A","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SSXS4PYSR4AUXGE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SSXS4PY","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6SSXS4PYSR4AUXGEVBBR5Z544U","target":"record","payload":{"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"},"canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","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"},"source_kind":"arxiv","source_id":"1410.7530","source_version":1,"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:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oH50K2JmSrYF6t1kHuPU+M3WxfFFSVhcdPzq7Vv+thmjzzpAa7PBqyuCddpc/Elknc4Q5s5QsJ8go+4oE0AtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:01:19.264396Z"},"content_sha256":"3d0c3f041179314731e532c680515b50ea1ea2b923718b5676a8901d8c8b157a","schema_version":"1.0","event_id":"sha256:3d0c3f041179314731e532c680515b50ea1ea2b923718b5676a8901d8c8b157a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6SSXS4PYSR4AUXGEVBBR5Z544U","target":"graph","payload":{"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"},"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:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwfwbFsR50uOW/n+d1Iy5WpwDm6/1l83/Yug5XRwZkQcI72seZQp03V94dOO5XF7ZHGebc6u0oVxXw+43BdRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:01:19.264938Z"},"content_sha256":"d28884e4aa0604f938308980a658148ce1b809fca6a685b4d4c430132c4599c8","schema_version":"1.0","event_id":"sha256:d28884e4aa0604f938308980a658148ce1b809fca6a685b4d4c430132c4599c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/bundle.json","state_url":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/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-06-05T02:01:19Z","links":{"resolver":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U","bundle":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/bundle.json","state":"https://pith.science/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SSXS4PYSR4AUXGEVBBR5Z544U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6SSXS4PYSR4AUXGEVBBR5Z544U","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":"6415b803091656ca32982bd2cd6c8f5f9a51c7b398719304fbb66c3080f36947","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T06:47:55Z","title_canon_sha256":"0b25ea8f1f944434f171921a1ea2d218c2e88a6679af1bc2e0ac20787aebf389"},"schema_version":"1.0","source":{"id":"1410.7530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7530","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7530v1","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7530","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"6SSXS4PYSR4A","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SSXS4PYSR4AUXGE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SSXS4PY","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d28884e4aa0604f938308980a658148ce1b809fca6a685b4d4c430132c4599c8","target":"graph","created_at":"2026-05-18T02:39:10Z","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":"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","authors_text":"Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T06:47:55Z","title":"Random-Facet and Random-Bland require subexponential time even for shortest paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7530","kind":"arxiv","version":1},"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:3d0c3f041179314731e532c680515b50ea1ea2b923718b5676a8901d8c8b157a","target":"record","created_at":"2026-05-18T02:39:10Z","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":"6415b803091656ca32982bd2cd6c8f5f9a51c7b398719304fbb66c3080f36947","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-28T06:47:55Z","title_canon_sha256":"0b25ea8f1f944434f171921a1ea2d218c2e88a6679af1bc2e0ac20787aebf389"},"schema_version":"1.0","source":{"id":"1410.7530","kind":"arxiv","version":1}},"canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4a57971f894780a5cc4a8431ee7bce51942fe206e9d4b5d766ea4066a5174e4","first_computed_at":"2026-05-18T02:39:10.119113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:10.119113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jK+lbl8rKifYXHjLQE4n4Vr7/rT4OhstlmJFdX4RqOn0YFllhDH7jAMW4jw8u+QFTiyFKkRiVVLlcWyegfs+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:10.119872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d0c3f041179314731e532c680515b50ea1ea2b923718b5676a8901d8c8b157a","sha256:d28884e4aa0604f938308980a658148ce1b809fca6a685b4d4c430132c4599c8"],"state_sha256":"8b8029ca66653f9f7546950112f9c7ab5b539920e0a449514a7372f66b46c6fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBzGRpDLnIbOubMu0ZSAtGP01nWENuF7wcmdtExin1ujhsu32qSkhREP/Kl/QJLFExo3/159wRvL+WgipshpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:01:19.268201Z","bundle_sha256":"aa7f3f5493507e137e1e6f2a28e5bf4a71f26d90c554db71e7cb41355299bc1f"}}