{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I5YAREQN5Y7RFBM2OANYIAN3FN","short_pith_number":"pith:I5YAREQN","canonical_record":{"source":{"id":"1812.01935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-05T12:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"85f61f517982468faecb528667e413718f00f78876d25d174093adf99ad3ad51","abstract_canon_sha256":"24ef40ad3c7f43b67a67504677adfbc10500f075e2c35423f7288f467cd3a281"},"schema_version":"1.0"},"canonical_sha256":"477008920dee3f12859a701b8401bb2b4a9b0d8953a9a24903c09d38d6b8ff46","source":{"kind":"arxiv","id":"1812.01935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01935","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01935v1","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01935","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5YAREQN5Y7R","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5YAREQN5Y7RFBM2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5YAREQN","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I5YAREQN5Y7RFBM2OANYIAN3FN","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-05T12:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"85f61f517982468faecb528667e413718f00f78876d25d174093adf99ad3ad51","abstract_canon_sha256":"24ef40ad3c7f43b67a67504677adfbc10500f075e2c35423f7288f467cd3a281"},"schema_version":"1.0"},"canonical_sha256":"477008920dee3f12859a701b8401bb2b4a9b0d8953a9a24903c09d38d6b8ff46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:00.180345Z","signature_b64":"r3CWqvMrCIDpeJOIx90+dG3S7XW+koF+TFiKUH6qwNLqZtsXwQFd2ANzXrTd+NafwYibTLLalB6LVc9FcsPQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477008920dee3f12859a701b8401bb2b4a9b0d8953a9a24903c09d38d6b8ff46","last_reissued_at":"2026-05-17T23:59:00.179698Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:00.179698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01935","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:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OllJXKr59xicCM+8Xt7IgcvCSPcseXI1KorGcDkp68ZFGzoz88dEy1UAmsgPCyej8OcyqH8H9FLVRB5etKDnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:53:52.803053Z"},"content_sha256":"db5b31e12883917a6ec35d297e39a3eb5acda85304231b471b783cf99aad51c7","schema_version":"1.0","event_id":"sha256:db5b31e12883917a6ec35d297e39a3eb5acda85304231b471b783cf99aad51c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I5YAREQN5Y7RFBM2OANYIAN3FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new alternating direction trust region method based on conic model for solving unconstrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuangyin Dang, Honglan Zhu, Qin Ni","submitted_at":"2018-12-05T12:01:46Z","abstract_excerpt":"In this paper, a new alternating direction trust region method based on conic model is used to solve unconstrained optimization problems. By use of the alternating direction method, the new conic model trust region subproblem is solved by two steps in two orthogonal directions. This new idea overcomes the shortcomings of conic model subproblem which is difficult to solve. Then the global convergence of the method under some reasonable conditions is established. Numerical experiment shows that this method may be better than the dogleg method to solve the subproblem, especially for large-scale p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01935","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:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1jtafQmiKy5F+siTTLfv50ImG7iIzJQ5tKOATgdNKobZF4fkC35PZjPJUK/ECjLoYAqAmZ6wT7a3vEVS4X+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:53:52.803417Z"},"content_sha256":"eb7fd80681fdc25af12d5e510f6e0e755dc05a4180c2aa5da8029be6cdfc910a","schema_version":"1.0","event_id":"sha256:eb7fd80681fdc25af12d5e510f6e0e755dc05a4180c2aa5da8029be6cdfc910a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/bundle.json","state_url":"https://pith.science/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/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-03T09:53:52Z","links":{"resolver":"https://pith.science/pith/I5YAREQN5Y7RFBM2OANYIAN3FN","bundle":"https://pith.science/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/bundle.json","state":"https://pith.science/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5YAREQN5Y7RFBM2OANYIAN3FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I5YAREQN5Y7RFBM2OANYIAN3FN","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":"24ef40ad3c7f43b67a67504677adfbc10500f075e2c35423f7288f467cd3a281","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-05T12:01:46Z","title_canon_sha256":"85f61f517982468faecb528667e413718f00f78876d25d174093adf99ad3ad51"},"schema_version":"1.0","source":{"id":"1812.01935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01935","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01935v1","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01935","created_at":"2026-05-17T23:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5YAREQN5Y7R","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5YAREQN5Y7RFBM2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5YAREQN","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:eb7fd80681fdc25af12d5e510f6e0e755dc05a4180c2aa5da8029be6cdfc910a","target":"graph","created_at":"2026-05-17T23:59:00Z","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 this paper, a new alternating direction trust region method based on conic model is used to solve unconstrained optimization problems. By use of the alternating direction method, the new conic model trust region subproblem is solved by two steps in two orthogonal directions. This new idea overcomes the shortcomings of conic model subproblem which is difficult to solve. Then the global convergence of the method under some reasonable conditions is established. Numerical experiment shows that this method may be better than the dogleg method to solve the subproblem, especially for large-scale p","authors_text":"Chuangyin Dang, Honglan Zhu, Qin Ni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-05T12:01:46Z","title":"A new alternating direction trust region method based on conic model for solving unconstrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01935","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:db5b31e12883917a6ec35d297e39a3eb5acda85304231b471b783cf99aad51c7","target":"record","created_at":"2026-05-17T23:59:00Z","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":"24ef40ad3c7f43b67a67504677adfbc10500f075e2c35423f7288f467cd3a281","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-05T12:01:46Z","title_canon_sha256":"85f61f517982468faecb528667e413718f00f78876d25d174093adf99ad3ad51"},"schema_version":"1.0","source":{"id":"1812.01935","kind":"arxiv","version":1}},"canonical_sha256":"477008920dee3f12859a701b8401bb2b4a9b0d8953a9a24903c09d38d6b8ff46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"477008920dee3f12859a701b8401bb2b4a9b0d8953a9a24903c09d38d6b8ff46","first_computed_at":"2026-05-17T23:59:00.179698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:00.179698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r3CWqvMrCIDpeJOIx90+dG3S7XW+koF+TFiKUH6qwNLqZtsXwQFd2ANzXrTd+NafwYibTLLalB6LVc9FcsPQBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:00.180345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db5b31e12883917a6ec35d297e39a3eb5acda85304231b471b783cf99aad51c7","sha256:eb7fd80681fdc25af12d5e510f6e0e755dc05a4180c2aa5da8029be6cdfc910a"],"state_sha256":"19dd09deb3f6a9af1dd4e96236fee1fbf38c8bd6474f41f38cd46049218596d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Lx1/65/gqV77uoo7fhipnaQQfisGUvpb9GPcOr8IT40WiuWcuTiCA0qeD75Ne8wN1aBZtYnbvTbhAYWs4MMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:53:52.805336Z","bundle_sha256":"b5c538f0ef8214acc68fda0098e6beaf407722e6f7b1229a3d8685ed6cab78b7"}}