{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HCPZNMTZNACUHJMXDP53B5UN2A","short_pith_number":"pith:HCPZNMTZ","schema_version":"1.0","canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","source":{"kind":"arxiv","id":"1806.10626","version":1},"attestation_state":"computed","paper":{"title":"Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, Yuichi Yoshida","submitted_at":"2018-06-27T18:05:06Z","abstract_excerpt":"We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle the case where the minimization is done over a sphere. The analysis of our algorithms is obtained by combining results from graph limit theory, along with a novel spectral decomposition of matrices. Specifically, we prove that a matrix $A$ can be decomposed into a structured part and a pseudorandom part, where the structured part is a block matrix with a polyl"},"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":"1806.10626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T18:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"6a6774183b506dd5e646afe8bca342df10200bc1626df86419bf0cfc6881d161","abstract_canon_sha256":"e34d166b6136f453833855c3711be27bf05fba0645b0a562a1c319bd4b7bd34d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.405480Z","signature_b64":"6HOdIsOoUCjG24aIMRCSUjA4dJ2yNekojM5d0G0oErlWJLvM475J94Db5Km3AMACG9w+Oy2ExdXSdfRfNFlECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","last_reissued_at":"2026-05-18T00:12:08.405021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:08.405021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, Yuichi Yoshida","submitted_at":"2018-06-27T18:05:06Z","abstract_excerpt":"We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle the case where the minimization is done over a sphere. The analysis of our algorithms is obtained by combining results from graph limit theory, along with a novel spectral decomposition of matrices. Specifically, we prove that a matrix $A$ can be decomposed into a structured part and a pseudorandom part, where the structured part is a block matrix with a polyl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10626","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":"1806.10626","created_at":"2026-05-18T00:12:08.405092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10626v1","created_at":"2026-05-18T00:12:08.405092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10626","created_at":"2026-05-18T00:12:08.405092+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCPZNMTZNACU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCPZNMTZNACUHJMX","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCPZNMTZ","created_at":"2026-05-18T12:32:28.185984+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/HCPZNMTZNACUHJMXDP53B5UN2A","json":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A.json","graph_json":"https://pith.science/api/pith-number/HCPZNMTZNACUHJMXDP53B5UN2A/graph.json","events_json":"https://pith.science/api/pith-number/HCPZNMTZNACUHJMXDP53B5UN2A/events.json","paper":"https://pith.science/paper/HCPZNMTZ"},"agent_actions":{"view_html":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A","download_json":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A.json","view_paper":"https://pith.science/paper/HCPZNMTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10626&json=true","fetch_graph":"https://pith.science/api/pith-number/HCPZNMTZNACUHJMXDP53B5UN2A/graph.json","fetch_events":"https://pith.science/api/pith-number/HCPZNMTZNACUHJMXDP53B5UN2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/action/storage_attestation","attest_author":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/action/author_attestation","sign_citation":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/action/citation_signature","submit_replication":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/action/replication_record"}},"created_at":"2026-05-18T00:12:08.405092+00:00","updated_at":"2026-05-18T00:12:08.405092+00:00"}