{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B3EKTEAAZ4HMZW5EKV6R7KYVPK","short_pith_number":"pith:B3EKTEAA","canonical_record":{"source":{"id":"1401.6757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T07:40:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b64095dde67020e4d610eed9ee238b919d66a074cb2b3aeb89e231462ec43f8a","abstract_canon_sha256":"3880fc9443bd58c51ce21e8acc4f4eb0eed1167d0444fa0684bfec3279d78409"},"schema_version":"1.0"},"canonical_sha256":"0ec8a99000cf0eccdba4557d1fab157aa2a079863bdd460056e9591a7bb61aa3","source":{"kind":"arxiv","id":"1401.6757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6757","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6757v1","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6757","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"B3EKTEAAZ4HM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3EKTEAAZ4HMZW5E","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3EKTEAA","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B3EKTEAAZ4HMZW5EKV6R7KYVPK","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T07:40:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b64095dde67020e4d610eed9ee238b919d66a074cb2b3aeb89e231462ec43f8a","abstract_canon_sha256":"3880fc9443bd58c51ce21e8acc4f4eb0eed1167d0444fa0684bfec3279d78409"},"schema_version":"1.0"},"canonical_sha256":"0ec8a99000cf0eccdba4557d1fab157aa2a079863bdd460056e9591a7bb61aa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:00.734049Z","signature_b64":"xrlwDWlkE7YpnUmLx5vhmNpmTfhGuJQxmqbiC7lclNo/39He5jsXfUntFSkTXkW46YNpn3WMfssb/40iOKm7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ec8a99000cf0eccdba4557d1fab157aa2a079863bdd460056e9591a7bb61aa3","last_reissued_at":"2026-05-18T03:01:00.733329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:00.733329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6757","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-18T03:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMeycJRQBUwIRFLZyJN2MTnjw78YIcKNcNVIZPRmXLAWFcQ3s25bO9wAn+7x8GLgOIQnXiRCEjjKoXVUCOvWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:04:46.969275Z"},"content_sha256":"a420da215ac3069af0c05fc876f37fcdf7a3e2d74034906da472e0a48614efc6","schema_version":"1.0","event_id":"sha256:a420da215ac3069af0c05fc876f37fcdf7a3e2d74034906da472e0a48614efc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B3EKTEAAZ4HMZW5EKV6R7KYVPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear-Time Algorithm for Trust Region Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Elad Hazan, Tomer Koren","submitted_at":"2014-01-27T07:40:26Z","abstract_excerpt":"We consider the fundamental problem of maximizing a general quadratic function over an ellipsoidal domain, also known as the trust region problem. We give the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving this problem. Specifically, our algorithm returns an $\\epsilon$-approximate solution in time $\\tilde{O}(N/\\sqrt{\\epsilon})$, where $N$ is the number of non-zero entries in the input. This matches the runtime of Nesterov's accelerated gradient descent, suitable for the special case in which the quadratic function is concave, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6757","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-18T03:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SxIuoyN27l3CrmZ/jl0PebIvxn+IQ1uuIln9U9lr5dDURnThzUmlEpDo1gIyPP1AHaFISzC6nv6+KXlIT9NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:04:46.969972Z"},"content_sha256":"0c1e50219211842cf5ec51e9d43bf2152704d836dfc163b2f91739e69f671db4","schema_version":"1.0","event_id":"sha256:0c1e50219211842cf5ec51e9d43bf2152704d836dfc163b2f91739e69f671db4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/bundle.json","state_url":"https://pith.science/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/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-07T12:04:46Z","links":{"resolver":"https://pith.science/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK","bundle":"https://pith.science/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/bundle.json","state":"https://pith.science/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3EKTEAAZ4HMZW5EKV6R7KYVPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B3EKTEAAZ4HMZW5EKV6R7KYVPK","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":"3880fc9443bd58c51ce21e8acc4f4eb0eed1167d0444fa0684bfec3279d78409","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T07:40:26Z","title_canon_sha256":"b64095dde67020e4d610eed9ee238b919d66a074cb2b3aeb89e231462ec43f8a"},"schema_version":"1.0","source":{"id":"1401.6757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6757","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6757v1","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6757","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"B3EKTEAAZ4HM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3EKTEAAZ4HMZW5E","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3EKTEAA","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0c1e50219211842cf5ec51e9d43bf2152704d836dfc163b2f91739e69f671db4","target":"graph","created_at":"2026-05-18T03:01:00Z","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 consider the fundamental problem of maximizing a general quadratic function over an ellipsoidal domain, also known as the trust region problem. We give the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving this problem. Specifically, our algorithm returns an $\\epsilon$-approximate solution in time $\\tilde{O}(N/\\sqrt{\\epsilon})$, where $N$ is the number of non-zero entries in the input. This matches the runtime of Nesterov's accelerated gradient descent, suitable for the special case in which the quadratic function is concave, and","authors_text":"Elad Hazan, Tomer Koren","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T07:40:26Z","title":"A Linear-Time Algorithm for Trust Region Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6757","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:a420da215ac3069af0c05fc876f37fcdf7a3e2d74034906da472e0a48614efc6","target":"record","created_at":"2026-05-18T03:01:00Z","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":"3880fc9443bd58c51ce21e8acc4f4eb0eed1167d0444fa0684bfec3279d78409","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T07:40:26Z","title_canon_sha256":"b64095dde67020e4d610eed9ee238b919d66a074cb2b3aeb89e231462ec43f8a"},"schema_version":"1.0","source":{"id":"1401.6757","kind":"arxiv","version":1}},"canonical_sha256":"0ec8a99000cf0eccdba4557d1fab157aa2a079863bdd460056e9591a7bb61aa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ec8a99000cf0eccdba4557d1fab157aa2a079863bdd460056e9591a7bb61aa3","first_computed_at":"2026-05-18T03:01:00.733329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:00.733329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xrlwDWlkE7YpnUmLx5vhmNpmTfhGuJQxmqbiC7lclNo/39He5jsXfUntFSkTXkW46YNpn3WMfssb/40iOKm7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:00.734049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a420da215ac3069af0c05fc876f37fcdf7a3e2d74034906da472e0a48614efc6","sha256:0c1e50219211842cf5ec51e9d43bf2152704d836dfc163b2f91739e69f671db4"],"state_sha256":"acb5ef3c0cb1ab9d1f955b54f538ed2f1b9c30e203f28dfa9b4aca4052f71e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6QQ9EylTZx0f1APnupj6Ki8AQLOxjCBouR/lG96TemeS5qopnVF+pERyo7HrLoAcIvMc9YCc02jQuGYQl4PBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:04:46.973009Z","bundle_sha256":"52307136a834d9f6605cf18ad65d3ac0f4c2582295dfe55482fe1ae75845d03b"}}