{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7V65D7NLZTU2MPCYTQTCRUWFS3","short_pith_number":"pith:7V65D7NL","schema_version":"1.0","canonical_sha256":"fd7dd1fdabcce9a63c589c2628d2c596e37f3e5d83cbc28e96e25fec12177289","source":{"kind":"arxiv","id":"1703.09193","version":1},"attestation_state":"computed","paper":{"title":"A Cost-based Optimizer for Gradient Descent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Divy Agrawal, Jorge-Arnulfo Quian\\'e-Ruiz, Sanjay Chawla, Saravanan Thirumuruganathan, Zoi Kaoudi","submitted_at":"2017-03-27T17:24:54Z","abstract_excerpt":"As the use of machine learning (ML) permeates into diverse application domains, there is an urgent need to support a declarative framework for ML. Ideally, a user will specify an ML task in a high-level and easy-to-use language and the framework will invoke the appropriate algorithms and system configurations to execute it. An important observation towards designing such a framework is that many ML tasks can be expressed as mathematical optimization problems, which take a specific form. Furthermore, these optimization problems can be efficiently solved using variations of the gradient descent "},"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":"1703.09193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-27T17:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"3d33b9ed16bc355cc077910a6fa60f6190e08de71d274f2a5f0bb01fcf848101","abstract_canon_sha256":"a7a4e5eca691a4154bd8a10bc8e711f6e69c311771a94649abf41c249457268e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:54.010486Z","signature_b64":"r2d3OerHqyUN81qyagTaVQy+VgGs95ab9EDJ07MRR6IwtMBe4/bQGiQ7Hmt2eC8klr83g3I7aM4t3agbMb7gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7dd1fdabcce9a63c589c2628d2c596e37f3e5d83cbc28e96e25fec12177289","last_reissued_at":"2026-05-18T00:47:54.009731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:54.009731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cost-based Optimizer for Gradient Descent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Divy Agrawal, Jorge-Arnulfo Quian\\'e-Ruiz, Sanjay Chawla, Saravanan Thirumuruganathan, Zoi Kaoudi","submitted_at":"2017-03-27T17:24:54Z","abstract_excerpt":"As the use of machine learning (ML) permeates into diverse application domains, there is an urgent need to support a declarative framework for ML. Ideally, a user will specify an ML task in a high-level and easy-to-use language and the framework will invoke the appropriate algorithms and system configurations to execute it. An important observation towards designing such a framework is that many ML tasks can be expressed as mathematical optimization problems, which take a specific form. Furthermore, these optimization problems can be efficiently solved using variations of the gradient descent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09193","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.09193","created_at":"2026-05-18T00:47:54.009857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09193v1","created_at":"2026-05-18T00:47:54.009857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09193","created_at":"2026-05-18T00:47:54.009857+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V65D7NLZTU2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V65D7NLZTU2MPCY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V65D7NL","created_at":"2026-05-18T12:31:05.417338+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/7V65D7NLZTU2MPCYTQTCRUWFS3","json":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3.json","graph_json":"https://pith.science/api/pith-number/7V65D7NLZTU2MPCYTQTCRUWFS3/graph.json","events_json":"https://pith.science/api/pith-number/7V65D7NLZTU2MPCYTQTCRUWFS3/events.json","paper":"https://pith.science/paper/7V65D7NL"},"agent_actions":{"view_html":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3","download_json":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3.json","view_paper":"https://pith.science/paper/7V65D7NL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09193&json=true","fetch_graph":"https://pith.science/api/pith-number/7V65D7NLZTU2MPCYTQTCRUWFS3/graph.json","fetch_events":"https://pith.science/api/pith-number/7V65D7NLZTU2MPCYTQTCRUWFS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3/action/storage_attestation","attest_author":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3/action/author_attestation","sign_citation":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3/action/citation_signature","submit_replication":"https://pith.science/pith/7V65D7NLZTU2MPCYTQTCRUWFS3/action/replication_record"}},"created_at":"2026-05-18T00:47:54.009857+00:00","updated_at":"2026-05-18T00:47:54.009857+00:00"}