{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:2TYUILTK453FWO2OF7ZQAL3ZQN","short_pith_number":"pith:2TYUILTK","canonical_record":{"source":{"id":"math/0512344","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2005-12-14T21:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"013910332a6cf5fbe0515a90aea949a6edf21bde7aad26c7f466f45c2e095a6a","abstract_canon_sha256":"895d24e99fd65f90ad890d4ff50bba9017c1f6febe85603e7f68840bc4c02f03"},"schema_version":"1.0"},"canonical_sha256":"d4f1442e6ae7765b3b4e2ff3002f79834823da22c48030a10c803d805a4bd0c2","source":{"kind":"arxiv","id":"math/0512344","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0512344","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"math/0512344v3","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0512344","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"2TYUILTK453F","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_16","alias_value":"2TYUILTK453FWO2O","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_8","alias_value":"2TYUILTK","created_at":"2026-07-04T15:11:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:2TYUILTK453FWO2OF7ZQAL3ZQN","target":"record","payload":{"canonical_record":{"source":{"id":"math/0512344","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2005-12-14T21:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"013910332a6cf5fbe0515a90aea949a6edf21bde7aad26c7f466f45c2e095a6a","abstract_canon_sha256":"895d24e99fd65f90ad890d4ff50bba9017c1f6febe85603e7f68840bc4c02f03"},"schema_version":"1.0"},"canonical_sha256":"d4f1442e6ae7765b3b4e2ff3002f79834823da22c48030a10c803d805a4bd0c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:36.588193Z","signature_b64":"Zf6uhQjGADSAn94v10StR4RH/DXYWbi91iQfCBLfFHEXQPE88oELu9/Rwz4SGWEMhdQ8iU1CwsxcXKb9mmvzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f1442e6ae7765b3b4e2ff3002f79834823da22c48030a10c803d805a4bd0c2","last_reissued_at":"2026-07-04T15:11:36.587783Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:36.587783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0512344","source_version":3,"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-07-04T15:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aGpKvec2SVvtpvQWyFxy9sIszd1stoGuy3odtayFW4qHz99Y22mfNbkx8JOfVx7P7ht/euSr57AG41RCKmJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:15:03.038552Z"},"content_sha256":"2dd89e11ca8a25e4d1caf1a76d8c790a82eabb7a5844a23e87d78e339e08c063","schema_version":"1.0","event_id":"sha256:2dd89e11ca8a25e4d1caf1a76d8c790a82eabb7a5844a23e87d78e339e08c063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:2TYUILTK453FWO2OF7ZQAL3ZQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smooth Optimization with Approximate Gradient","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont","submitted_at":"2005-12-14T21:12:19Z","abstract_excerpt":"We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this means in some instances computing only a few leading eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method's computational cost. This also allows sparse problems to be solved efficiently using sparse maximum eigenvalue packages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0512344","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0512344/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HAera2vjhY42ygsm5di5BaJCuw72yixYceqx+4DMqGHt3X0wcaRXzeD1MR8mgY34NtRg+LibfXGfCXyDCIQ8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:15:03.039067Z"},"content_sha256":"c29d4de1b1b9923b3d33c78dd86190ed370d89542d15488a34227010c71ddf2e","schema_version":"1.0","event_id":"sha256:c29d4de1b1b9923b3d33c78dd86190ed370d89542d15488a34227010c71ddf2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/bundle.json","state_url":"https://pith.science/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/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-08-05T22:15:03Z","links":{"resolver":"https://pith.science/pith/2TYUILTK453FWO2OF7ZQAL3ZQN","bundle":"https://pith.science/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/bundle.json","state":"https://pith.science/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TYUILTK453FWO2OF7ZQAL3ZQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:2TYUILTK453FWO2OF7ZQAL3ZQN","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":"895d24e99fd65f90ad890d4ff50bba9017c1f6febe85603e7f68840bc4c02f03","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2005-12-14T21:12:19Z","title_canon_sha256":"013910332a6cf5fbe0515a90aea949a6edf21bde7aad26c7f466f45c2e095a6a"},"schema_version":"1.0","source":{"id":"math/0512344","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0512344","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"math/0512344v3","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0512344","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"2TYUILTK453F","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_16","alias_value":"2TYUILTK453FWO2O","created_at":"2026-07-04T15:11:36Z"},{"alias_kind":"pith_short_8","alias_value":"2TYUILTK","created_at":"2026-07-04T15:11:36Z"}],"graph_snapshots":[{"event_id":"sha256:c29d4de1b1b9923b3d33c78dd86190ed370d89542d15488a34227010c71ddf2e","target":"graph","created_at":"2026-07-04T15:11:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0512344/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this means in some instances computing only a few leading eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method's computational cost. This also allows sparse problems to be solved efficiently using sparse maximum eigenvalue packages.","authors_text":"Alexandre d'Aspremont","cross_cats":[],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2005-12-14T21:12:19Z","title":"Smooth Optimization with Approximate Gradient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0512344","kind":"arxiv","version":3},"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:2dd89e11ca8a25e4d1caf1a76d8c790a82eabb7a5844a23e87d78e339e08c063","target":"record","created_at":"2026-07-04T15:11:36Z","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":"895d24e99fd65f90ad890d4ff50bba9017c1f6febe85603e7f68840bc4c02f03","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2005-12-14T21:12:19Z","title_canon_sha256":"013910332a6cf5fbe0515a90aea949a6edf21bde7aad26c7f466f45c2e095a6a"},"schema_version":"1.0","source":{"id":"math/0512344","kind":"arxiv","version":3}},"canonical_sha256":"d4f1442e6ae7765b3b4e2ff3002f79834823da22c48030a10c803d805a4bd0c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4f1442e6ae7765b3b4e2ff3002f79834823da22c48030a10c803d805a4bd0c2","first_computed_at":"2026-07-04T15:11:36.587783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:36.587783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zf6uhQjGADSAn94v10StR4RH/DXYWbi91iQfCBLfFHEXQPE88oELu9/Rwz4SGWEMhdQ8iU1CwsxcXKb9mmvzDg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:36.588193Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0512344","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dd89e11ca8a25e4d1caf1a76d8c790a82eabb7a5844a23e87d78e339e08c063","sha256:c29d4de1b1b9923b3d33c78dd86190ed370d89542d15488a34227010c71ddf2e"],"state_sha256":"8eba42d8f7867bc9e15388a65c6c2cef5fb6124ef54d32643373b60b7b7ff49b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfvlZ7reD+U6VgOzWXUvY/+e6aLWTB9zfoeO34Ok8NONOwxEuZzw9nsVHSzLQa71DIn7HHmWRPzYHqK6dr3UBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:15:03.043996Z","bundle_sha256":"4069170349d8274b05105ff57062846a88c39ce2baa1500402bacdae82ca65fa"}}