{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4Z7IPLCKU3BN5GPDWXIH2SAL2K","short_pith_number":"pith:4Z7IPLCK","canonical_record":{"source":{"id":"1705.03809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-10T15:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"ed46b1d6f45bae0effd04128d3ab5561ef1aa5b41df187d166e08802f658416f","abstract_canon_sha256":"3fbf0f50bc2509ed29a6d0f9ddd23cb0aeaaefd3fb65a2094e91fb4d61f8beb0"},"schema_version":"1.0"},"canonical_sha256":"e67e87ac4aa6c2de99e3b5d07d480bd2931767414b79819c41117f791a96cb85","source":{"kind":"arxiv","id":"1705.03809","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03809","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03809v2","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03809","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"4Z7IPLCKU3BN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4Z7IPLCKU3BN5GPD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4Z7IPLCK","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4Z7IPLCKU3BN5GPDWXIH2SAL2K","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-10T15:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"ed46b1d6f45bae0effd04128d3ab5561ef1aa5b41df187d166e08802f658416f","abstract_canon_sha256":"3fbf0f50bc2509ed29a6d0f9ddd23cb0aeaaefd3fb65a2094e91fb4d61f8beb0"},"schema_version":"1.0"},"canonical_sha256":"e67e87ac4aa6c2de99e3b5d07d480bd2931767414b79819c41117f791a96cb85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:22.057596Z","signature_b64":"YRFQAsGEp+8cCXQ5MoXwiuh3dWvkECXTPEoKlGfyJEq5L3Qt3bG9Jrv1f3EYGBRuE7tNDclESaAEho5BhEIeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e67e87ac4aa6c2de99e3b5d07d480bd2931767414b79819c41117f791a96cb85","last_reissued_at":"2026-05-18T00:13:22.056876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:22.056876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03809","source_version":2,"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-18T00:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSZ0jmAR3g62uF45599Q5Dw4b1UnTyIrnwUsnuVWwWWBkquNt1pw0UpEYzif403cx6QY8Eu5X7XT2rNL49+GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:20:12.250490Z"},"content_sha256":"ed4ffb6e16dfba1ca4f49655eaafe0a7116d37fb73adb3463ec1055106e8118f","schema_version":"1.0","event_id":"sha256:ed4ffb6e16dfba1ca4f49655eaafe0a7116d37fb73adb3463ec1055106e8118f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4Z7IPLCKU3BN5GPDWXIH2SAL2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Experimental Analysis of a Generalized Stratified Sampling Algorithm for Hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Simon Wessing","submitted_at":"2017-05-10T15:08:04Z","abstract_excerpt":"Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n dimensions has to be an n-th power of an integer number. This exponential growth makes its application unattractive or even infeasible in high dimensions. We present a stratification procedure that eliminates this problem by a recursive binary partitioning of the hypercube. The algorithm runs in linear time and tries to minimize the hyperboxes' deviation from the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03809","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":""},"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-18T00:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zY4hvPj9O5PNNzgldOD4HzThMLa9sujc8cZBuym6ujOXb5SJVWa2fI/R5iIaMmTkugZudyKdrAzMJ++aeE1mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:20:12.251251Z"},"content_sha256":"20a079e5ab09eab33b7b805655c2884417347d6f023816e0860eb4aeb0dfa93e","schema_version":"1.0","event_id":"sha256:20a079e5ab09eab33b7b805655c2884417347d6f023816e0860eb4aeb0dfa93e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/bundle.json","state_url":"https://pith.science/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/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-06-06T12:20:12Z","links":{"resolver":"https://pith.science/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K","bundle":"https://pith.science/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/bundle.json","state":"https://pith.science/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4Z7IPLCKU3BN5GPDWXIH2SAL2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4Z7IPLCKU3BN5GPDWXIH2SAL2K","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":"3fbf0f50bc2509ed29a6d0f9ddd23cb0aeaaefd3fb65a2094e91fb4d61f8beb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-10T15:08:04Z","title_canon_sha256":"ed46b1d6f45bae0effd04128d3ab5561ef1aa5b41df187d166e08802f658416f"},"schema_version":"1.0","source":{"id":"1705.03809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03809","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03809v2","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03809","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"4Z7IPLCKU3BN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4Z7IPLCKU3BN5GPD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4Z7IPLCK","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:20a079e5ab09eab33b7b805655c2884417347d6f023816e0860eb4aeb0dfa93e","target":"graph","created_at":"2026-05-18T00:13:22Z","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":"Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n dimensions has to be an n-th power of an integer number. This exponential growth makes its application unattractive or even infeasible in high dimensions. We present a stratification procedure that eliminates this problem by a recursive binary partitioning of the hypercube. The algorithm runs in linear time and tries to minimize the hyperboxes' deviation from the c","authors_text":"Simon Wessing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-10T15:08:04Z","title":"Experimental Analysis of a Generalized Stratified Sampling Algorithm for Hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03809","kind":"arxiv","version":2},"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:ed4ffb6e16dfba1ca4f49655eaafe0a7116d37fb73adb3463ec1055106e8118f","target":"record","created_at":"2026-05-18T00:13:22Z","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":"3fbf0f50bc2509ed29a6d0f9ddd23cb0aeaaefd3fb65a2094e91fb4d61f8beb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-10T15:08:04Z","title_canon_sha256":"ed46b1d6f45bae0effd04128d3ab5561ef1aa5b41df187d166e08802f658416f"},"schema_version":"1.0","source":{"id":"1705.03809","kind":"arxiv","version":2}},"canonical_sha256":"e67e87ac4aa6c2de99e3b5d07d480bd2931767414b79819c41117f791a96cb85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e67e87ac4aa6c2de99e3b5d07d480bd2931767414b79819c41117f791a96cb85","first_computed_at":"2026-05-18T00:13:22.056876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:22.056876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YRFQAsGEp+8cCXQ5MoXwiuh3dWvkECXTPEoKlGfyJEq5L3Qt3bG9Jrv1f3EYGBRuE7tNDclESaAEho5BhEIeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:22.057596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed4ffb6e16dfba1ca4f49655eaafe0a7116d37fb73adb3463ec1055106e8118f","sha256:20a079e5ab09eab33b7b805655c2884417347d6f023816e0860eb4aeb0dfa93e"],"state_sha256":"4a96b17f95afe3b912de60a3d5dee70194442ef6b3608bebf3c18d5e55b272c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxpffDXYFBIe4B4J5JyvhWXYoQ3wYGLLYj/P9Yj7RfbpCzK/sNk7ndxYK/LqxW2HO1dBZOcDyaLMDjX911IcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:20:12.255160Z","bundle_sha256":"bfea345ca2805de94e718e3dcec6d6d80f7c964f17a59074a975cf207be5aef5"}}