{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TUYCGC3TNNQCTJSW25NEX655WE","short_pith_number":"pith:TUYCGC3T","schema_version":"1.0","canonical_sha256":"9d30230b736b6029a656d75a4bfbbdb1028f12158faddc9e2c00291eb332c3e1","source":{"kind":"arxiv","id":"1602.03938","version":3},"attestation_state":"computed","paper":{"title":"Minimax and minimax projection designs using clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Simon Mak, V. Roshan Joseph","submitted_at":"2016-02-12T01:04:54Z","abstract_excerpt":"Minimax designs provide a uniform coverage of a design space $\\mathcal{X} \\subseteq \\mathbb{R}^p$ by minimizing the maximum distance from any point in this space to its nearest design point. Although minimax designs have many useful applications, e.g., for optimal sensor allocation or as space-filling designs for computer experiments, there has been little work in developing algorithms for generating these designs, due to its computational complexity. In this paper, a new hybrid algorithm combining particle swarm optimization and clustering is proposed for generating minimax designs on any con"},"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":"1602.03938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-02-12T01:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"50e56e0701d3f71e368eab955f095e4068f45abbd7deaa8c4a1a5f892b2c94ad","abstract_canon_sha256":"83a7073faca9e8b21b8cfe18acd498f1b2575860d132b094ee282ad0fa6656f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.339642Z","signature_b64":"BtIbyE8F85CRv6YPuAFv/WhAOnFmS+DIkNNptEqzmLRLHE6Ylz1fLI/mj/y3NO9+ZIp/YrdxUM4rGM8IDwoiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d30230b736b6029a656d75a4bfbbdb1028f12158faddc9e2c00291eb332c3e1","last_reissued_at":"2026-05-18T01:00:53.339002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.339002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax and minimax projection designs using clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Simon Mak, V. Roshan Joseph","submitted_at":"2016-02-12T01:04:54Z","abstract_excerpt":"Minimax designs provide a uniform coverage of a design space $\\mathcal{X} \\subseteq \\mathbb{R}^p$ by minimizing the maximum distance from any point in this space to its nearest design point. Although minimax designs have many useful applications, e.g., for optimal sensor allocation or as space-filling designs for computer experiments, there has been little work in developing algorithms for generating these designs, due to its computational complexity. In this paper, a new hybrid algorithm combining particle swarm optimization and clustering is proposed for generating minimax designs on any con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03938","kind":"arxiv","version":3},"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":"1602.03938","created_at":"2026-05-18T01:00:53.339113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03938v3","created_at":"2026-05-18T01:00:53.339113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03938","created_at":"2026-05-18T01:00:53.339113+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUYCGC3TNNQC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUYCGC3TNNQCTJSW","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUYCGC3T","created_at":"2026-05-18T12:30:46.583412+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/TUYCGC3TNNQCTJSW25NEX655WE","json":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE.json","graph_json":"https://pith.science/api/pith-number/TUYCGC3TNNQCTJSW25NEX655WE/graph.json","events_json":"https://pith.science/api/pith-number/TUYCGC3TNNQCTJSW25NEX655WE/events.json","paper":"https://pith.science/paper/TUYCGC3T"},"agent_actions":{"view_html":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE","download_json":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE.json","view_paper":"https://pith.science/paper/TUYCGC3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03938&json=true","fetch_graph":"https://pith.science/api/pith-number/TUYCGC3TNNQCTJSW25NEX655WE/graph.json","fetch_events":"https://pith.science/api/pith-number/TUYCGC3TNNQCTJSW25NEX655WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE/action/storage_attestation","attest_author":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE/action/author_attestation","sign_citation":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE/action/citation_signature","submit_replication":"https://pith.science/pith/TUYCGC3TNNQCTJSW25NEX655WE/action/replication_record"}},"created_at":"2026-05-18T01:00:53.339113+00:00","updated_at":"2026-05-18T01:00:53.339113+00:00"}