{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T5QBOWFGYULUMSO6UCK5CT3KMD","short_pith_number":"pith:T5QBOWFG","schema_version":"1.0","canonical_sha256":"9f601758a6c5174649dea095d14f6a60ecf2c3ff29e72203c5f1aced36d2c8ee","source":{"kind":"arxiv","id":"1710.01427","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.01427","created_at":"2026-05-18T00:09:52.929591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01427v2","created_at":"2026-05-18T00:09:52.929591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01427","created_at":"2026-05-18T00:09:52.929591+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5QBOWFGYULU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5QBOWFGYULUMSO6","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5QBOWFG","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD","json":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD.json","graph_json":"https://pith.science/api/pith-number/T5QBOWFGYULUMSO6UCK5CT3KMD/graph.json","events_json":"https://pith.science/api/pith-number/T5QBOWFGYULUMSO6UCK5CT3KMD/events.json","paper":"https://pith.science/paper/T5QBOWFG"},"agent_actions":{"view_html":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD","download_json":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD.json","view_paper":"https://pith.science/paper/T5QBOWFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01427&json=true","fetch_graph":"https://pith.science/api/pith-number/T5QBOWFGYULUMSO6UCK5CT3KMD/graph.json","fetch_events":"https://pith.science/api/pith-number/T5QBOWFGYULUMSO6UCK5CT3KMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/action/storage_attestation","attest_author":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/action/author_attestation","sign_citation":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/action/citation_signature","submit_replication":"https://pith.science/pith/T5QBOWFGYULUMSO6UCK5CT3KMD/action/replication_record"}},"created_at":"2026-05-18T00:09:52.929591+00:00","updated_at":"2026-05-18T00:09:52.929591+00:00"}