{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V3MHVE6CDUNQIXSNGYAQG3RZDQ","short_pith_number":"pith:V3MHVE6C","schema_version":"1.0","canonical_sha256":"aed87a93c21d1b045e4d3601036e391c2013427118fd499ec7490c803a144d1e","source":{"kind":"arxiv","id":"2503.20272","version":2},"attestation_state":"computed","paper":{"title":"An $(\\epsilon,\\delta)$-accurate level set estimation with a stopping criterion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hideaki Ishibashi, Hideitsu Hino, Kentaro Kutsukake, Kota Matsui","submitted_at":"2025-03-26T06:41:07Z","abstract_excerpt":"The level set estimation problem seeks to identify regions within a set of candidate points where an unknown and costly to evaluate function's value exceeds a specified threshold, providing an efficient alternative to exhaustive evaluations of function values. Traditional methods often use sequential optimization strategies to find $\\epsilon$-accurate solutions, which permit a margin around the threshold contour but frequently lack effective stopping criteria, leading to excessive exploration and inefficiencies. This paper introduces an acquisition strategy for level set estimation that incorp"},"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":"2503.20272","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-26T06:41:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f8b63316febfc0001e0be67ba4b0e668b63d846c29e441c5abc5792d91155c9e","abstract_canon_sha256":"94a9c40c02ae0e7476f85ca55cb5a9d797aa897dac2e3e7a53a23f5e5b208c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:27.456617Z","signature_b64":"wtrxS4pG/Qk1aTknV3bhQYqcnF672LDnghf0CsJSKNn5ZC4aorFsp63XQTh/M3IO1Nlci618mlh3y+MzCwEuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed87a93c21d1b045e4d3601036e391c2013427118fd499ec7490c803a144d1e","last_reissued_at":"2026-06-10T01:08:27.455532Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:27.455532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An $(\\epsilon,\\delta)$-accurate level set estimation with a stopping criterion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hideaki Ishibashi, Hideitsu Hino, Kentaro Kutsukake, Kota Matsui","submitted_at":"2025-03-26T06:41:07Z","abstract_excerpt":"The level set estimation problem seeks to identify regions within a set of candidate points where an unknown and costly to evaluate function's value exceeds a specified threshold, providing an efficient alternative to exhaustive evaluations of function values. Traditional methods often use sequential optimization strategies to find $\\epsilon$-accurate solutions, which permit a margin around the threshold contour but frequently lack effective stopping criteria, leading to excessive exploration and inefficiencies. This paper introduces an acquisition strategy for level set estimation that incorp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.20272","kind":"arxiv","version":2},"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/2503.20272/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":"2503.20272","created_at":"2026-06-10T01:08:27.455688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.20272v2","created_at":"2026-06-10T01:08:27.455688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20272","created_at":"2026-06-10T01:08:27.455688+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3MHVE6CDUNQ","created_at":"2026-06-10T01:08:27.455688+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3MHVE6CDUNQIXSN","created_at":"2026-06-10T01:08:27.455688+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3MHVE6C","created_at":"2026-06-10T01:08:27.455688+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/V3MHVE6CDUNQIXSNGYAQG3RZDQ","json":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ.json","graph_json":"https://pith.science/api/pith-number/V3MHVE6CDUNQIXSNGYAQG3RZDQ/graph.json","events_json":"https://pith.science/api/pith-number/V3MHVE6CDUNQIXSNGYAQG3RZDQ/events.json","paper":"https://pith.science/paper/V3MHVE6C"},"agent_actions":{"view_html":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ","download_json":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ.json","view_paper":"https://pith.science/paper/V3MHVE6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.20272&json=true","fetch_graph":"https://pith.science/api/pith-number/V3MHVE6CDUNQIXSNGYAQG3RZDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V3MHVE6CDUNQIXSNGYAQG3RZDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ/action/storage_attestation","attest_author":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ/action/author_attestation","sign_citation":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ/action/citation_signature","submit_replication":"https://pith.science/pith/V3MHVE6CDUNQIXSNGYAQG3RZDQ/action/replication_record"}},"created_at":"2026-06-10T01:08:27.455688+00:00","updated_at":"2026-06-10T01:08:27.455688+00:00"}