{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L3CDWNP4PMARFCFVPZT2EGCEQ2","short_pith_number":"pith:L3CDWNP4","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"},"canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","source":{"kind":"arxiv","id":"1411.6538","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6538","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6538v3","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6538","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"L3CDWNP4PMAR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L3CDWNP4PMARFCFV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L3CDWNP4","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L3CDWNP4PMARFCFVPZT2EGCEQ2","target":"record","payload":{"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"},"canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","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"},"source_kind":"arxiv","source_id":"1411.6538","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-18T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuA+o+VL2ZsPULgDcCp72Z5ziah34i6l6XyaOaTOis3VOIAoWjiiuMeVjjUOdbtWnu29elfmuKtmhGaySwv5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:58:44.004258Z"},"content_sha256":"735f0f8ea93cc1f56930a96aafc606c711113ba368129fe6ecf2fe1ee81e8bc7","schema_version":"1.0","event_id":"sha256:735f0f8ea93cc1f56930a96aafc606c711113ba368129fe6ecf2fe1ee81e8bc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L3CDWNP4PMARFCFVPZT2EGCEQ2","target":"graph","payload":{"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"},"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-18T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmOJfuVuN4CXJvQszA3jN1R+ApuWB+rCkY67yD42rux+7LRdm5BXEVyvGMBggDYn2fpSvu4ClgGuu/UZSKMyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:58:44.004615Z"},"content_sha256":"6e720aa9ddb5ccac4c0a6aa685b3f1ce8d60226810d04d088f9a02c773f1f7f9","schema_version":"1.0","event_id":"sha256:6e720aa9ddb5ccac4c0a6aa685b3f1ce8d60226810d04d088f9a02c773f1f7f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/bundle.json","state_url":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/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-30T14:58:44Z","links":{"resolver":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2","bundle":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/bundle.json","state":"https://pith.science/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3CDWNP4PMARFCFVPZT2EGCEQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L3CDWNP4PMARFCFVPZT2EGCEQ2","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":"2266b7bd8aac60272c7b433b7eb0e4043a2e536873203ee062057fc70917fc9b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T17:28:46Z","title_canon_sha256":"1f5ccf6759f75a6083b630e6ddcb848635597bb725d688ecc472cd099bb3fbf0"},"schema_version":"1.0","source":{"id":"1411.6538","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6538","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6538v3","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6538","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"L3CDWNP4PMAR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L3CDWNP4PMARFCFV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L3CDWNP4","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:6e720aa9ddb5ccac4c0a6aa685b3f1ce8d60226810d04d088f9a02c773f1f7f9","target":"graph","created_at":"2026-05-18T00:05:46Z","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 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), ","authors_text":"Akshay Gupte, Nathan Adelgren, Pietro Belotti","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T17:28:46Z","title":"Efficient storage of Pareto points in biobjective mixed integer programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6538","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:735f0f8ea93cc1f56930a96aafc606c711113ba368129fe6ecf2fe1ee81e8bc7","target":"record","created_at":"2026-05-18T00:05:46Z","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":"2266b7bd8aac60272c7b433b7eb0e4043a2e536873203ee062057fc70917fc9b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T17:28:46Z","title_canon_sha256":"1f5ccf6759f75a6083b630e6ddcb848635597bb725d688ecc472cd099bb3fbf0"},"schema_version":"1.0","source":{"id":"1411.6538","kind":"arxiv","version":3}},"canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec43b35fc7b011288b57e67a2184486a52c260aaac3429135069480a45640a4","first_computed_at":"2026-05-18T00:05:46.521653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:46.521653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1riRMgPs5z80EEGwanC5P8IJ9ggsdWIOqUhHCd/8hcwGeoIVgrSfRHDUOl3yE4AYwq/Vc+snQp7aHsLBPPWbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:46.522780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6538","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:735f0f8ea93cc1f56930a96aafc606c711113ba368129fe6ecf2fe1ee81e8bc7","sha256:6e720aa9ddb5ccac4c0a6aa685b3f1ce8d60226810d04d088f9a02c773f1f7f9"],"state_sha256":"485109258200851092782389a90905820f198dc06c74bf8e05dca36a3218b9a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUQ6L2vImZPxwaa4x2Wk9VYn4UK8y0calwOQ4o9ZSMpYxGHeMsXNrJLhIE/bDnlJbcDHCIxuJ88JDyTRhgiTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T14:58:44.006503Z","bundle_sha256":"b156b6b658cd027df2f17ce7630dc69b638fd516cb8f04cac50933f6f80bcb1c"}}