{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HCPZNMTZNACUHJMXDP53B5UN2A","short_pith_number":"pith:HCPZNMTZ","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"},"canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","source":{"kind":"arxiv","id":"1806.10626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10626","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10626v1","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10626","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"HCPZNMTZNACU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HCPZNMTZNACUHJMX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HCPZNMTZ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HCPZNMTZNACUHJMXDP53B5UN2A","target":"record","payload":{"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"},"canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","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"},"source_kind":"arxiv","source_id":"1806.10626","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhRjCJ2Tj9MH4Rzyrt90lhrQHq3jQGxih/2ms/HJ6sfN4lFOI8WKF7F4ihRlQmQtSjAeckl7ia/gq5CThvQfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:25.528957Z"},"content_sha256":"9787377ad83278ec3f86cbc42f3177a7e5e00bf849cecb310c19edeed027a064","schema_version":"1.0","event_id":"sha256:9787377ad83278ec3f86cbc42f3177a7e5e00bf849cecb310c19edeed027a064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HCPZNMTZNACUHJMXDP53B5UN2A","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IhLViBI/n2eQyG6xeN+TvKrFDNHH6jehHtSsCBdGk5J/eywL/sNsTjciy9VEMowTVrS5xkRGLWrM8m+QL0rBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:25.529310Z"},"content_sha256":"60df55ac39b0ed4781b4acbeb872df29fcf22f1fa6df12f2b6a0b574314ea601","schema_version":"1.0","event_id":"sha256:60df55ac39b0ed4781b4acbeb872df29fcf22f1fa6df12f2b6a0b574314ea601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/bundle.json","state_url":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCPZNMTZNACUHJMXDP53B5UN2A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T00:26:25Z","links":{"resolver":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A","bundle":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/bundle.json","state":"https://pith.science/pith/HCPZNMTZNACUHJMXDP53B5UN2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCPZNMTZNACUHJMXDP53B5UN2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HCPZNMTZNACUHJMXDP53B5UN2A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e34d166b6136f453833855c3711be27bf05fba0645b0a562a1c319bd4b7bd34d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T18:05:06Z","title_canon_sha256":"6a6774183b506dd5e646afe8bca342df10200bc1626df86419bf0cfc6881d161"},"schema_version":"1.0","source":{"id":"1806.10626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10626","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10626v1","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10626","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"HCPZNMTZNACU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HCPZNMTZNACUHJMX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HCPZNMTZ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:60df55ac39b0ed4781b4acbeb872df29fcf22f1fa6df12f2b6a0b574314ea601","target":"graph","created_at":"2026-05-18T00:12:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amit Levi, Yuichi Yoshida","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T18:05:06Z","title":"Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10626","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9787377ad83278ec3f86cbc42f3177a7e5e00bf849cecb310c19edeed027a064","target":"record","created_at":"2026-05-18T00:12:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e34d166b6136f453833855c3711be27bf05fba0645b0a562a1c319bd4b7bd34d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T18:05:06Z","title_canon_sha256":"6a6774183b506dd5e646afe8bca342df10200bc1626df86419bf0cfc6881d161"},"schema_version":"1.0","source":{"id":"1806.10626","kind":"arxiv","version":1}},"canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"389f96b279680543a5971bfbb0f68dd005e17aef6ca5a0a324a55c259c28755a","first_computed_at":"2026-05-18T00:12:08.405021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:08.405021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6HOdIsOoUCjG24aIMRCSUjA4dJ2yNekojM5d0G0oErlWJLvM475J94Db5Km3AMACG9w+Oy2ExdXSdfRfNFlECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:08.405480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9787377ad83278ec3f86cbc42f3177a7e5e00bf849cecb310c19edeed027a064","sha256:60df55ac39b0ed4781b4acbeb872df29fcf22f1fa6df12f2b6a0b574314ea601"],"state_sha256":"a9c3c10ca2b6db744126b05aab06b074cefcd7371588d78657e2e8c78f578ac5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rd0ntVbua6v+0ih1yOH+eCV0AXq48fvTqiRODTV06zZGTLwlkSeuCBxq8a8lxzhedv4dmmyoX6edB6B5Gvp8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:26:25.531839Z","bundle_sha256":"593872f9a637f06fb2730894c939b858a445ba3ec1f3f80c905247eecc9f6db8"}}