{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MZKBPTQCIEMMOZWUUW4QPYW2MJ","short_pith_number":"pith:MZKBPTQC","schema_version":"1.0","canonical_sha256":"665417ce024118c766d4a5b907e2da62429b9bc73636120c787942529822c301","source":{"kind":"arxiv","id":"1304.7235","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7235","created_at":"2026-05-18T03:27:02.235773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7235v1","created_at":"2026-05-18T03:27:02.235773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7235","created_at":"2026-05-18T03:27:02.235773+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZKBPTQCIEMM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZKBPTQCIEMMOZWU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZKBPTQC","created_at":"2026-05-18T12:27:52.871228+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/MZKBPTQCIEMMOZWUUW4QPYW2MJ","json":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ.json","graph_json":"https://pith.science/api/pith-number/MZKBPTQCIEMMOZWUUW4QPYW2MJ/graph.json","events_json":"https://pith.science/api/pith-number/MZKBPTQCIEMMOZWUUW4QPYW2MJ/events.json","paper":"https://pith.science/paper/MZKBPTQC"},"agent_actions":{"view_html":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ","download_json":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ.json","view_paper":"https://pith.science/paper/MZKBPTQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7235&json=true","fetch_graph":"https://pith.science/api/pith-number/MZKBPTQCIEMMOZWUUW4QPYW2MJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MZKBPTQCIEMMOZWUUW4QPYW2MJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/action/storage_attestation","attest_author":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/action/author_attestation","sign_citation":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/action/citation_signature","submit_replication":"https://pith.science/pith/MZKBPTQCIEMMOZWUUW4QPYW2MJ/action/replication_record"}},"created_at":"2026-05-18T03:27:02.235773+00:00","updated_at":"2026-05-18T03:27:02.235773+00:00"}