{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LXLNX7N572OAMUTIWZ3CWVSQ2M","short_pith_number":"pith:LXLNX7N5","canonical_record":{"source":{"id":"1505.03173","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-12T21:32:02Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"163c65e30012149078e045af7a24b875b2fcaf57f88cb638690998ca5edc1f3d","abstract_canon_sha256":"4751b5cb66f4bcab66ca77a1d94f37c79ae3554216d29b0c8b73bcd6ff2da988"},"schema_version":"1.0"},"canonical_sha256":"5dd6dbfdbdfe9c065268b6762b5650d310e4c4a13822aeb73cd9645e3283f2d5","source":{"kind":"arxiv","id":"1505.03173","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03173","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03173v4","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03173","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"LXLNX7N572OA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXLNX7N572OAMUTI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXLNX7N5","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LXLNX7N572OAMUTIWZ3CWVSQ2M","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03173","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-12T21:32:02Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"163c65e30012149078e045af7a24b875b2fcaf57f88cb638690998ca5edc1f3d","abstract_canon_sha256":"4751b5cb66f4bcab66ca77a1d94f37c79ae3554216d29b0c8b73bcd6ff2da988"},"schema_version":"1.0"},"canonical_sha256":"5dd6dbfdbdfe9c065268b6762b5650d310e4c4a13822aeb73cd9645e3283f2d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:22.883501Z","signature_b64":"EE6UOn9CTyet7AiqhF5lcAqkGrlsvq44zS8JxXx0Q8Wd9OK8j9V86YiMiYb4ujgR59fTVfrPNT5Ox+yGTVETCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dd6dbfdbdfe9c065268b6762b5650d310e4c4a13822aeb73cd9645e3283f2d5","last_reissued_at":"2026-05-18T01:06:22.882817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:22.882817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03173","source_version":4,"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-18T01:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+rUoTpFIn4PTHutg7QmWb68OLvYljHyE0AWN6uA0jYNYlyl1u+dpsegrdmXYyC115fwpPZVCWy6mcPdtB7GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:04:30.049639Z"},"content_sha256":"c0a17d2005aaf28892b0bf95d9deae03e63edc9277e0cc72f70d31578f2eea79","schema_version":"1.0","event_id":"sha256:c0a17d2005aaf28892b0bf95d9deae03e63edc9277e0cc72f70d31578f2eea79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LXLNX7N572OAMUTIWZ3CWVSQ2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Simulated Annealing through Derandomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"stat.CO","authors_text":"Luke Bornn, Mathieu Gerber","submitted_at":"2015-05-12T21:32:02Z","abstract_excerpt":"We propose and study a version of simulated annealing (SA) on continuous state spaces based on $(t,s)_R$-sequences. The parameter $R\\in\\bar{\\mathbb{N}}$ regulates the degree of randomness of the input sequence, with the case $R=0$ corresponding to IID uniform random numbers and the limiting case $R=\\infty$ to $(t,s)$-sequences. Our main result, obtained for rectangular domains, shows that the resulting optimization method, which we refer to as QMC-SA, converges almost surely to the global optimum of the objective function $\\varphi$ for any $R\\in\\mathbb{N}$. When $\\varphi$ is univariate, we are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03173","kind":"arxiv","version":4},"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-18T01:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l020dvyAHKt2C7dyL36IYGnFdSRPix3lLp2j166g0xdmjfAB7/yW7ULCh9t5DCsGx5ExaKNt8Decjl7o7cfQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:04:30.049987Z"},"content_sha256":"3531e023990b1befd1cca7eac80d758554fe90608a36e58e03748976433e2a64","schema_version":"1.0","event_id":"sha256:3531e023990b1befd1cca7eac80d758554fe90608a36e58e03748976433e2a64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/bundle.json","state_url":"https://pith.science/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/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-07-03T06:04:30Z","links":{"resolver":"https://pith.science/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M","bundle":"https://pith.science/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/bundle.json","state":"https://pith.science/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXLNX7N572OAMUTIWZ3CWVSQ2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LXLNX7N572OAMUTIWZ3CWVSQ2M","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":"4751b5cb66f4bcab66ca77a1d94f37c79ae3554216d29b0c8b73bcd6ff2da988","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-12T21:32:02Z","title_canon_sha256":"163c65e30012149078e045af7a24b875b2fcaf57f88cb638690998ca5edc1f3d"},"schema_version":"1.0","source":{"id":"1505.03173","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03173","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03173v4","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03173","created_at":"2026-05-18T01:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"LXLNX7N572OA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXLNX7N572OAMUTI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXLNX7N5","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:3531e023990b1befd1cca7eac80d758554fe90608a36e58e03748976433e2a64","target":"graph","created_at":"2026-05-18T01:06:22Z","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":"We propose and study a version of simulated annealing (SA) on continuous state spaces based on $(t,s)_R$-sequences. The parameter $R\\in\\bar{\\mathbb{N}}$ regulates the degree of randomness of the input sequence, with the case $R=0$ corresponding to IID uniform random numbers and the limiting case $R=\\infty$ to $(t,s)$-sequences. Our main result, obtained for rectangular domains, shows that the resulting optimization method, which we refer to as QMC-SA, converges almost surely to the global optimum of the objective function $\\varphi$ for any $R\\in\\mathbb{N}$. When $\\varphi$ is univariate, we are","authors_text":"Luke Bornn, Mathieu Gerber","cross_cats":["math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-12T21:32:02Z","title":"Improving Simulated Annealing through Derandomization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03173","kind":"arxiv","version":4},"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:c0a17d2005aaf28892b0bf95d9deae03e63edc9277e0cc72f70d31578f2eea79","target":"record","created_at":"2026-05-18T01:06:22Z","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":"4751b5cb66f4bcab66ca77a1d94f37c79ae3554216d29b0c8b73bcd6ff2da988","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-12T21:32:02Z","title_canon_sha256":"163c65e30012149078e045af7a24b875b2fcaf57f88cb638690998ca5edc1f3d"},"schema_version":"1.0","source":{"id":"1505.03173","kind":"arxiv","version":4}},"canonical_sha256":"5dd6dbfdbdfe9c065268b6762b5650d310e4c4a13822aeb73cd9645e3283f2d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dd6dbfdbdfe9c065268b6762b5650d310e4c4a13822aeb73cd9645e3283f2d5","first_computed_at":"2026-05-18T01:06:22.882817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:22.882817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EE6UOn9CTyet7AiqhF5lcAqkGrlsvq44zS8JxXx0Q8Wd9OK8j9V86YiMiYb4ujgR59fTVfrPNT5Ox+yGTVETCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:22.883501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03173","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a17d2005aaf28892b0bf95d9deae03e63edc9277e0cc72f70d31578f2eea79","sha256:3531e023990b1befd1cca7eac80d758554fe90608a36e58e03748976433e2a64"],"state_sha256":"3f1b877e5d04be3a28f2a5c948ec8531752f4109a9b7390efd6444dc54f87fd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5gUeQsCq67jrncRX3PAwxcVNeDrkgO10H0R2RFF3PRQVu5O+D0l4dT+hBGuJdo1R7NfeLPaKkiWi7lp5k0FCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:04:30.051808Z","bundle_sha256":"63f613ee66d2f00cc56c5a061d2d57742c2a4eca66c82eb752ad2d70b1cd9828"}}