{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QKGCFNT4OKL7BEGSM5EX7ZWBM3","short_pith_number":"pith:QKGCFNT4","canonical_record":{"source":{"id":"1709.03076","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-09-10T09:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"be9da2bb5bd25880b0728876b37ecd268bd520a117ecfd565b96151dbc87e8fb","abstract_canon_sha256":"c60c37112cae3b3f68d49906e1e70da26774aff3fbd9825da8bc35a2b19e5f01"},"schema_version":"1.0"},"canonical_sha256":"828c22b67c7297f090d267497fe6c166d971a1ab3200988190c4afc982d82783","source":{"kind":"arxiv","id":"1709.03076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03076","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03076v2","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03076","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"QKGCFNT4OKL7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKGCFNT4OKL7BEGS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKGCFNT4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QKGCFNT4OKL7BEGSM5EX7ZWBM3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03076","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-09-10T09:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"be9da2bb5bd25880b0728876b37ecd268bd520a117ecfd565b96151dbc87e8fb","abstract_canon_sha256":"c60c37112cae3b3f68d49906e1e70da26774aff3fbd9825da8bc35a2b19e5f01"},"schema_version":"1.0"},"canonical_sha256":"828c22b67c7297f090d267497fe6c166d971a1ab3200988190c4afc982d82783","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:10.983980Z","signature_b64":"1KoFGAq5i79wVwiTBcm3KpHKcjMGxkwpm6x3lUkkuljxFpgCVLZtpPyouJHjtatvpWOQP83pn3g/8lPaW/MHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"828c22b67c7297f090d267497fe6c166d971a1ab3200988190c4afc982d82783","last_reissued_at":"2026-05-18T00:13:10.983206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:10.983206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03076","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjeSrKGz53BW5lu8W9If0QoFIUy8ru/Fr7Mg8wGIfYABgbhj4PEadQmO9mfM8njCd4cmtNMmB86ga+yKlemGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:15:51.245341Z"},"content_sha256":"8ff2139e517880bef07a7f0f354c2065b3be3d56a9fea211963e13ba11f7ddad","schema_version":"1.0","event_id":"sha256:8ff2139e517880bef07a7f0f354c2065b3be3d56a9fea211963e13ba11f7ddad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QKGCFNT4OKL7BEGSM5EX7ZWBM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Grouping Genetic Algorithm for Joint Stratification and Sample Allocation Designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Mervyn O'Luing, S. Armagan Tarim, Steven Prestwich","submitted_at":"2017-09-10T09:47:56Z","abstract_excerpt":"Predicting the cheapest sample size for the optimal stratification in multivariate survey design is a problem in cases where the population frame is large. A solution exists that iteratively searches for the minimum sample size necessary to meet accuracy constraints in partitions of atomic strata created by the Cartesian product of auxiliary variables into larger strata. The optimal stratification can be found by testing all possible partitions. However the number of possible partitions grows exponentially with the number of initial strata. There are alternative ways of modelling this problem,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03076","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vwW7N8dL8smXq3n554G7DEUgp7NWjbbySljoNkfVId/lkzCXcsOzIPlF7Y9eY0WfjgZp83TdOkpTlBU6hGHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:15:51.246017Z"},"content_sha256":"90be0f5337856f946f533dca34e0c8999e2f62e543bef4db89d5ee3862d5bc79","schema_version":"1.0","event_id":"sha256:90be0f5337856f946f533dca34e0c8999e2f62e543bef4db89d5ee3862d5bc79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/bundle.json","state_url":"https://pith.science/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/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-31T01:15:51Z","links":{"resolver":"https://pith.science/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3","bundle":"https://pith.science/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/bundle.json","state":"https://pith.science/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKGCFNT4OKL7BEGSM5EX7ZWBM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QKGCFNT4OKL7BEGSM5EX7ZWBM3","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":"c60c37112cae3b3f68d49906e1e70da26774aff3fbd9825da8bc35a2b19e5f01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-09-10T09:47:56Z","title_canon_sha256":"be9da2bb5bd25880b0728876b37ecd268bd520a117ecfd565b96151dbc87e8fb"},"schema_version":"1.0","source":{"id":"1709.03076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03076","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03076v2","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03076","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"QKGCFNT4OKL7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKGCFNT4OKL7BEGS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKGCFNT4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:90be0f5337856f946f533dca34e0c8999e2f62e543bef4db89d5ee3862d5bc79","target":"graph","created_at":"2026-05-18T00:13:10Z","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":"Predicting the cheapest sample size for the optimal stratification in multivariate survey design is a problem in cases where the population frame is large. A solution exists that iteratively searches for the minimum sample size necessary to meet accuracy constraints in partitions of atomic strata created by the Cartesian product of auxiliary variables into larger strata. The optimal stratification can be found by testing all possible partitions. However the number of possible partitions grows exponentially with the number of initial strata. There are alternative ways of modelling this problem,","authors_text":"Mervyn O'Luing, S. Armagan Tarim, Steven Prestwich","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-09-10T09:47:56Z","title":"A Grouping Genetic Algorithm for Joint Stratification and Sample Allocation Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03076","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:8ff2139e517880bef07a7f0f354c2065b3be3d56a9fea211963e13ba11f7ddad","target":"record","created_at":"2026-05-18T00:13:10Z","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":"c60c37112cae3b3f68d49906e1e70da26774aff3fbd9825da8bc35a2b19e5f01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-09-10T09:47:56Z","title_canon_sha256":"be9da2bb5bd25880b0728876b37ecd268bd520a117ecfd565b96151dbc87e8fb"},"schema_version":"1.0","source":{"id":"1709.03076","kind":"arxiv","version":2}},"canonical_sha256":"828c22b67c7297f090d267497fe6c166d971a1ab3200988190c4afc982d82783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"828c22b67c7297f090d267497fe6c166d971a1ab3200988190c4afc982d82783","first_computed_at":"2026-05-18T00:13:10.983206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:10.983206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1KoFGAq5i79wVwiTBcm3KpHKcjMGxkwpm6x3lUkkuljxFpgCVLZtpPyouJHjtatvpWOQP83pn3g/8lPaW/MHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:10.983980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ff2139e517880bef07a7f0f354c2065b3be3d56a9fea211963e13ba11f7ddad","sha256:90be0f5337856f946f533dca34e0c8999e2f62e543bef4db89d5ee3862d5bc79"],"state_sha256":"f9a62f7ae2d00eea467f6171049a05300e89b5604540adb1f236aed0eb2d304b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D193Ru/QsXHKcmntx0fHg26ZOlmVvTgVzf8R8U2GKUqCSsJDQzXY5rYmNkLk2RQhDLLmVp+BV3mpXfK7oLWoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:15:51.249765Z","bundle_sha256":"70c3d05ebbb887c05085c8e0b0642f463a32db4ade0a1e75913941dc7e201bb3"}}