{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RKP3NGWOFBPLO6ACZLZL4GNXGU","short_pith_number":"pith:RKP3NGWO","schema_version":"1.0","canonical_sha256":"8a9fb69ace285eb77802caf2be19b735338153bc660d89cdab9aa4bd70f3e778","source":{"kind":"arxiv","id":"1608.07225","version":1},"attestation_state":"computed","paper":{"title":"On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arpad Rimmel, Joanna Tomasik, Kaourintin Le Guiban, Pierre Berg\\'e","submitted_at":"2016-08-23T14:55:43Z","abstract_excerpt":"The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the \\textit{1D-move} perturbation to improve the space exploration performed by these algorithms. Second, we propose a new evaluation function $\\psi_{p,\\sigma}$ specifically targeting the Maximin criterion.\n  Exhaustive series of experiments with Simulated Annealing, which we used as a typically well-behaving local search heuristics, confirm that our goal was reached as the result we obtained surpasses the best scores reported in the literature. Furthermore, the $\\psi_"},"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":"1608.07225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-23T14:55:43Z","cross_cats_sorted":[],"title_canon_sha256":"d5bae4803d92df8d12bbbef46ee093f530e53992599a8dee85d2897088ff52e4","abstract_canon_sha256":"f6e8dcb63f0b58d93134e9024bd9d412d92f8ea51a015b28d8b7b6a83eb8a09f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.533143Z","signature_b64":"khUw+j+tfQuN4EiZFOYGZ1IRHEmr02j2qPziFHSlb1oeDndoINIcF6gTKWM0O7VkpIFnh9Omc0mEL3HIeESFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a9fb69ace285eb77802caf2be19b735338153bc660d89cdab9aa4bd70f3e778","last_reissued_at":"2026-05-18T01:07:54.532630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.532630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arpad Rimmel, Joanna Tomasik, Kaourintin Le Guiban, Pierre Berg\\'e","submitted_at":"2016-08-23T14:55:43Z","abstract_excerpt":"The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the \\textit{1D-move} perturbation to improve the space exploration performed by these algorithms. Second, we propose a new evaluation function $\\psi_{p,\\sigma}$ specifically targeting the Maximin criterion.\n  Exhaustive series of experiments with Simulated Annealing, which we used as a typically well-behaving local search heuristics, confirm that our goal was reached as the result we obtained surpasses the best scores reported in the literature. Furthermore, the $\\psi_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07225","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07225","created_at":"2026-05-18T01:07:54.532710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07225v1","created_at":"2026-05-18T01:07:54.532710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07225","created_at":"2026-05-18T01:07:54.532710+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKP3NGWOFBPL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKP3NGWOFBPLO6AC","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKP3NGWO","created_at":"2026-05-18T12:30:41.710351+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/RKP3NGWOFBPLO6ACZLZL4GNXGU","json":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU.json","graph_json":"https://pith.science/api/pith-number/RKP3NGWOFBPLO6ACZLZL4GNXGU/graph.json","events_json":"https://pith.science/api/pith-number/RKP3NGWOFBPLO6ACZLZL4GNXGU/events.json","paper":"https://pith.science/paper/RKP3NGWO"},"agent_actions":{"view_html":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU","download_json":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU.json","view_paper":"https://pith.science/paper/RKP3NGWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07225&json=true","fetch_graph":"https://pith.science/api/pith-number/RKP3NGWOFBPLO6ACZLZL4GNXGU/graph.json","fetch_events":"https://pith.science/api/pith-number/RKP3NGWOFBPLO6ACZLZL4GNXGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU/action/storage_attestation","attest_author":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU/action/author_attestation","sign_citation":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU/action/citation_signature","submit_replication":"https://pith.science/pith/RKP3NGWOFBPLO6ACZLZL4GNXGU/action/replication_record"}},"created_at":"2026-05-18T01:07:54.532710+00:00","updated_at":"2026-05-18T01:07:54.532710+00:00"}