{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J3THCQ7BBF5H23NRSHNO52NUBO","short_pith_number":"pith:J3THCQ7B","canonical_record":{"source":{"id":"1812.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"d78f68343f912deece672c3bcc7e3e694d95ac13be36d49764bc052409cb2baa","abstract_canon_sha256":"427181edcc817717d1d9ed8e8c00e291b62d64955281e682b45d4c2b4d257b16"},"schema_version":"1.0"},"canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","source":{"kind":"arxiv","id":"1812.10349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10349","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10349v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10349","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"J3THCQ7BBF5H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3THCQ7BBF5H23NR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3THCQ7B","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J3THCQ7BBF5H23NRSHNO52NUBO","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"d78f68343f912deece672c3bcc7e3e694d95ac13be36d49764bc052409cb2baa","abstract_canon_sha256":"427181edcc817717d1d9ed8e8c00e291b62d64955281e682b45d4c2b4d257b16"},"schema_version":"1.0"},"canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.385142Z","signature_b64":"LGR2Bu1CQs7wPQtcyhtv/I4J8SOwH0iT/71Wo8mjm4sZ0ts8OCzCxi4TuYB7AysTVJI2P54Yqt2f051swh/DAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","last_reissued_at":"2026-05-17T23:57:24.384583Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.384583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10349","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADIwos6ocbA4kkQv1NABfACYL8osA3yuGUMzgyelSG3UqCZ+mJYAW2z0aguFehi7WT4KuA9BW9LVcsFTvKxGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:12:06.928310Z"},"content_sha256":"634d0a533ad13125a64fa55d2ba133a9425abb2dbf8a7ef16ed9b62a7a8d3040","schema_version":"1.0","event_id":"sha256:634d0a533ad13125a64fa55d2ba133a9425abb2dbf8a7ef16ed9b62a7a8d3040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J3THCQ7BBF5H23NRSHNO52NUBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast minimization of structured convex quartics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brian Bullins","submitted_at":"2018-12-26T15:54:35Z","abstract_excerpt":"We propose faster methods for unconstrained optimization of \\emph{structured convex quartics}, which are convex functions of the form \\begin{equation*} f(x) = c^\\top x + x^\\top \\mathbf{G} x + \\mathbf{T}[x,x,x] + \\frac{1}{24} \\mathopen\\| \\mathbf{A} x \\mathclose\\|_4^4 \\end{equation*} for $c \\in \\mathbb{R}^d$, $\\mathbf{G} \\in \\mathbb{R}^{d \\times d}$, $\\mathbf{T} \\in \\mathbb{R}^{d \\times d \\times d}$, and $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ such that $\\mathbf{A}^\\top \\mathbf{A} \\succ 0$. In particular, we show how to achieve an $\\epsilon$-optimal minimizer for such functions with only $O(n^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10349","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecxasqIz/3vtot0cP/nljZ9+v9jMHD/EZ6uqv42fRECjEj5yiAK+B1n/FQ+xultghteZrilOqvYPYEW+/sGECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:12:06.929086Z"},"content_sha256":"590909b49806fb0e3e261ea3eaeb01d0972e7ab8f9276251ada31361c2be3cf8","schema_version":"1.0","event_id":"sha256:590909b49806fb0e3e261ea3eaeb01d0972e7ab8f9276251ada31361c2be3cf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/bundle.json","state_url":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3THCQ7BBF5H23NRSHNO52NUBO/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-09T06:12:06Z","links":{"resolver":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO","bundle":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/bundle.json","state":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3THCQ7BBF5H23NRSHNO52NUBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J3THCQ7BBF5H23NRSHNO52NUBO","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":"427181edcc817717d1d9ed8e8c00e291b62d64955281e682b45d4c2b4d257b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","title_canon_sha256":"d78f68343f912deece672c3bcc7e3e694d95ac13be36d49764bc052409cb2baa"},"schema_version":"1.0","source":{"id":"1812.10349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10349","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10349v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10349","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"J3THCQ7BBF5H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3THCQ7BBF5H23NR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3THCQ7B","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:590909b49806fb0e3e261ea3eaeb01d0972e7ab8f9276251ada31361c2be3cf8","target":"graph","created_at":"2026-05-17T23:57:24Z","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 propose faster methods for unconstrained optimization of \\emph{structured convex quartics}, which are convex functions of the form \\begin{equation*} f(x) = c^\\top x + x^\\top \\mathbf{G} x + \\mathbf{T}[x,x,x] + \\frac{1}{24} \\mathopen\\| \\mathbf{A} x \\mathclose\\|_4^4 \\end{equation*} for $c \\in \\mathbb{R}^d$, $\\mathbf{G} \\in \\mathbb{R}^{d \\times d}$, $\\mathbf{T} \\in \\mathbb{R}^{d \\times d \\times d}$, and $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ such that $\\mathbf{A}^\\top \\mathbf{A} \\succ 0$. In particular, we show how to achieve an $\\epsilon$-optimal minimizer for such functions with only $O(n^{","authors_text":"Brian Bullins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","title":"Fast minimization of structured convex quartics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10349","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:634d0a533ad13125a64fa55d2ba133a9425abb2dbf8a7ef16ed9b62a7a8d3040","target":"record","created_at":"2026-05-17T23:57:24Z","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":"427181edcc817717d1d9ed8e8c00e291b62d64955281e682b45d4c2b4d257b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","title_canon_sha256":"d78f68343f912deece672c3bcc7e3e694d95ac13be36d49764bc052409cb2baa"},"schema_version":"1.0","source":{"id":"1812.10349","kind":"arxiv","version":1}},"canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","first_computed_at":"2026-05-17T23:57:24.384583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:24.384583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LGR2Bu1CQs7wPQtcyhtv/I4J8SOwH0iT/71Wo8mjm4sZ0ts8OCzCxi4TuYB7AysTVJI2P54Yqt2f051swh/DAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:24.385142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:634d0a533ad13125a64fa55d2ba133a9425abb2dbf8a7ef16ed9b62a7a8d3040","sha256:590909b49806fb0e3e261ea3eaeb01d0972e7ab8f9276251ada31361c2be3cf8"],"state_sha256":"645e95e06df043079b198da38fabbc9bfca0fe43e6c951cd7cf73eae8db5d99f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZd68A44vtn1ZpfbGwVR+K5/s0DuSVEf3E9SYXzKpHUKy2mhUsx647Y1n91Gk54fwNm/75ZexzWV72K6bprIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:12:06.932964Z","bundle_sha256":"979b000a666a71c33a477fcd406c1bd8004eda0faae2d5621b6ea50f9525c546"}}