{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DPY5IBQRV3AJGJWHALUB5DLAKP","short_pith_number":"pith:DPY5IBQR","schema_version":"1.0","canonical_sha256":"1bf1d40611aec09326c702e81e8d6053ddd426d1534c3ba9e6bab179a917e1d1","source":{"kind":"arxiv","id":"1706.06493","version":5},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.06493","created_at":"2026-05-18T00:00:09.201900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06493v5","created_at":"2026-05-18T00:00:09.201900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06493","created_at":"2026-05-18T00:00:09.201900+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPY5IBQRV3AJ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPY5IBQRV3AJGJWH","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPY5IBQR","created_at":"2026-05-18T12:31:12.930513+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/DPY5IBQRV3AJGJWHALUB5DLAKP","json":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP.json","graph_json":"https://pith.science/api/pith-number/DPY5IBQRV3AJGJWHALUB5DLAKP/graph.json","events_json":"https://pith.science/api/pith-number/DPY5IBQRV3AJGJWHALUB5DLAKP/events.json","paper":"https://pith.science/paper/DPY5IBQR"},"agent_actions":{"view_html":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP","download_json":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP.json","view_paper":"https://pith.science/paper/DPY5IBQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06493&json=true","fetch_graph":"https://pith.science/api/pith-number/DPY5IBQRV3AJGJWHALUB5DLAKP/graph.json","fetch_events":"https://pith.science/api/pith-number/DPY5IBQRV3AJGJWHALUB5DLAKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/action/storage_attestation","attest_author":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/action/author_attestation","sign_citation":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/action/citation_signature","submit_replication":"https://pith.science/pith/DPY5IBQRV3AJGJWHALUB5DLAKP/action/replication_record"}},"created_at":"2026-05-18T00:00:09.201900+00:00","updated_at":"2026-05-18T00:00:09.201900+00:00"}