{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7FRE5ILA6QFKOHBCLK5ERWRZQB","short_pith_number":"pith:7FRE5ILA","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"},"canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","source":{"kind":"arxiv","id":"1507.01895","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01895","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01895v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01895","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"7FRE5ILA6QFK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FRE5ILA6QFKOHBC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FRE5ILA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7FRE5ILA6QFKOHBCLK5ERWRZQB","target":"record","payload":{"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"},"canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","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"},"source_kind":"arxiv","source_id":"1507.01895","source_version":3,"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1CDVzvwk+nmOSn38ApA+EQ1thvLlp/NhelItVtP/AldcKalWUwazFQnKSQQoO5veKlil5/c+QahV7sgDvaHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:55:39.202472Z"},"content_sha256":"f0d2be6b04d3716d8566f54eaadb01fb20ceafc327b13f4fe82a3439dd1b975e","schema_version":"1.0","event_id":"sha256:f0d2be6b04d3716d8566f54eaadb01fb20ceafc327b13f4fe82a3439dd1b975e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7FRE5ILA6QFKOHBCLK5ERWRZQB","target":"graph","payload":{"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"},"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv4zVEdci2zBn2HfmHd4B21X1eBWAHd4G5r6mWwNmM+QudJYYXHTLr+OODVCRvjAWOb0X/b5Od+Pt9UCla5mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:55:39.202814Z"},"content_sha256":"802ad5aa06f2cbf7fb4ca1db473da266983b3244d0672863e9ddc6414c42f68b","schema_version":"1.0","event_id":"sha256:802ad5aa06f2cbf7fb4ca1db473da266983b3244d0672863e9ddc6414c42f68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/bundle.json","state_url":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/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-27T14:55:39Z","links":{"resolver":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB","bundle":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/bundle.json","state":"https://pith.science/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FRE5ILA6QFKOHBCLK5ERWRZQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7FRE5ILA6QFKOHBCLK5ERWRZQB","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":"8c3fd052795b5422bff5f7d076cd06c89ceaf6fee40fc92931e3d6f3719df641","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T17:51:49Z","title_canon_sha256":"5bb98f800db3878195afa32228e0bacb5fe51114e34884d25b5f789d56499916"},"schema_version":"1.0","source":{"id":"1507.01895","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01895","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01895v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01895","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"7FRE5ILA6QFK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FRE5ILA6QFKOHBC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FRE5ILA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:802ad5aa06f2cbf7fb4ca1db473da266983b3244d0672863e9ddc6414c42f68b","target":"graph","created_at":"2026-05-17T23:45: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":"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","authors_text":"Birgit Rudloff, Firdevs Ulus, Robert Vanderbei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T17:51:49Z","title":"A Parametric Simplex Algorithm for Linear Vector Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01895","kind":"arxiv","version":3},"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:f0d2be6b04d3716d8566f54eaadb01fb20ceafc327b13f4fe82a3439dd1b975e","target":"record","created_at":"2026-05-17T23:45: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":"8c3fd052795b5422bff5f7d076cd06c89ceaf6fee40fc92931e3d6f3719df641","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T17:51:49Z","title_canon_sha256":"5bb98f800db3878195afa32228e0bacb5fe51114e34884d25b5f789d56499916"},"schema_version":"1.0","source":{"id":"1507.01895","kind":"arxiv","version":3}},"canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9624ea160f40aa71c225aba48da398041b8df2d724001bb92c8e7da73b6a801","first_computed_at":"2026-05-17T23:45:10.356453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.356453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GDgkHt/5EzG0uA2Mq+T+XqDLsPRCljZVcR7qrhQcfwL8HF2nely3ZUQ/pIFZe6WpmYyLU9Eoq3SwoCF5PA2YCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.357144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01895","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0d2be6b04d3716d8566f54eaadb01fb20ceafc327b13f4fe82a3439dd1b975e","sha256:802ad5aa06f2cbf7fb4ca1db473da266983b3244d0672863e9ddc6414c42f68b"],"state_sha256":"309f159f95c7183101a42334cf1bbe7bf977d55a3f6866a726a17f6736717fca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aneQQy80h01CE4Gkwll0xlI6cjxTv9mSi947jnjC41qsl2Z0/jw5uyVkm1j6K74AMc8xVEOy213tPE+8a1iqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:55:39.204656Z","bundle_sha256":"730c50cd660166ca2029025de0f9f765bb4110ce1190ba0ff98364d9342d8f25"}}