{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TNQR26KSSXARQMDI7XICKXKDGI","short_pith_number":"pith:TNQR26KS","schema_version":"1.0","canonical_sha256":"9b611d795295c1183068fdd0255d4332144ac94a7a52e15055a2d603f18daf67","source":{"kind":"arxiv","id":"1608.07179","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Quadratic Functions in Constant Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kohei Hayashi, Yuichi Yoshida","submitted_at":"2016-08-25T14:43:17Z","abstract_excerpt":"A sampling-based optimization method for quadratic functions is proposed. Our method approximately solves the following $n$-dimensional quadratic minimization problem in constant time, which is independent of $n$: $z^*=\\min_{\\mathbf{v} \\in \\mathbb{R}^n}\\langle\\mathbf{v}, A \\mathbf{v}\\rangle + n\\langle\\mathbf{v}, \\mathrm{diag}(\\mathbf{d})\\mathbf{v}\\rangle + n\\langle\\mathbf{b}, \\mathbf{v}\\rangle$, where $A \\in \\mathbb{R}^{n \\times n}$ is a matrix and $\\mathbf{d},\\mathbf{b} \\in \\mathbb{R}^n$ are vectors. Our theoretical analysis specifies the number of samples $k(\\delta, \\epsilon)$ such that the "},"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":"1608.07179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-25T14:43:17Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"a916ed080c12da14fa73f7b8f3244e77d6ef6d65cbf7bcb3d2fc989f1e9daa1c","abstract_canon_sha256":"0d706ce152dd879e86dc1bd2d6071c30575debfcc550ca33e7cc4adc727e2272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:28.327260Z","signature_b64":"w35cdx0wTNFWNW58WFYjL4sjfAI+hHUN5lFvnIV8qtjJHfGF6XO0yHqf8Oeq229xIhBrp3x2X6Ds4OvYXwMxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b611d795295c1183068fdd0255d4332144ac94a7a52e15055a2d603f18daf67","last_reissued_at":"2026-05-18T01:06:28.326649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:28.326649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Quadratic Functions in Constant Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kohei Hayashi, Yuichi Yoshida","submitted_at":"2016-08-25T14:43:17Z","abstract_excerpt":"A sampling-based optimization method for quadratic functions is proposed. Our method approximately solves the following $n$-dimensional quadratic minimization problem in constant time, which is independent of $n$: $z^*=\\min_{\\mathbf{v} \\in \\mathbb{R}^n}\\langle\\mathbf{v}, A \\mathbf{v}\\rangle + n\\langle\\mathbf{v}, \\mathrm{diag}(\\mathbf{d})\\mathbf{v}\\rangle + n\\langle\\mathbf{b}, \\mathbf{v}\\rangle$, where $A \\in \\mathbb{R}^{n \\times n}$ is a matrix and $\\mathbf{d},\\mathbf{b} \\in \\mathbb{R}^n$ are vectors. Our theoretical analysis specifies the number of samples $k(\\delta, \\epsilon)$ such that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07179","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":"1608.07179","created_at":"2026-05-18T01:06:28.326736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07179v1","created_at":"2026-05-18T01:06:28.326736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07179","created_at":"2026-05-18T01:06:28.326736+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNQR26KSSXAR","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNQR26KSSXARQMDI","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNQR26KS","created_at":"2026-05-18T12:30:44.179134+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/TNQR26KSSXARQMDI7XICKXKDGI","json":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI.json","graph_json":"https://pith.science/api/pith-number/TNQR26KSSXARQMDI7XICKXKDGI/graph.json","events_json":"https://pith.science/api/pith-number/TNQR26KSSXARQMDI7XICKXKDGI/events.json","paper":"https://pith.science/paper/TNQR26KS"},"agent_actions":{"view_html":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI","download_json":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI.json","view_paper":"https://pith.science/paper/TNQR26KS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07179&json=true","fetch_graph":"https://pith.science/api/pith-number/TNQR26KSSXARQMDI7XICKXKDGI/graph.json","fetch_events":"https://pith.science/api/pith-number/TNQR26KSSXARQMDI7XICKXKDGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI/action/storage_attestation","attest_author":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI/action/author_attestation","sign_citation":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI/action/citation_signature","submit_replication":"https://pith.science/pith/TNQR26KSSXARQMDI7XICKXKDGI/action/replication_record"}},"created_at":"2026-05-18T01:06:28.326736+00:00","updated_at":"2026-05-18T01:06:28.326736+00:00"}