{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MZKBPTQCIEMMOZWUUW4QPYW2MJ","short_pith_number":"pith:MZKBPTQC","canonical_record":{"source":{"id":"1304.7235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T17:24:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"95d65ddeb1f7612f99164687e7ad2f8dc3d873d4cad11c8259673051cc6cb277","abstract_canon_sha256":"b5c11b1d08074ccc75a251b0d7458d86246d73d6e13a8d9ce0844ae6f25cf047"},"schema_version":"1.0"},"canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","source":{"kind":"arxiv","id":"1304.7235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7235","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7235v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7235","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"MZKBPTQCIEMM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZKBPTQCIEMMOZWU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZKBPTQC","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MZKBPTQCIEMMOZWUUW4QPYW2MJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T17:24:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"95d65ddeb1f7612f99164687e7ad2f8dc3d873d4cad11c8259673051cc6cb277","abstract_canon_sha256":"b5c11b1d08074ccc75a251b0d7458d86246d73d6e13a8d9ce0844ae6f25cf047"},"schema_version":"1.0"},"canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.236242Z","signature_b64":"U599j+6cmLLUhOM7tz81DMcKhEQkaymBwpsS+TPrgEOccxl8VzfNttDyAnxeJjCyUpbHFhYAPZ36/BFI5dyKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","last_reissued_at":"2026-05-18T03:27:02.235678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.235678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7235","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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7MDw3uxMLmM/qnLoh0KrZ+fcMeiMxBqwpFbSHJtylUhUsMQ8HB95wBYv/CIHEw8N0BcVkEc4E/EwsWYHfWfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:13:27.006017Z"},"content_sha256":"c158e95869ade8c7a424dbde83767542b8d688cb47a201a1d1e8cc72534f24a5","schema_version":"1.0","event_id":"sha256:c158e95869ade8c7a424dbde83767542b8d688cb47a201a1d1e8cc72534f24a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MZKBPTQCIEMMOZWUUW4QPYW2MJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Short Paths on Polytopes by the Shadow Vertex Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Heiko R\\\"oglin, Tobias Brunsch","submitted_at":"2013-04-26T17:24:53Z","abstract_excerpt":"We show that the shadow vertex algorithm can be used to compute a short path between a given pair of vertices of a polytope P = {x : Ax \\leq b} along the edges of P, where A \\in R^{m \\times n} is a real-valued matrix. Both, the length of the path and the running time of the algorithm, are polynomial in m, n, and a parameter 1/delta that is a measure for the flatness of the vertices of P. For integer matrices A \\in Z^{m \\times n} we show a connection between delta and the largest absolute value Delta of any sub-determinant of A, yielding a bound of O(Delta^4 m n^4) for the length of the compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7235","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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gusPUHufl6elwFqnX/J7NWPtMmCBPlART1e7lm+XldawBLP/M0tqM1gFFL5x7EY3Q3y5Qs60NjwNfHi0Y/SODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:13:27.006725Z"},"content_sha256":"301275c69521f71d8541a61bae70d991e3929b0af48d34479106c642df526553","schema_version":"1.0","event_id":"sha256:301275c69521f71d8541a61bae70d991e3929b0af48d34479106c642df526553"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/bundle.json","state_url":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/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-03T15:13:27Z","links":{"resolver":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ","bundle":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/bundle.json","state":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MZKBPTQCIEMMOZWUUW4QPYW2MJ","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":"b5c11b1d08074ccc75a251b0d7458d86246d73d6e13a8d9ce0844ae6f25cf047","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T17:24:53Z","title_canon_sha256":"95d65ddeb1f7612f99164687e7ad2f8dc3d873d4cad11c8259673051cc6cb277"},"schema_version":"1.0","source":{"id":"1304.7235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7235","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7235v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7235","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"MZKBPTQCIEMM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZKBPTQCIEMMOZWU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZKBPTQC","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:301275c69521f71d8541a61bae70d991e3929b0af48d34479106c642df526553","target":"graph","created_at":"2026-05-18T03:27:02Z","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 show that the shadow vertex algorithm can be used to compute a short path between a given pair of vertices of a polytope P = {x : Ax \\leq b} along the edges of P, where A \\in R^{m \\times n} is a real-valued matrix. Both, the length of the path and the running time of the algorithm, are polynomial in m, n, and a parameter 1/delta that is a measure for the flatness of the vertices of P. For integer matrices A \\in Z^{m \\times n} we show a connection between delta and the largest absolute value Delta of any sub-determinant of A, yielding a bound of O(Delta^4 m n^4) for the length of the compute","authors_text":"Heiko R\\\"oglin, Tobias Brunsch","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T17:24:53Z","title":"Finding Short Paths on Polytopes by the Shadow Vertex Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7235","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:c158e95869ade8c7a424dbde83767542b8d688cb47a201a1d1e8cc72534f24a5","target":"record","created_at":"2026-05-18T03:27:02Z","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":"b5c11b1d08074ccc75a251b0d7458d86246d73d6e13a8d9ce0844ae6f25cf047","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T17:24:53Z","title_canon_sha256":"95d65ddeb1f7612f99164687e7ad2f8dc3d873d4cad11c8259673051cc6cb277"},"schema_version":"1.0","source":{"id":"1304.7235","kind":"arxiv","version":1}},"canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","first_computed_at":"2026-05-18T03:27:02.235678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.235678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U599j+6cmLLUhOM7tz81DMcKhEQkaymBwpsS+TPrgEOccxl8VzfNttDyAnxeJjCyUpbHFhYAPZ36/BFI5dyKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.236242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c158e95869ade8c7a424dbde83767542b8d688cb47a201a1d1e8cc72534f24a5","sha256:301275c69521f71d8541a61bae70d991e3929b0af48d34479106c642df526553"],"state_sha256":"9539ce074e344c02b772e60607783f0718b210e109377c069711ff6f8e453833"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOtdfupfOTHEr/846InfpKYNh99Crkx84SfYj4sEagAyaudQzZAV8G03seUxuMasLiXeJjBZ5mz8jNtEh41LDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:13:27.009628Z","bundle_sha256":"67832bb4c9b30c347e15d4fd3368c1d9fad85cad7774f881e0c2c027a30619f9"}}