{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DDLDINLPXSP77VQLCW55PQK2W3","short_pith_number":"pith:DDLDINLP","canonical_record":{"source":{"id":"1103.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T13:09:40Z","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"title_canon_sha256":"9a3cf039bea2238517fa2c0553a937644d2f745855ca8ae6378da38a04caf473","abstract_canon_sha256":"8e1242827c1bda5c889341b345814a3c55e90da957a8dd23ea8280f3e4e64112"},"schema_version":"1.0"},"canonical_sha256":"18d634356fbc9fffd60b15bbd7c15ab6c0b3b29e35680212a6e1f8baf9107b24","source":{"kind":"arxiv","id":"1103.2657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2657","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2657v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2657","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"DDLDINLPXSP7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DDLDINLPXSP77VQL","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DDLDINLP","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DDLDINLPXSP77VQLCW55PQK2W3","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T13:09:40Z","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"title_canon_sha256":"9a3cf039bea2238517fa2c0553a937644d2f745855ca8ae6378da38a04caf473","abstract_canon_sha256":"8e1242827c1bda5c889341b345814a3c55e90da957a8dd23ea8280f3e4e64112"},"schema_version":"1.0"},"canonical_sha256":"18d634356fbc9fffd60b15bbd7c15ab6c0b3b29e35680212a6e1f8baf9107b24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:54.414615Z","signature_b64":"l4gXsi2XW33ZQgwxd6ntfbCdOMiVpez8kEBOrO8EcGgp7HWBdYR2jLJLNORhLFTuF4CNHUlXJAnlUmrMZq42Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18d634356fbc9fffd60b15bbd7c15ab6c0b3b29e35680212a6e1f8baf9107b24","last_reissued_at":"2026-05-18T04:26:54.413929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:54.413929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2657","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZU68jlTgjalHYp0UYYLjkZ3uDe9uYib7cq/tFC+F1vE/uUbs9ap/979zNY+ZwWtmuVojHAwU3Uvh/U/CmG+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:06.148015Z"},"content_sha256":"9d2d4e17913b45986c073d26dd318da740befaa89e4fe86893990ec10967a367","schema_version":"1.0","event_id":"sha256:9d2d4e17913b45986c073d26dd318da740befaa89e4fe86893990ec10967a367"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DDLDINLPXSP77VQLCW55PQK2W3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"primary_cat":"math.OC","authors_text":"Yaroslav D. Sergeyev","submitted_at":"2011-03-14T13:09:40Z","abstract_excerpt":"In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2657","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D75LBRQdZwr1lSL/J9c/s9O22hgR51CRU01tzLTIR3Ud1Rwjp9wxMse4/5T3YsvWJeF27ImH4jaLh2qjrWhfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:06.148679Z"},"content_sha256":"58ddcadef68b8ef05dacd3336d7903eca52cb4845f092f22dd796146a8a9a653","schema_version":"1.0","event_id":"sha256:58ddcadef68b8ef05dacd3336d7903eca52cb4845f092f22dd796146a8a9a653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDLDINLPXSP77VQLCW55PQK2W3/bundle.json","state_url":"https://pith.science/pith/DDLDINLPXSP77VQLCW55PQK2W3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDLDINLPXSP77VQLCW55PQK2W3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T11:51:06Z","links":{"resolver":"https://pith.science/pith/DDLDINLPXSP77VQLCW55PQK2W3","bundle":"https://pith.science/pith/DDLDINLPXSP77VQLCW55PQK2W3/bundle.json","state":"https://pith.science/pith/DDLDINLPXSP77VQLCW55PQK2W3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDLDINLPXSP77VQLCW55PQK2W3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DDLDINLPXSP77VQLCW55PQK2W3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e1242827c1bda5c889341b345814a3c55e90da957a8dd23ea8280f3e4e64112","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T13:09:40Z","title_canon_sha256":"9a3cf039bea2238517fa2c0553a937644d2f745855ca8ae6378da38a04caf473"},"schema_version":"1.0","source":{"id":"1103.2657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2657","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2657v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2657","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"DDLDINLPXSP7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DDLDINLPXSP77VQL","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DDLDINLP","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:58ddcadef68b8ef05dacd3336d7903eca52cb4845f092f22dd796146a8a9a653","target":"graph","created_at":"2026-05-18T04:26:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied.","authors_text":"Yaroslav D. Sergeyev","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T13:09:40Z","title":"Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2657","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d2d4e17913b45986c073d26dd318da740befaa89e4fe86893990ec10967a367","target":"record","created_at":"2026-05-18T04:26:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e1242827c1bda5c889341b345814a3c55e90da957a8dd23ea8280f3e4e64112","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T13:09:40Z","title_canon_sha256":"9a3cf039bea2238517fa2c0553a937644d2f745855ca8ae6378da38a04caf473"},"schema_version":"1.0","source":{"id":"1103.2657","kind":"arxiv","version":1}},"canonical_sha256":"18d634356fbc9fffd60b15bbd7c15ab6c0b3b29e35680212a6e1f8baf9107b24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18d634356fbc9fffd60b15bbd7c15ab6c0b3b29e35680212a6e1f8baf9107b24","first_computed_at":"2026-05-18T04:26:54.413929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:54.413929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4gXsi2XW33ZQgwxd6ntfbCdOMiVpez8kEBOrO8EcGgp7HWBdYR2jLJLNORhLFTuF4CNHUlXJAnlUmrMZq42Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:54.414615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d2d4e17913b45986c073d26dd318da740befaa89e4fe86893990ec10967a367","sha256:58ddcadef68b8ef05dacd3336d7903eca52cb4845f092f22dd796146a8a9a653"],"state_sha256":"16f4dda621e6dbdb3d3083aadfaac8bc70da85264e1a309b26084eb6788551a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CuUq8YYpE/hGPYfaJyFUhWgX5jI09XOUFPakIVCZqZ0oSo1XT6kfrmCkyTUBDb7COIO8wuy3+SI1mWBYlJqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:06.152394Z","bundle_sha256":"c995e2a1ca313e2e015c2e51aac87143e7179e2e1556f796c5db8706cac76b3c"}}