{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L3CDWNP4PMARFCFVPZT2EGCEQ2","short_pith_number":"pith:L3CDWNP4","schema_version":"1.0","canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","source":{"kind":"arxiv","id":"1411.6538","version":3},"attestation_state":"computed","paper":{"title":"Efficient storage of Pareto points in biobjective mixed integer programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Akshay Gupte, Nathan Adelgren, Pietro Belotti","submitted_at":"2014-11-24T17:28:46Z","abstract_excerpt":"In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of the techniques for finding or approximating the Pareto set of a BOMILP use and update a subset of nondominated solutions, it is highly desirable to efficiently store this subset. We present a new data structure, a variant of a binary tree that takes as input points and line segments in $\\R^2$ and stores the nondominated subset of this input. When used within an exact solution procedure, such as branch-and-bound (BB), "},"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":"1411.6538","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T17:28:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1f5ccf6759f75a6083b630e6ddcb848635597bb725d688ecc472cd099bb3fbf0","abstract_canon_sha256":"2266b7bd8aac60272c7b433b7eb0e4043a2e536873203ee062057fc70917fc9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.522780Z","signature_b64":"1riRMgPs5z80EEGwanC5P8IJ9ggsdWIOqUhHCd/8hcwGeoIVgrSfRHDUOl3yE4AYwq/Vc+snQp7aHsLBPPWbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","last_reissued_at":"2026-05-18T00:05:46.521653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.521653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient storage of Pareto points in biobjective mixed integer programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Akshay Gupte, Nathan Adelgren, Pietro Belotti","submitted_at":"2014-11-24T17:28:46Z","abstract_excerpt":"In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of the techniques for finding or approximating the Pareto set of a BOMILP use and update a subset of nondominated solutions, it is highly desirable to efficiently store this subset. We present a new data structure, a variant of a binary tree that takes as input points and line segments in $\\R^2$ and stores the nondominated subset of this input. When used within an exact solution procedure, such as branch-and-bound (BB), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6538","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":"1411.6538","created_at":"2026-05-18T00:05:46.522127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6538v3","created_at":"2026-05-18T00:05:46.522127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6538","created_at":"2026-05-18T00:05:46.522127+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3CDWNP4PMAR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3CDWNP4PMARFCFV","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3CDWNP4","created_at":"2026-05-18T12:28:35.611951+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/L3CDWNP4PMARFCFVPZT2EGCEQ2","json":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2.json","graph_json":"https://pith.science/api/pith-number/L3CDWNP4PMARFCFVPZT2EGCEQ2/graph.json","events_json":"https://pith.science/api/pith-number/L3CDWNP4PMARFCFVPZT2EGCEQ2/events.json","paper":"https://pith.science/paper/L3CDWNP4"},"agent_actions":{"view_html":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2","download_json":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2.json","view_paper":"https://pith.science/paper/L3CDWNP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6538&json=true","fetch_graph":"https://pith.science/api/pith-number/L3CDWNP4PMARFCFVPZT2EGCEQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/L3CDWNP4PMARFCFVPZT2EGCEQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/action/storage_attestation","attest_author":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/action/author_attestation","sign_citation":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/action/citation_signature","submit_replication":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/action/replication_record"}},"created_at":"2026-05-18T00:05:46.522127+00:00","updated_at":"2026-05-18T00:05:46.522127+00:00"}