{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NIMENDVSENJSNJQ522BLRWBIQQ","short_pith_number":"pith:NIMENDVS","schema_version":"1.0","canonical_sha256":"6a18468eb2235326a61dd682b8d828843b462cd0504eddbdc7132f24896edbc2","source":{"kind":"arxiv","id":"2605.27814","version":1},"attestation_state":"computed","paper":{"title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement W. Royer, Lindon Roberts","submitted_at":"2026-05-27T01:09:17Z","abstract_excerpt":"Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement direct search, one typically relies on positive spanning sets. This concept is somewhat decorrelated from interpolation-based sets used in model-based algorithms, another class of derivative-free optimization methods. This discrepancy is even more pronounced for constrained problems, where recent advances in the interpolation-based setting have produced a unified picture that is still lacking in the direct-search case. I"},"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":"2605.27814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T01:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"3e83d5f20500a6ea0eb2f5e9f1298dc448ff46fd47bb107cdf71538e5b2659e3","abstract_canon_sha256":"7417209e1485275a2f9f83691fe3b7b1b2df7c37e4abda0c2480148be9eb5fff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:49.338721Z","signature_b64":"BEA6oRfplZEUe7Ek7HvAS7HzWMXe1UpzOUT6uhWgl2LYEFA6wfRjcW0LoLxHEjiXFTUPM8ESzP9wNKklOW34Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a18468eb2235326a61dd682b8d828843b462cd0504eddbdc7132f24896edbc2","last_reissued_at":"2026-05-28T01:04:49.338375Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:49.338375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement W. Royer, Lindon Roberts","submitted_at":"2026-05-27T01:09:17Z","abstract_excerpt":"Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement direct search, one typically relies on positive spanning sets. This concept is somewhat decorrelated from interpolation-based sets used in model-based algorithms, another class of derivative-free optimization methods. This discrepancy is even more pronounced for constrained problems, where recent advances in the interpolation-based setting have produced a unified picture that is still lacking in the direct-search case. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27814","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/2605.27814/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.27814","created_at":"2026-05-28T01:04:49.338433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27814v1","created_at":"2026-05-28T01:04:49.338433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27814","created_at":"2026-05-28T01:04:49.338433+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIMENDVSENJS","created_at":"2026-05-28T01:04:49.338433+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIMENDVSENJSNJQ5","created_at":"2026-05-28T01:04:49.338433+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIMENDVS","created_at":"2026-05-28T01:04:49.338433+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/NIMENDVSENJSNJQ522BLRWBIQQ","json":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ.json","graph_json":"https://pith.science/api/pith-number/NIMENDVSENJSNJQ522BLRWBIQQ/graph.json","events_json":"https://pith.science/api/pith-number/NIMENDVSENJSNJQ522BLRWBIQQ/events.json","paper":"https://pith.science/paper/NIMENDVS"},"agent_actions":{"view_html":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ","download_json":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ.json","view_paper":"https://pith.science/paper/NIMENDVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27814&json=true","fetch_graph":"https://pith.science/api/pith-number/NIMENDVSENJSNJQ522BLRWBIQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NIMENDVSENJSNJQ522BLRWBIQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ/action/storage_attestation","attest_author":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ/action/author_attestation","sign_citation":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ/action/citation_signature","submit_replication":"https://pith.science/pith/NIMENDVSENJSNJQ522BLRWBIQQ/action/replication_record"}},"created_at":"2026-05-28T01:04:49.338433+00:00","updated_at":"2026-05-28T01:04:49.338433+00:00"}