{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VBUJRU4MLF7EXPA6Z3QFVW5B47","short_pith_number":"pith:VBUJRU4M","schema_version":"1.0","canonical_sha256":"a86898d38c597e4bbc1ecee05adba1e7d875d42574ec5d1211f83de2637233b8","source":{"kind":"arxiv","id":"1404.6635","version":3},"attestation_state":"computed","paper":{"title":"Greedy Block Coordinate Descent (GBCD) Method for High Dimensional Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.CO"],"primary_cat":"math.OC","authors_text":"Dinesh Garg, Gugan Thoppe, Vivek S. Borkar","submitted_at":"2014-04-26T11:36:46Z","abstract_excerpt":"High dimensional unconstrained quadratic programs (UQPs) involving massive datasets are now common in application areas such as web, social networks, etc. Unless computational resources that match up to these datasets are available, solving such problems using classical UQP methods is very difficult. This paper discusses alternatives. We first define high dimensional compliant (HDC) methods for UQPs---methods that can solve high dimensional UQPs by adapting to available computational resources. We then show that the class of block Kaczmarz and block coordinate descent (BCD) are the only existi"},"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":"1404.6635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-26T11:36:46Z","cross_cats_sorted":["cs.SY","stat.CO"],"title_canon_sha256":"9dc8907828f77aa91476588abe6c68355ad53ef3873b778b3309f124de9fa771","abstract_canon_sha256":"ae45e12568c55dd1325a33c227b9dc180fbfb72d9ad89426aa060f4974576798"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.932529Z","signature_b64":"x84wFi0Kn476qovFSu6OKRBCJaLSR1ZYIXKjv2t1qHC1ySdnGPtNjRJiIjFdNykYAVOCwQGmcfCT0xniOD2FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86898d38c597e4bbc1ecee05adba1e7d875d42574ec5d1211f83de2637233b8","last_reissued_at":"2026-05-18T02:47:43.931701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.931701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Block Coordinate Descent (GBCD) Method for High Dimensional Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.CO"],"primary_cat":"math.OC","authors_text":"Dinesh Garg, Gugan Thoppe, Vivek S. Borkar","submitted_at":"2014-04-26T11:36:46Z","abstract_excerpt":"High dimensional unconstrained quadratic programs (UQPs) involving massive datasets are now common in application areas such as web, social networks, etc. Unless computational resources that match up to these datasets are available, solving such problems using classical UQP methods is very difficult. This paper discusses alternatives. We first define high dimensional compliant (HDC) methods for UQPs---methods that can solve high dimensional UQPs by adapting to available computational resources. We then show that the class of block Kaczmarz and block coordinate descent (BCD) are the only existi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6635","kind":"arxiv","version":3},"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":"1404.6635","created_at":"2026-05-18T02:47:43.931823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6635v3","created_at":"2026-05-18T02:47:43.931823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6635","created_at":"2026-05-18T02:47:43.931823+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBUJRU4MLF7E","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBUJRU4MLF7EXPA6","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBUJRU4M","created_at":"2026-05-18T12:28:52.271510+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/VBUJRU4MLF7EXPA6Z3QFVW5B47","json":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47.json","graph_json":"https://pith.science/api/pith-number/VBUJRU4MLF7EXPA6Z3QFVW5B47/graph.json","events_json":"https://pith.science/api/pith-number/VBUJRU4MLF7EXPA6Z3QFVW5B47/events.json","paper":"https://pith.science/paper/VBUJRU4M"},"agent_actions":{"view_html":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47","download_json":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47.json","view_paper":"https://pith.science/paper/VBUJRU4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6635&json=true","fetch_graph":"https://pith.science/api/pith-number/VBUJRU4MLF7EXPA6Z3QFVW5B47/graph.json","fetch_events":"https://pith.science/api/pith-number/VBUJRU4MLF7EXPA6Z3QFVW5B47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47/action/storage_attestation","attest_author":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47/action/author_attestation","sign_citation":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47/action/citation_signature","submit_replication":"https://pith.science/pith/VBUJRU4MLF7EXPA6Z3QFVW5B47/action/replication_record"}},"created_at":"2026-05-18T02:47:43.931823+00:00","updated_at":"2026-05-18T02:47:43.931823+00:00"}