{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T5QBOWFGYULUMSO6UCK5CT3KMD","short_pith_number":"pith:T5QBOWFG","canonical_record":{"source":{"id":"1710.01427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-04T00:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"c537a99e6609659223c87dffd865835cd23819ba512442a654fdcc9e4a0ca925","abstract_canon_sha256":"fc7882cb532ae072786605c086849d131aa40776853becbf204b1786295c0c6e"},"schema_version":"1.0"},"canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","source":{"kind":"arxiv","id":"1710.01427","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01427","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01427v2","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01427","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"T5QBOWFGYULU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T5QBOWFGYULUMSO6","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T5QBOWFG","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T5QBOWFGYULUMSO6UCK5CT3KMD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-04T00:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"c537a99e6609659223c87dffd865835cd23819ba512442a654fdcc9e4a0ca925","abstract_canon_sha256":"fc7882cb532ae072786605c086849d131aa40776853becbf204b1786295c0c6e"},"schema_version":"1.0"},"canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.930057Z","signature_b64":"6ZaT/NrVPVrVfLjOf75aVydu14+gNCvO/W9zhMmzgXLVtT2XUNdKRCue3D6uSt7cVwijJoqDgxu2D1RtL0R4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","last_reissued_at":"2026-05-18T00:09:52.929497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.929497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01427","source_version":2,"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTNqPnBUFIkmlEeLR2AqS6+4BMbff9Riyn2V+pTKWBnQApFU6Apbe0T+887YMr8kimTpAoRBW5oCvvJ101vUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:12:17.082689Z"},"content_sha256":"dbe8008e13ac1a107cef9995aa63a04b5f445f2d218490142789825eb1a47ddf","schema_version":"1.0","event_id":"sha256:dbe8008e13ac1a107cef9995aa63a04b5f445f2d218490142789825eb1a47ddf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T5QBOWFGYULUMSO6UCK5CT3KMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Calculation of Regular Simplex Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ian Coope, Rachael Tappenden","submitted_at":"2017-10-04T00:29:13Z","abstract_excerpt":"Simplex gradients are an essential feature of many derivative free optimization algorithms, and can be employed, for example, as part of the process of defining a direction of search, or as part of a termination criterion. The calculation of a general simplex gradient in $\\mathbb{R}^n$ can be computationally expensive, and often requires an overhead operation count of $\\mathcal{O}(n^3)$ and in some algorithms a storage overhead of $\\mathcal{O}(n^2)$. In this work we demonstrate that the linear algebra overhead and storage costs can be reduced, both to $\\mathcal{O}(n)$, when the simplex employe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01427","kind":"arxiv","version":2},"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BMDbcJMOw3l8mdaSI4P48xr60r6jpMXi/85W5+qKMkTfybC7uXAMr5yPoNJ2ZM5VF/lAXp1qYtvm246aphtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:12:17.083379Z"},"content_sha256":"3a688c37681bcb2484f9fc877ca5d9f872e3da31fb14255d05005075a98e9eb7","schema_version":"1.0","event_id":"sha256:3a688c37681bcb2484f9fc877ca5d9f872e3da31fb14255d05005075a98e9eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/bundle.json","state_url":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/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-05-24T07:12:17Z","links":{"resolver":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD","bundle":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/bundle.json","state":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T5QBOWFGYULUMSO6UCK5CT3KMD","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":"fc7882cb532ae072786605c086849d131aa40776853becbf204b1786295c0c6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-04T00:29:13Z","title_canon_sha256":"c537a99e6609659223c87dffd865835cd23819ba512442a654fdcc9e4a0ca925"},"schema_version":"1.0","source":{"id":"1710.01427","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01427","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01427v2","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01427","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"T5QBOWFGYULU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T5QBOWFGYULUMSO6","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T5QBOWFG","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3a688c37681bcb2484f9fc877ca5d9f872e3da31fb14255d05005075a98e9eb7","target":"graph","created_at":"2026-05-18T00:09:52Z","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":"Simplex gradients are an essential feature of many derivative free optimization algorithms, and can be employed, for example, as part of the process of defining a direction of search, or as part of a termination criterion. The calculation of a general simplex gradient in $\\mathbb{R}^n$ can be computationally expensive, and often requires an overhead operation count of $\\mathcal{O}(n^3)$ and in some algorithms a storage overhead of $\\mathcal{O}(n^2)$. In this work we demonstrate that the linear algebra overhead and storage costs can be reduced, both to $\\mathcal{O}(n)$, when the simplex employe","authors_text":"Ian Coope, Rachael Tappenden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-04T00:29:13Z","title":"Efficient Calculation of Regular Simplex Gradients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01427","kind":"arxiv","version":2},"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:dbe8008e13ac1a107cef9995aa63a04b5f445f2d218490142789825eb1a47ddf","target":"record","created_at":"2026-05-18T00:09:52Z","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":"fc7882cb532ae072786605c086849d131aa40776853becbf204b1786295c0c6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-04T00:29:13Z","title_canon_sha256":"c537a99e6609659223c87dffd865835cd23819ba512442a654fdcc9e4a0ca925"},"schema_version":"1.0","source":{"id":"1710.01427","kind":"arxiv","version":2}},"canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","first_computed_at":"2026-05-18T00:09:52.929497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:52.929497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ZaT/NrVPVrVfLjOf75aVydu14+gNCvO/W9zhMmzgXLVtT2XUNdKRCue3D6uSt7cVwijJoqDgxu2D1RtL0R4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:52.930057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01427","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbe8008e13ac1a107cef9995aa63a04b5f445f2d218490142789825eb1a47ddf","sha256:3a688c37681bcb2484f9fc877ca5d9f872e3da31fb14255d05005075a98e9eb7"],"state_sha256":"2c83bed86cd7980ee09552dc54b70ae83f96a5b9d22dc458b7257b0dc5418c30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ykl8wmFwkdpR/RODzAmfMFQUOH3Gs5juv0JrMpozQVk2+M151RatcflPVkQyq9CHegM4SKO6bx0rpK4idYPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T07:12:17.086261Z","bundle_sha256":"9aff93ee8b6fdb1fc720214bad04705762363011614ffd95bb0858963bede209"}}