{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DPY5IBQRV3AJGJWHALUB5DLAKP","short_pith_number":"pith:DPY5IBQR","canonical_record":{"source":{"id":"1706.06493","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-20T14:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"a38855ce9e5c43b1055c7f8dec0ea279d7e4859aa8674f167752b499c455399c","abstract_canon_sha256":"338f798d6a8e5917844da4c3bd0d443096886194cb1d88e0d5a785b4d37fe04d"},"schema_version":"1.0"},"canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","source":{"kind":"arxiv","id":"1706.06493","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06493","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06493v5","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06493","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"DPY5IBQRV3AJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPY5IBQRV3AJGJWH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPY5IBQR","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DPY5IBQRV3AJGJWHALUB5DLAKP","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06493","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-20T14:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"a38855ce9e5c43b1055c7f8dec0ea279d7e4859aa8674f167752b499c455399c","abstract_canon_sha256":"338f798d6a8e5917844da4c3bd0d443096886194cb1d88e0d5a785b4d37fe04d"},"schema_version":"1.0"},"canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.202255Z","signature_b64":"/vdwaQDNWSMIc4bkdUB7FeXWQls8mOFZZP2PyPQ65sSYe64x8BWZ+fVgRO+RiRMvZxCA6fIewk9wxt24OgtcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","last_reissued_at":"2026-05-18T00:00:09.201837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.201837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06493","source_version":5,"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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ypzjtYqR/kk4VMDnGs0lLsWNqbIASgcKsOgxkwKiUcFo38ZVnVMChzedfiSv1HqDgm/Ll8xE5nluoUPszJtLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:49.483113Z"},"content_sha256":"c917fdd63dda34ff923d3f9916b1266d7c1223c178934176b9063f80c7dc0c68","schema_version":"1.0","event_id":"sha256:c917fdd63dda34ff923d3f9916b1266d7c1223c178934176b9063f80c7dc0c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DPY5IBQRV3AJGJWHALUB5DLAKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Method of Combinatorial Search and Coordinate Descent for Discrete Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ganzhao Yuan, Li Shen, Wei-Shi Zheng","submitted_at":"2017-06-20T14:47:47Z","abstract_excerpt":"Discrete optimization is a central problem in mathematical optimization with a broad range of applications, among which binary optimization and sparse optimization are two common ones. However, these problems are NP-hard and thus difficult to solve in general. Combinatorial search methods such as branch-and-bound and exhaustive search find the global optimal solution but are confined to small-sized problems, while coordinate descent methods such as coordinate gradient descent are efficient but often suffer from poor local minima. In this paper, we consider a hybrid method that combines the eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06493","kind":"arxiv","version":5},"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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjDQ42omHMkBPV1tEv3yd4l3CiawZnbOdP/ra0hdt/LQCHQ8JsUe8VbLrLf98CVDSyzLjq9ziUERJVt48P/dBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:49.483787Z"},"content_sha256":"3fb84f1de974006a8d193c9c46261413e8bba609b56bee3d5e1ca30b73db940d","schema_version":"1.0","event_id":"sha256:3fb84f1de974006a8d193c9c46261413e8bba609b56bee3d5e1ca30b73db940d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/bundle.json","state_url":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/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-25T13:23:49Z","links":{"resolver":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP","bundle":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/bundle.json","state":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DPY5IBQRV3AJGJWHALUB5DLAKP","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":"338f798d6a8e5917844da4c3bd0d443096886194cb1d88e0d5a785b4d37fe04d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-20T14:47:47Z","title_canon_sha256":"a38855ce9e5c43b1055c7f8dec0ea279d7e4859aa8674f167752b499c455399c"},"schema_version":"1.0","source":{"id":"1706.06493","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06493","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06493v5","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06493","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"DPY5IBQRV3AJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPY5IBQRV3AJGJWH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPY5IBQR","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3fb84f1de974006a8d193c9c46261413e8bba609b56bee3d5e1ca30b73db940d","target":"graph","created_at":"2026-05-18T00:00:09Z","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":"Discrete optimization is a central problem in mathematical optimization with a broad range of applications, among which binary optimization and sparse optimization are two common ones. However, these problems are NP-hard and thus difficult to solve in general. Combinatorial search methods such as branch-and-bound and exhaustive search find the global optimal solution but are confined to small-sized problems, while coordinate descent methods such as coordinate gradient descent are efficient but often suffer from poor local minima. In this paper, we consider a hybrid method that combines the eff","authors_text":"Ganzhao Yuan, Li Shen, Wei-Shi Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-20T14:47:47Z","title":"A Hybrid Method of Combinatorial Search and Coordinate Descent for Discrete Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06493","kind":"arxiv","version":5},"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:c917fdd63dda34ff923d3f9916b1266d7c1223c178934176b9063f80c7dc0c68","target":"record","created_at":"2026-05-18T00:00:09Z","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":"338f798d6a8e5917844da4c3bd0d443096886194cb1d88e0d5a785b4d37fe04d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-20T14:47:47Z","title_canon_sha256":"a38855ce9e5c43b1055c7f8dec0ea279d7e4859aa8674f167752b499c455399c"},"schema_version":"1.0","source":{"id":"1706.06493","kind":"arxiv","version":5}},"canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","first_computed_at":"2026-05-18T00:00:09.201837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.201837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vdwaQDNWSMIc4bkdUB7FeXWQls8mOFZZP2PyPQ65sSYe64x8BWZ+fVgRO+RiRMvZxCA6fIewk9wxt24OgtcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.202255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06493","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c917fdd63dda34ff923d3f9916b1266d7c1223c178934176b9063f80c7dc0c68","sha256:3fb84f1de974006a8d193c9c46261413e8bba609b56bee3d5e1ca30b73db940d"],"state_sha256":"1d77b11abe9c769cefad03a6d94e412d97d7fae0c3a176ae20e895ac4afe3b51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msVFc/lPM9HGsN2z4HCTceu0RS55lSon58Hm7xw088UbL59NobIr0E7754ZpOW9nh3D1h8MIS+NCq98CGGjSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:23:49.487329Z","bundle_sha256":"071114325a3b825a64e6a58da6057a9cc1c42223f87e84d4c5590dc286594d65"}}