{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GDCEMK4SFDCEUGP6JMB6LIMPFZ","short_pith_number":"pith:GDCEMK4S","canonical_record":{"source":{"id":"1808.01786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-06T09:05:24Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"bf634ecdf32c1c87b95c8fb6ac8465322e1bb425061aa35eb7c6d796f7b98eda","abstract_canon_sha256":"bf8a706fab8699fb665d217f748bca6366f9b2988c80e4b064e63f1b131fdbbe"},"schema_version":"1.0"},"canonical_sha256":"30c4462b9228c44a19fe4b03e5a18f2e6c056a463afa3f14a371017ef86e7873","source":{"kind":"arxiv","id":"1808.01786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01786","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01786v2","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01786","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"GDCEMK4SFDCE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GDCEMK4SFDCEUGP6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GDCEMK4S","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GDCEMK4SFDCEUGP6JMB6LIMPFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-06T09:05:24Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"bf634ecdf32c1c87b95c8fb6ac8465322e1bb425061aa35eb7c6d796f7b98eda","abstract_canon_sha256":"bf8a706fab8699fb665d217f748bca6366f9b2988c80e4b064e63f1b131fdbbe"},"schema_version":"1.0"},"canonical_sha256":"30c4462b9228c44a19fe4b03e5a18f2e6c056a463afa3f14a371017ef86e7873","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:49.038304Z","signature_b64":"nCKAsEhgrZLNoG1Fdxm8mnUgi5j+9qBFVioJF2pnoKosuqLaqZvBFrlHWPK8zbl85mQvAFjEY+KQ1ZK9FWo2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c4462b9228c44a19fe4b03e5a18f2e6c056a463afa3f14a371017ef86e7873","last_reissued_at":"2026-05-17T23:50:49.037681Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:49.037681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01786","source_version":2,"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:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foVtg/Q9f2actK3+PWf673V+H4UYjsUsfvcmHcUxeVqRkTstTDp5FfC8jQ415zwkUzKdUKAyXqUlfoTXWGJVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:01:31.509938Z"},"content_sha256":"1f1cdbbafff62a3acd34ae79368829ca7113446be9514720e43a3c39207ec096","schema_version":"1.0","event_id":"sha256:1f1cdbbafff62a3acd34ae79368829ca7113446be9514720e43a3c39207ec096"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GDCEMK4SFDCEUGP6JMB6LIMPFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inner approximation algorithm for solving linear multiobjective optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"math.OC","authors_text":"Laszlo Csirmaz","submitted_at":"2018-08-06T09:05:24Z","abstract_excerpt":"Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined components: one-dimensional linear optimization one one hand, and a combinatorial part closely related to vertex numeration on the other. Their separation provides a deeper insight into Benson's algorithm, and points toward a dual approach. Two skeletal algorithms are defined which focus on the combinatorial part. Using different single-objective optimization problems - called oracle calls - yield different a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01786","kind":"arxiv","version":2},"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:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9y2hte1Xh3lLsr4vqvSMkeWSC41FbVwzJSP9nNMPFfhWf65/UcAT0BI6I8w6HiPW00GKX1eJ8DZ4N60RHLDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:01:31.510638Z"},"content_sha256":"590b2c5205fb99863618f1009378d029f92d7a9028938e139c154025ef6020e6","schema_version":"1.0","event_id":"sha256:590b2c5205fb99863618f1009378d029f92d7a9028938e139c154025ef6020e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/bundle.json","state_url":"https://pith.science/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/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-07T14:01:31Z","links":{"resolver":"https://pith.science/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ","bundle":"https://pith.science/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/bundle.json","state":"https://pith.science/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDCEMK4SFDCEUGP6JMB6LIMPFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GDCEMK4SFDCEUGP6JMB6LIMPFZ","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":"bf8a706fab8699fb665d217f748bca6366f9b2988c80e4b064e63f1b131fdbbe","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-06T09:05:24Z","title_canon_sha256":"bf634ecdf32c1c87b95c8fb6ac8465322e1bb425061aa35eb7c6d796f7b98eda"},"schema_version":"1.0","source":{"id":"1808.01786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01786","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01786v2","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01786","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"GDCEMK4SFDCE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GDCEMK4SFDCEUGP6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GDCEMK4S","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:590b2c5205fb99863618f1009378d029f92d7a9028938e139c154025ef6020e6","target":"graph","created_at":"2026-05-17T23:50:49Z","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":"Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined components: one-dimensional linear optimization one one hand, and a combinatorial part closely related to vertex numeration on the other. Their separation provides a deeper insight into Benson's algorithm, and points toward a dual approach. Two skeletal algorithms are defined which focus on the combinatorial part. Using different single-objective optimization problems - called oracle calls - yield different a","authors_text":"Laszlo Csirmaz","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-06T09:05:24Z","title":"Inner approximation algorithm for solving linear multiobjective optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01786","kind":"arxiv","version":2},"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:1f1cdbbafff62a3acd34ae79368829ca7113446be9514720e43a3c39207ec096","target":"record","created_at":"2026-05-17T23:50:49Z","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":"bf8a706fab8699fb665d217f748bca6366f9b2988c80e4b064e63f1b131fdbbe","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-06T09:05:24Z","title_canon_sha256":"bf634ecdf32c1c87b95c8fb6ac8465322e1bb425061aa35eb7c6d796f7b98eda"},"schema_version":"1.0","source":{"id":"1808.01786","kind":"arxiv","version":2}},"canonical_sha256":"30c4462b9228c44a19fe4b03e5a18f2e6c056a463afa3f14a371017ef86e7873","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c4462b9228c44a19fe4b03e5a18f2e6c056a463afa3f14a371017ef86e7873","first_computed_at":"2026-05-17T23:50:49.037681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:49.037681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nCKAsEhgrZLNoG1Fdxm8mnUgi5j+9qBFVioJF2pnoKosuqLaqZvBFrlHWPK8zbl85mQvAFjEY+KQ1ZK9FWo2Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:49.038304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f1cdbbafff62a3acd34ae79368829ca7113446be9514720e43a3c39207ec096","sha256:590b2c5205fb99863618f1009378d029f92d7a9028938e139c154025ef6020e6"],"state_sha256":"d0aa80dd687d3fb465756bd8f9314f03dba4f5a247c9f49b34277c9206b47f92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"No7uP8w9NElJPzNSu4XLbmzIE9iRbjhIAbW544fC4mX/DZQTCVEAJflfamz1eGohlbY2FO5N6aPmYOlk2HUuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:01:31.515276Z","bundle_sha256":"6d468fcd2f08a43515473b3e5ad0205a8f886fb3f570364d171cf6595e1db489"}}