{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WSQTTFSSGYV3TKE5M3KEKRVG5O","short_pith_number":"pith:WSQTTFSS","schema_version":"1.0","canonical_sha256":"b4a1399652362bb9a89d66d44546a6eb89aca6ef5a65dbf4e842f4f56af36a8d","source":{"kind":"arxiv","id":"2207.09155","version":2},"attestation_state":"computed","paper":{"title":"PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MS","math.OC"],"primary_cat":"cs.DM","authors_text":"Fritz B\\\"okler, Levin Nemesch, Mirko H. Wagner","submitted_at":"2022-07-19T09:53:00Z","abstract_excerpt":"In multi-objective optimization, several potentially conflicting objective functions need to be optimized. Instead of one optimal solution, we look for the set of so called non-dominated solutions.\n  An important subset is the set of non-dominated extreme points. Finding it is a computationally hard problem in general. While solvers for similar problems exist, there are none known for multi-objective mixed integer linear programs (MOMILPs) or multi-objective mixed integer quadratically constrained quadratic programs (MOMIQCQPs). We present PaMILO, the first solver for finding non-dominated ext"},"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":"2207.09155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2022-07-19T09:53:00Z","cross_cats_sorted":["cs.MS","math.OC"],"title_canon_sha256":"9d4cc5b2a485d2d7d1d1e7617395ece1f02ad6cd9dbfb622817d4a9a838855d5","abstract_canon_sha256":"07c8aecf3d63c5c108757fdafc02d58e0ee8f7ead45260fd570b1fef956c0240"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:09.131961Z","signature_b64":"HyqAL6MITdzbD98vYIe/jWMvwgOi+Uz4Cl51MkOK9lXtnIEaIjrL/SlXkY2LJu7SCkq6cvLIvjk1UdsmJ85kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a1399652362bb9a89d66d44546a6eb89aca6ef5a65dbf4e842f4f56af36a8d","last_reissued_at":"2026-07-05T06:03:09.131507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:09.131507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MS","math.OC"],"primary_cat":"cs.DM","authors_text":"Fritz B\\\"okler, Levin Nemesch, Mirko H. Wagner","submitted_at":"2022-07-19T09:53:00Z","abstract_excerpt":"In multi-objective optimization, several potentially conflicting objective functions need to be optimized. Instead of one optimal solution, we look for the set of so called non-dominated solutions.\n  An important subset is the set of non-dominated extreme points. Finding it is a computationally hard problem in general. While solvers for similar problems exist, there are none known for multi-objective mixed integer linear programs (MOMILPs) or multi-objective mixed integer quadratically constrained quadratic programs (MOMIQCQPs). We present PaMILO, the first solver for finding non-dominated ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.09155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.09155","created_at":"2026-07-05T06:03:09.131562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09155v2","created_at":"2026-07-05T06:03:09.131562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09155","created_at":"2026-07-05T06:03:09.131562+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSQTTFSSGYV3","created_at":"2026-07-05T06:03:09.131562+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSQTTFSSGYV3TKE5","created_at":"2026-07-05T06:03:09.131562+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSQTTFSS","created_at":"2026-07-05T06:03:09.131562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05501","citing_title":"MultiObjectiveAlgorithms.jl: a Julia package for solving multi-objective optimization problems","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O","json":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O.json","graph_json":"https://pith.science/api/pith-number/WSQTTFSSGYV3TKE5M3KEKRVG5O/graph.json","events_json":"https://pith.science/api/pith-number/WSQTTFSSGYV3TKE5M3KEKRVG5O/events.json","paper":"https://pith.science/paper/WSQTTFSS"},"agent_actions":{"view_html":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O","download_json":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O.json","view_paper":"https://pith.science/paper/WSQTTFSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09155&json=true","fetch_graph":"https://pith.science/api/pith-number/WSQTTFSSGYV3TKE5M3KEKRVG5O/graph.json","fetch_events":"https://pith.science/api/pith-number/WSQTTFSSGYV3TKE5M3KEKRVG5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O/action/storage_attestation","attest_author":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O/action/author_attestation","sign_citation":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O/action/citation_signature","submit_replication":"https://pith.science/pith/WSQTTFSSGYV3TKE5M3KEKRVG5O/action/replication_record"}},"created_at":"2026-07-05T06:03:09.131562+00:00","updated_at":"2026-07-05T06:03:09.131562+00:00"}