{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OEFJBO7CW4ZH44WKN4IQI7UAAN","short_pith_number":"pith:OEFJBO7C","canonical_record":{"source":{"id":"2507.01629","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2025-07-02T11:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"11f218045970d67ff77db3ac6583168739e54473ec8af3413274cc39b560ed46","abstract_canon_sha256":"729c5d0126545cc928222712669d8ee37334e0c0103a0165f73b1968cecd7134"},"schema_version":"1.0"},"canonical_sha256":"710a90bbe2b7327e72ca6f11047e8003699806a0951d302da8021ab2535ab3f4","source":{"kind":"arxiv","id":"2507.01629","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01629","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01629v1","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01629","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"OEFJBO7CW4ZH","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_16","alias_value":"OEFJBO7CW4ZH44WK","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_8","alias_value":"OEFJBO7C","created_at":"2026-07-05T11:30:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OEFJBO7CW4ZH44WKN4IQI7UAAN","target":"record","payload":{"canonical_record":{"source":{"id":"2507.01629","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2025-07-02T11:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"11f218045970d67ff77db3ac6583168739e54473ec8af3413274cc39b560ed46","abstract_canon_sha256":"729c5d0126545cc928222712669d8ee37334e0c0103a0165f73b1968cecd7134"},"schema_version":"1.0"},"canonical_sha256":"710a90bbe2b7327e72ca6f11047e8003699806a0951d302da8021ab2535ab3f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:52.221886Z","signature_b64":"QGnGCfZJB74zGRRMO4L1tkd7/YX5smqUdSl/YuESI4ahSjgVBgMwHh9Tf/YkvN/j1C774uqWp7Sww4nVLT5cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"710a90bbe2b7327e72ca6f11047e8003699806a0951d302da8021ab2535ab3f4","last_reissued_at":"2026-07-05T11:30:52.221324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:52.221324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.01629","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-07-05T11:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnX0rCJ3AeBsoLhc3DL7HdsrIabkPfT03Ua2n+fCW81VuwBAtfCgqXnWJ3GEItYF3dWJP4fq5x92S88c08blDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:30:50.859389Z"},"content_sha256":"ba065fd8b0af32ce2eaacf26864434fec13a7ba76d3ccaed16fdd4b2e1e60951","schema_version":"1.0","event_id":"sha256:ba065fd8b0af32ce2eaacf26864434fec13a7ba76d3ccaed16fdd4b2e1e60951"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OEFJBO7CW4ZH44WKN4IQI7UAAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Estimation of the Number of Algorithm Runs in Stochastic Optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Peter Koro\\v{s}ec, Tome Eftimov","submitted_at":"2025-07-02T11:59:00Z","abstract_excerpt":"Determining the number of algorithm runs is a critical aspect of experimental design, as it directly influences the experiment's duration and the reliability of its outcomes. This paper introduces an empirical approach to estimating the required number of runs per problem instance for accurate estimation of the performance of the continuous single-objective stochastic optimization algorithm. The method leverages probability theory, incorporating a robustness check to identify significant imbalances in the data distribution relative to the mean, and dynamically adjusts the number of runs during"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.01629/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-05T11:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eprEZCqzR1WcX3+3eHNxndmerqkgLlcyXJPyjq89yRCzahJGt3k78OGS+zhkcJxCbUi+OrYaallV3X0qbxKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:30:50.859763Z"},"content_sha256":"c0c6c1c8dd2249d65af160cdb74bb37abe0d2a1d9bd6768870ae4debbbe91395","schema_version":"1.0","event_id":"sha256:c0c6c1c8dd2249d65af160cdb74bb37abe0d2a1d9bd6768870ae4debbbe91395"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/bundle.json","state_url":"https://pith.science/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/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-21T06:30:50Z","links":{"resolver":"https://pith.science/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN","bundle":"https://pith.science/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/bundle.json","state":"https://pith.science/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEFJBO7CW4ZH44WKN4IQI7UAAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OEFJBO7CW4ZH44WKN4IQI7UAAN","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":"729c5d0126545cc928222712669d8ee37334e0c0103a0165f73b1968cecd7134","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2025-07-02T11:59:00Z","title_canon_sha256":"11f218045970d67ff77db3ac6583168739e54473ec8af3413274cc39b560ed46"},"schema_version":"1.0","source":{"id":"2507.01629","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01629","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01629v1","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01629","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"OEFJBO7CW4ZH","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_16","alias_value":"OEFJBO7CW4ZH44WK","created_at":"2026-07-05T11:30:52Z"},{"alias_kind":"pith_short_8","alias_value":"OEFJBO7C","created_at":"2026-07-05T11:30:52Z"}],"graph_snapshots":[{"event_id":"sha256:c0c6c1c8dd2249d65af160cdb74bb37abe0d2a1d9bd6768870ae4debbbe91395","target":"graph","created_at":"2026-07-05T11:30: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.01629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determining the number of algorithm runs is a critical aspect of experimental design, as it directly influences the experiment's duration and the reliability of its outcomes. This paper introduces an empirical approach to estimating the required number of runs per problem instance for accurate estimation of the performance of the continuous single-objective stochastic optimization algorithm. The method leverages probability theory, incorporating a robustness check to identify significant imbalances in the data distribution relative to the mean, and dynamically adjusts the number of runs during","authors_text":"Peter Koro\\v{s}ec, Tome Eftimov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2025-07-02T11:59:00Z","title":"Adaptive Estimation of the Number of Algorithm Runs in Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01629","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:ba065fd8b0af32ce2eaacf26864434fec13a7ba76d3ccaed16fdd4b2e1e60951","target":"record","created_at":"2026-07-05T11:30: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":"729c5d0126545cc928222712669d8ee37334e0c0103a0165f73b1968cecd7134","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2025-07-02T11:59:00Z","title_canon_sha256":"11f218045970d67ff77db3ac6583168739e54473ec8af3413274cc39b560ed46"},"schema_version":"1.0","source":{"id":"2507.01629","kind":"arxiv","version":1}},"canonical_sha256":"710a90bbe2b7327e72ca6f11047e8003699806a0951d302da8021ab2535ab3f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"710a90bbe2b7327e72ca6f11047e8003699806a0951d302da8021ab2535ab3f4","first_computed_at":"2026-07-05T11:30:52.221324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:52.221324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGnGCfZJB74zGRRMO4L1tkd7/YX5smqUdSl/YuESI4ahSjgVBgMwHh9Tf/YkvN/j1C774uqWp7Sww4nVLT5cBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:52.221886Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.01629","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba065fd8b0af32ce2eaacf26864434fec13a7ba76d3ccaed16fdd4b2e1e60951","sha256:c0c6c1c8dd2249d65af160cdb74bb37abe0d2a1d9bd6768870ae4debbbe91395"],"state_sha256":"73a63fb9c67ad10b0632e98e8943f0f4996f2db7632622f06f114c498b9bf7f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9gw5JIA/dl1blLzJF1OLNxmBPDgvC2R6nMXOvqfN4BWFYfXXMYAodDl3MpWcYafHKFc7GyC80ulbZjuourBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T06:30:50.862478Z","bundle_sha256":"8eecf6fb68851eb7e17becc3d1512560baab13fc2b98ff85dafffc783ce3da7c"}}