{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZZNIZHN37K6HG73XDV5GIXP7KY","short_pith_number":"pith:ZZNIZHN3","canonical_record":{"source":{"id":"1709.08242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-24T19:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"81ac258444608110df83b6faf09ca13fc5fdd9a8c7685a03e5b02a0aecba5433","abstract_canon_sha256":"4521ba682b3dd89bf64d8ab68cfa502be603f13e6655444c9ab176c1a3a49041"},"schema_version":"1.0"},"canonical_sha256":"ce5a8c9dbbfabc737f771d7a645dff560aa9480eb5228fe1d1b175c523509c69","source":{"kind":"arxiv","id":"1709.08242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08242","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08242v1","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08242","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZZNIZHN37K6H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZNIZHN37K6HG73X","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZNIZHN3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZZNIZHN37K6HG73XDV5GIXP7KY","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-24T19:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"81ac258444608110df83b6faf09ca13fc5fdd9a8c7685a03e5b02a0aecba5433","abstract_canon_sha256":"4521ba682b3dd89bf64d8ab68cfa502be603f13e6655444c9ab176c1a3a49041"},"schema_version":"1.0"},"canonical_sha256":"ce5a8c9dbbfabc737f771d7a645dff560aa9480eb5228fe1d1b175c523509c69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:26.043869Z","signature_b64":"lE7b0Fhi1F2Kr5UhFgZ4JrDRB7Jh9/xg6b2W9BVqoOVCT8XQOyIXP12Ef9bRHOU+VtBGLW5AjMgQCd+TKOkBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5a8c9dbbfabc737f771d7a645dff560aa9480eb5228fe1d1b175c523509c69","last_reissued_at":"2026-05-18T00:34:26.043468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:26.043468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08242","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-18T00:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+TGySgR1rTYT4iyST8684Q6zWpiCtspXs6REyc2Rjk/Z69gcW9tNnFlz0CrW/9jD3gixhyHhzjFUpUs49+XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:36:42.715709Z"},"content_sha256":"24206f63cc672f89d2eb1bd890cc8f72c78846c33df8b7f436bc4399f9a9aaf6","schema_version":"1.0","event_id":"sha256:24206f63cc672f89d2eb1bd890cc8f72c78846c33df8b7f436bc4399f9a9aaf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZZNIZHN37K6HG73XDV5GIXP7KY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best practices for comparing optimization algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vahid Beiranvand, Warren Hare, Yves Lucet","submitted_at":"2017-09-24T19:15:20Z","abstract_excerpt":"Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide suggestions for each step of the comparison process and highlight the pitfalls to avoid when evaluating the performance of optimization algorithms. We also discuss various methods of reporting the benchmarking results. Finally, some suggestions for future research are presented to improve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08242","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-18T00:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nra2zNwUD/JmJXJHCcmbIstztdWxOzuDYBiMzyTqUT/eaiyaWQ0aW2BQrJuCrZvu/6qvNKTtl9xX05MdaCBPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:36:42.716361Z"},"content_sha256":"b006363097f3b8410297a5ee20447a9ff3f194f65f9987bf3bac2dadb267888a","schema_version":"1.0","event_id":"sha256:b006363097f3b8410297a5ee20447a9ff3f194f65f9987bf3bac2dadb267888a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/bundle.json","state_url":"https://pith.science/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/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-28T15:36:42Z","links":{"resolver":"https://pith.science/pith/ZZNIZHN37K6HG73XDV5GIXP7KY","bundle":"https://pith.science/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/bundle.json","state":"https://pith.science/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZNIZHN37K6HG73XDV5GIXP7KY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZZNIZHN37K6HG73XDV5GIXP7KY","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":"4521ba682b3dd89bf64d8ab68cfa502be603f13e6655444c9ab176c1a3a49041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-24T19:15:20Z","title_canon_sha256":"81ac258444608110df83b6faf09ca13fc5fdd9a8c7685a03e5b02a0aecba5433"},"schema_version":"1.0","source":{"id":"1709.08242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08242","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08242v1","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08242","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZZNIZHN37K6H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZNIZHN37K6HG73X","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZNIZHN3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:b006363097f3b8410297a5ee20447a9ff3f194f65f9987bf3bac2dadb267888a","target":"graph","created_at":"2026-05-18T00:34:26Z","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":"Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide suggestions for each step of the comparison process and highlight the pitfalls to avoid when evaluating the performance of optimization algorithms. We also discuss various methods of reporting the benchmarking results. Finally, some suggestions for future research are presented to improve ","authors_text":"Vahid Beiranvand, Warren Hare, Yves Lucet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-24T19:15:20Z","title":"Best practices for comparing optimization algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08242","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:24206f63cc672f89d2eb1bd890cc8f72c78846c33df8b7f436bc4399f9a9aaf6","target":"record","created_at":"2026-05-18T00:34:26Z","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":"4521ba682b3dd89bf64d8ab68cfa502be603f13e6655444c9ab176c1a3a49041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-24T19:15:20Z","title_canon_sha256":"81ac258444608110df83b6faf09ca13fc5fdd9a8c7685a03e5b02a0aecba5433"},"schema_version":"1.0","source":{"id":"1709.08242","kind":"arxiv","version":1}},"canonical_sha256":"ce5a8c9dbbfabc737f771d7a645dff560aa9480eb5228fe1d1b175c523509c69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce5a8c9dbbfabc737f771d7a645dff560aa9480eb5228fe1d1b175c523509c69","first_computed_at":"2026-05-18T00:34:26.043468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:26.043468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lE7b0Fhi1F2Kr5UhFgZ4JrDRB7Jh9/xg6b2W9BVqoOVCT8XQOyIXP12Ef9bRHOU+VtBGLW5AjMgQCd+TKOkBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:26.043869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24206f63cc672f89d2eb1bd890cc8f72c78846c33df8b7f436bc4399f9a9aaf6","sha256:b006363097f3b8410297a5ee20447a9ff3f194f65f9987bf3bac2dadb267888a"],"state_sha256":"43a09d72d5df9150eb50a077cb3c68b46b0a1a8c6b9df473f4bb7deaf9698a2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPZT6e2waXvo2BO8Dxwx5e2as6nikTOr93LThUR5Xz3oK7n/d7cCi3Y3xUhPkwk+pFktUY7eBlov8erkQ3xVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:36:42.719427Z","bundle_sha256":"10bb197d6a1c847c8426d8bf67c1b685187bce33fcecccfb8eebe57182aeb2f7"}}