{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KKDOWZYFDMVZXVOQL4TU3OIAM6","short_pith_number":"pith:KKDOWZYF","schema_version":"1.0","canonical_sha256":"5286eb67051b2b9bd5d05f274db900678ba89f4dbe4453394e61da81e771e393","source":{"kind":"arxiv","id":"1411.5748","version":1},"attestation_state":"computed","paper":{"title":"On the Optimality in General Sense for Odd-Block Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Dan-Hua Huang, Mu-Fa chen","submitted_at":"2014-11-21T02:53:06Z","abstract_excerpt":"In his classical article[3](1953), J.Kiefer introduced the Fibonacci search as a direct optimal method. The optimality was proved under the restriction: the total number of tests is given in advance and fixed. To avoid this restriction, some different concepts of optimality were proposed and some corresponding optimal me\\-thods were obtained in [1], [2], [5] and [6]. In particular, the even-block search was treated in [1]. This paper deals with the odd-block search. The main result is Theorem (1.15)."},"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":"1411.5748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-21T02:53:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7adc830747207b584ffb69616231d921d0c6842c3fe81ee6df0fef40b8767c43","abstract_canon_sha256":"f9d577b7c8585c3872c9802b57921049e4b7f2a803807000e07b8069dfa1bae3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:07.177570Z","signature_b64":"Dfmll8KLkgfEgYU8JTQX3/+t44487YRrcU9Xna54iqFnpQ6WoLhH10ZHP3o+voimDdCvPK4sZs3+su+0FxC/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5286eb67051b2b9bd5d05f274db900678ba89f4dbe4453394e61da81e771e393","last_reissued_at":"2026-05-18T02:33:07.177015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:07.177015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimality in General Sense for Odd-Block Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Dan-Hua Huang, Mu-Fa chen","submitted_at":"2014-11-21T02:53:06Z","abstract_excerpt":"In his classical article[3](1953), J.Kiefer introduced the Fibonacci search as a direct optimal method. The optimality was proved under the restriction: the total number of tests is given in advance and fixed. To avoid this restriction, some different concepts of optimality were proposed and some corresponding optimal me\\-thods were obtained in [1], [2], [5] and [6]. In particular, the even-block search was treated in [1]. This paper deals with the odd-block search. The main result is Theorem (1.15)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5748","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":"1411.5748","created_at":"2026-05-18T02:33:07.177100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5748v1","created_at":"2026-05-18T02:33:07.177100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5748","created_at":"2026-05-18T02:33:07.177100+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKDOWZYFDMVZ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKDOWZYFDMVZXVOQ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKDOWZYF","created_at":"2026-05-18T12:28:35.611951+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/KKDOWZYFDMVZXVOQL4TU3OIAM6","json":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6.json","graph_json":"https://pith.science/api/pith-number/KKDOWZYFDMVZXVOQL4TU3OIAM6/graph.json","events_json":"https://pith.science/api/pith-number/KKDOWZYFDMVZXVOQL4TU3OIAM6/events.json","paper":"https://pith.science/paper/KKDOWZYF"},"agent_actions":{"view_html":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6","download_json":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6.json","view_paper":"https://pith.science/paper/KKDOWZYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5748&json=true","fetch_graph":"https://pith.science/api/pith-number/KKDOWZYFDMVZXVOQL4TU3OIAM6/graph.json","fetch_events":"https://pith.science/api/pith-number/KKDOWZYFDMVZXVOQL4TU3OIAM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6/action/storage_attestation","attest_author":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6/action/author_attestation","sign_citation":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6/action/citation_signature","submit_replication":"https://pith.science/pith/KKDOWZYFDMVZXVOQL4TU3OIAM6/action/replication_record"}},"created_at":"2026-05-18T02:33:07.177100+00:00","updated_at":"2026-05-18T02:33:07.177100+00:00"}