{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7FRE5ILA6QFKOHBCLK5ERWRZQB","short_pith_number":"pith:7FRE5ILA","schema_version":"1.0","canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","source":{"kind":"arxiv","id":"1507.01895","version":3},"attestation_state":"computed","paper":{"title":"A Parametric Simplex Algorithm for Linear Vector Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Birgit Rudloff, Firdevs Ulus, Robert Vanderbei","submitted_at":"2015-07-07T17:51:49Z","abstract_excerpt":"In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Loehne [16], that is, it finds a subset of efficient solutions that allows to generate the whole frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorit"},"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":"1507.01895","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T17:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"5bb98f800db3878195afa32228e0bacb5fe51114e34884d25b5f789d56499916","abstract_canon_sha256":"8c3fd052795b5422bff5f7d076cd06c89ceaf6fee40fc92931e3d6f3719df641"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.357144Z","signature_b64":"GDgkHt/5EzG0uA2Mq+T+XqDLsPRCljZVcR7qrhQcfwL8HF2nely3ZUQ/pIFZe6WpmYyLU9Eoq3SwoCF5PA2YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","last_reissued_at":"2026-05-17T23:45:10.356453Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.356453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parametric Simplex Algorithm for Linear Vector Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Birgit Rudloff, Firdevs Ulus, Robert Vanderbei","submitted_at":"2015-07-07T17:51:49Z","abstract_excerpt":"In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Loehne [16], that is, it finds a subset of efficient solutions that allows to generate the whole frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01895","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01895","created_at":"2026-05-17T23:45:10.356566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01895v3","created_at":"2026-05-17T23:45:10.356566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01895","created_at":"2026-05-17T23:45:10.356566+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FRE5ILA6QFK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FRE5ILA6QFKOHBC","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FRE5ILA","created_at":"2026-05-18T12:29:10.953037+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/7FRE5ILA6QFKOHBCLK5ERWRZQB","json":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB.json","graph_json":"https://pith.science/api/pith-number/7FRE5ILA6QFKOHBCLK5ERWRZQB/graph.json","events_json":"https://pith.science/api/pith-number/7FRE5ILA6QFKOHBCLK5ERWRZQB/events.json","paper":"https://pith.science/paper/7FRE5ILA"},"agent_actions":{"view_html":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB","download_json":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB.json","view_paper":"https://pith.science/paper/7FRE5ILA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01895&json=true","fetch_graph":"https://pith.science/api/pith-number/7FRE5ILA6QFKOHBCLK5ERWRZQB/graph.json","fetch_events":"https://pith.science/api/pith-number/7FRE5ILA6QFKOHBCLK5ERWRZQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/action/storage_attestation","attest_author":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/action/author_attestation","sign_citation":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/action/citation_signature","submit_replication":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/action/replication_record"}},"created_at":"2026-05-17T23:45:10.356566+00:00","updated_at":"2026-05-17T23:45:10.356566+00:00"}