{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PFDPHGISAW7S67HTJAJL5DIUGC","short_pith_number":"pith:PFDPHGIS","schema_version":"1.0","canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","source":{"kind":"arxiv","id":"1905.12840","version":1},"attestation_state":"computed","paper":{"title":"A Newton-bracketing method for a simple conic optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-05-30T03:24:38Z","abstract_excerpt":"For the Lagrangian-DNN relaxation of quadratic optimization problems (QOPs), we propose a Newton-bracketing method to improve the performance of the bisection-projection method implemented in BBCPOP [to appear in ACM Tran. Softw., 2019]. The relaxation problem is converted into the problem of finding the largest zero $y^*$ of a continuously differentiable (except at $y^*$) convex function $g : \\mathbb{R} \\rightarrow \\mathbb{R}$ such that $g(y) = 0$ if $y \\leq y^*$ and $g(y) > 0$ otherwise. In theory, the method generates lower and upper bounds of $y^*$ both converging to $y^*$. Their convergen"},"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":"1905.12840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-30T03:24:38Z","cross_cats_sorted":[],"title_canon_sha256":"514881920623ddf982d45551839a81e504a26d96d1c2a431297cc77794c47310","abstract_canon_sha256":"03af56be34c942bbd44614cbd88e3a9fa036db091b26bbd099ff990a953a57e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.516539Z","signature_b64":"yzO7Z1yMJ40oYY0X2XD+XLOEQMaQE4pZ1RRCwO+auykKFLzv2z/McXkeEez5egwedUYEz57NdMGxQrR1nDxuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","last_reissued_at":"2026-05-17T23:44:39.516016Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.516016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Newton-bracketing method for a simple conic optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-05-30T03:24:38Z","abstract_excerpt":"For the Lagrangian-DNN relaxation of quadratic optimization problems (QOPs), we propose a Newton-bracketing method to improve the performance of the bisection-projection method implemented in BBCPOP [to appear in ACM Tran. Softw., 2019]. The relaxation problem is converted into the problem of finding the largest zero $y^*$ of a continuously differentiable (except at $y^*$) convex function $g : \\mathbb{R} \\rightarrow \\mathbb{R}$ such that $g(y) = 0$ if $y \\leq y^*$ and $g(y) > 0$ otherwise. In theory, the method generates lower and upper bounds of $y^*$ both converging to $y^*$. Their convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12840","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":"1905.12840","created_at":"2026-05-17T23:44:39.516098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12840v1","created_at":"2026-05-17T23:44:39.516098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12840","created_at":"2026-05-17T23:44:39.516098+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFDPHGISAW7S","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFDPHGISAW7S67HT","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFDPHGIS","created_at":"2026-05-18T12:33:24.271573+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/PFDPHGISAW7S67HTJAJL5DIUGC","json":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC.json","graph_json":"https://pith.science/api/pith-number/PFDPHGISAW7S67HTJAJL5DIUGC/graph.json","events_json":"https://pith.science/api/pith-number/PFDPHGISAW7S67HTJAJL5DIUGC/events.json","paper":"https://pith.science/paper/PFDPHGIS"},"agent_actions":{"view_html":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC","download_json":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC.json","view_paper":"https://pith.science/paper/PFDPHGIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12840&json=true","fetch_graph":"https://pith.science/api/pith-number/PFDPHGISAW7S67HTJAJL5DIUGC/graph.json","fetch_events":"https://pith.science/api/pith-number/PFDPHGISAW7S67HTJAJL5DIUGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/action/storage_attestation","attest_author":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/action/author_attestation","sign_citation":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/action/citation_signature","submit_replication":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/action/replication_record"}},"created_at":"2026-05-17T23:44:39.516098+00:00","updated_at":"2026-05-17T23:44:39.516098+00:00"}