{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PFDPHGISAW7S67HTJAJL5DIUGC","short_pith_number":"pith:PFDPHGIS","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"},"canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","source":{"kind":"arxiv","id":"1905.12840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12840","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12840v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12840","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"PFDPHGISAW7S","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PFDPHGISAW7S67HT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PFDPHGIS","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PFDPHGISAW7S67HTJAJL5DIUGC","target":"record","payload":{"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"},"canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","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"},"source_kind":"arxiv","source_id":"1905.12840","source_version":1,"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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYWbKEe8Wn+ZsDJj/h5KHdYExp5gvXuaQBli41vTZ/DXePraeyR17BqKNNNCYjARSipK0Z+p6uWYg9VuEektBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:12:59.076647Z"},"content_sha256":"28fd653b80d84e20f1e1723f7d2817a41e0eef2d49d0b599ea1545ef9583ea40","schema_version":"1.0","event_id":"sha256:28fd653b80d84e20f1e1723f7d2817a41e0eef2d49d0b599ea1545ef9583ea40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PFDPHGISAW7S67HTJAJL5DIUGC","target":"graph","payload":{"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"},"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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+wYL7qBI62nhkEK1f7xziPZM7T7kALJ/I1N1hqpTaa+dm3DxeXpvYeZDB3l6wRQQXpNR0muByRkIyOjwKmHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:12:59.077379Z"},"content_sha256":"32a2041b9ad59a9e943db684a73c3cb46747f65c7ff902c46c0e110532256f6a","schema_version":"1.0","event_id":"sha256:32a2041b9ad59a9e943db684a73c3cb46747f65c7ff902c46c0e110532256f6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/bundle.json","state_url":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFDPHGISAW7S67HTJAJL5DIUGC/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-05-25T18:12:59Z","links":{"resolver":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC","bundle":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/bundle.json","state":"https://pith.science/pith/PFDPHGISAW7S67HTJAJL5DIUGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFDPHGISAW7S67HTJAJL5DIUGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PFDPHGISAW7S67HTJAJL5DIUGC","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":"03af56be34c942bbd44614cbd88e3a9fa036db091b26bbd099ff990a953a57e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-30T03:24:38Z","title_canon_sha256":"514881920623ddf982d45551839a81e504a26d96d1c2a431297cc77794c47310"},"schema_version":"1.0","source":{"id":"1905.12840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12840","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12840v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12840","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"PFDPHGISAW7S","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PFDPHGISAW7S67HT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PFDPHGIS","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:32a2041b9ad59a9e943db684a73c3cb46747f65c7ff902c46c0e110532256f6a","target":"graph","created_at":"2026-05-17T23:44:39Z","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":"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","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-30T03:24:38Z","title":"A Newton-bracketing method for a simple conic optimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12840","kind":"arxiv","version":1},"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:28fd653b80d84e20f1e1723f7d2817a41e0eef2d49d0b599ea1545ef9583ea40","target":"record","created_at":"2026-05-17T23:44:39Z","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":"03af56be34c942bbd44614cbd88e3a9fa036db091b26bbd099ff990a953a57e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-30T03:24:38Z","title_canon_sha256":"514881920623ddf982d45551839a81e504a26d96d1c2a431297cc77794c47310"},"schema_version":"1.0","source":{"id":"1905.12840","kind":"arxiv","version":1}},"canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7946f3991205bf2f7cf34812be8d14309a528690099649731cd31172c73552e1","first_computed_at":"2026-05-17T23:44:39.516016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:39.516016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yzO7Z1yMJ40oYY0X2XD+XLOEQMaQE4pZ1RRCwO+auykKFLzv2z/McXkeEez5egwedUYEz57NdMGxQrR1nDxuBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:39.516539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28fd653b80d84e20f1e1723f7d2817a41e0eef2d49d0b599ea1545ef9583ea40","sha256:32a2041b9ad59a9e943db684a73c3cb46747f65c7ff902c46c0e110532256f6a"],"state_sha256":"0968c7590e90379104d7f235e6e56cf739bc17213d29613ce519aca94319728f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PN3GxTYhjn8MuCS4ioLhQ3Wf11FCX8Xj1mdZ6wKxUAja+F50L14Jktc1yiXgxEbxXaaRWq+7ZRvXvCurWrECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:12:59.080444Z","bundle_sha256":"d20e7a27e02b5353382b773eb4c9aa56891958386dfaaf290afdfc59dec8b904"}}