{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LEMIFKU7356SJVUKL73AVL3MNJ","short_pith_number":"pith:LEMIFKU7","schema_version":"1.0","canonical_sha256":"591882aa9fdf7d24d68a5ff60aaf6c6a63de730aaa935afcf6f3274ddea7f325","source":{"kind":"arxiv","id":"1804.07332","version":1},"attestation_state":"computed","paper":{"title":"Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carleton Coffrin, Harsha Nagarajan, Hassan Hijazi, Ole Kr\\\"oger","submitted_at":"2018-04-19T18:39:23Z","abstract_excerpt":"Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of optimization problems that often arise in engineering and scientific applications. Because of nonconvexities, these programs are typically solved with global optimization algorithms, which have limited scalability. However, nonlinear branch-and-bound has recently been shown to be an effective heuristic for quickly finding high-quality solutions to large-scale nonconvex MINLPs, such as those arising in infrastructure network optimization. This work proposes Juniper, a Julia-based open-source solver for nonlinea"},"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":"1804.07332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T18:39:23Z","cross_cats_sorted":[],"title_canon_sha256":"830a58e2cb234de8ea516918f4c71acbfe3f4225562fde6d8232980ebfd1afd8","abstract_canon_sha256":"fcbf0bf6eebfcea1f5762bf306b851ab18cbd771c21e3d4c42a7abac3f1bf588"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:24.328619Z","signature_b64":"gmN+9YNnZX3b+BlkaPwZMAJmLsUCwwNv+b94FlXKH+bIxtOCNfCgwTwr6RsW6CHkbFg1QKGLN7o+baeGOzy+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"591882aa9fdf7d24d68a5ff60aaf6c6a63de730aaa935afcf6f3274ddea7f325","last_reissued_at":"2026-05-18T00:12:24.328005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:24.328005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carleton Coffrin, Harsha Nagarajan, Hassan Hijazi, Ole Kr\\\"oger","submitted_at":"2018-04-19T18:39:23Z","abstract_excerpt":"Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of optimization problems that often arise in engineering and scientific applications. Because of nonconvexities, these programs are typically solved with global optimization algorithms, which have limited scalability. However, nonlinear branch-and-bound has recently been shown to be an effective heuristic for quickly finding high-quality solutions to large-scale nonconvex MINLPs, such as those arising in infrastructure network optimization. This work proposes Juniper, a Julia-based open-source solver for nonlinea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07332","kind":"arxiv","version":1},"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":"1804.07332","created_at":"2026-05-18T00:12:24.328098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07332v1","created_at":"2026-05-18T00:12:24.328098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07332","created_at":"2026-05-18T00:12:24.328098+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEMIFKU7356S","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEMIFKU7356SJVUK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEMIFKU7","created_at":"2026-05-18T12:32:37.024351+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/LEMIFKU7356SJVUKL73AVL3MNJ","json":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ.json","graph_json":"https://pith.science/api/pith-number/LEMIFKU7356SJVUKL73AVL3MNJ/graph.json","events_json":"https://pith.science/api/pith-number/LEMIFKU7356SJVUKL73AVL3MNJ/events.json","paper":"https://pith.science/paper/LEMIFKU7"},"agent_actions":{"view_html":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ","download_json":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ.json","view_paper":"https://pith.science/paper/LEMIFKU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07332&json=true","fetch_graph":"https://pith.science/api/pith-number/LEMIFKU7356SJVUKL73AVL3MNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LEMIFKU7356SJVUKL73AVL3MNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ/action/storage_attestation","attest_author":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ/action/author_attestation","sign_citation":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ/action/citation_signature","submit_replication":"https://pith.science/pith/LEMIFKU7356SJVUKL73AVL3MNJ/action/replication_record"}},"created_at":"2026-05-18T00:12:24.328098+00:00","updated_at":"2026-05-18T00:12:24.328098+00:00"}