{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JVW7K5P7O24Z7QWOWNK4VKBPTL","short_pith_number":"pith:JVW7K5P7","canonical_record":{"source":{"id":"1303.6529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-03-26T15:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"08361548b3f18a0036719bd80424f34f3658f864fb8be56ce35b75dd012c1077","abstract_canon_sha256":"58263e7d7aa4108b00a427956c5022164ba1a5330d83fb5b5a59d94a0d387d2b"},"schema_version":"1.0"},"canonical_sha256":"4d6df575ff76b99fc2ceb355caa82f9ae202c9a8b046fd61cc4af05ed5f7fb87","source":{"kind":"arxiv","id":"1303.6529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6529","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6529v2","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6529","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"JVW7K5P7O24Z","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVW7K5P7O24Z7QWO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVW7K5P7","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JVW7K5P7O24Z7QWOWNK4VKBPTL","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-03-26T15:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"08361548b3f18a0036719bd80424f34f3658f864fb8be56ce35b75dd012c1077","abstract_canon_sha256":"58263e7d7aa4108b00a427956c5022164ba1a5330d83fb5b5a59d94a0d387d2b"},"schema_version":"1.0"},"canonical_sha256":"4d6df575ff76b99fc2ceb355caa82f9ae202c9a8b046fd61cc4af05ed5f7fb87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.420460Z","signature_b64":"5BaZOL7L4IEYR53rU5WcaGnQFGoOmQhb37Al3AnrEMY2B95RXkxPHG1fN2oZ8kiAuES7I9MZK3lIW+124jClBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d6df575ff76b99fc2ceb355caa82f9ae202c9a8b046fd61cc4af05ed5f7fb87","last_reissued_at":"2026-05-18T03:29:38.420035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.420035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6529","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-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuxlVXT2SDtiRLb5mjT9KEaoDI/4AVyObmRAGSJ2ATf7wLsSXjdT51G2bP+uPcssCPBznUOMPo52eYDlTQ7eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:22:46.659043Z"},"content_sha256":"073e04de08dc23e6bff4d70774a457d952079619afc409ea56d92a94fd339abc","schema_version":"1.0","event_id":"sha256:073e04de08dc23e6bff4d70774a457d952079619afc409ea56d92a94fd339abc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JVW7K5P7O24Z7QWOWNK4VKBPTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random generation of optimal saturated designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Roberto Fontana","submitted_at":"2013-03-26T15:29:24Z","abstract_excerpt":"Efficient algorithms for searching for optimal saturated designs are widely available. They maximize a given efficiency measure (such as D-optimality) and provide an optimum design. Nevertheless, they do not guarantee a \\emph{global} optimal design. Indeed, they start from an initial random design and find a local optimal design. If the initial design is changed the optimum found will, in general, be different. A natural question arises. Should we stop at the design found or should we run the algorithm again in search of a better design? This paper uses very recent methods and software for dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6529","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-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IB6yiQnT4AdW6iIJCxe4xwwrbe9aPotmDm3UGwW/Ef4y6d2Qej/yzMZJf5OYb4u4ZuXAtAuOwfANk2KIIW7ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:22:46.659685Z"},"content_sha256":"7c39410c08855c0c57f50be0df1b3259d8188b6eace8e87972d010a1d8d09e9d","schema_version":"1.0","event_id":"sha256:7c39410c08855c0c57f50be0df1b3259d8188b6eace8e87972d010a1d8d09e9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/bundle.json","state_url":"https://pith.science/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/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-02T22:22:46Z","links":{"resolver":"https://pith.science/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL","bundle":"https://pith.science/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/bundle.json","state":"https://pith.science/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVW7K5P7O24Z7QWOWNK4VKBPTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JVW7K5P7O24Z7QWOWNK4VKBPTL","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":"58263e7d7aa4108b00a427956c5022164ba1a5330d83fb5b5a59d94a0d387d2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-03-26T15:29:24Z","title_canon_sha256":"08361548b3f18a0036719bd80424f34f3658f864fb8be56ce35b75dd012c1077"},"schema_version":"1.0","source":{"id":"1303.6529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6529","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6529v2","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6529","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"JVW7K5P7O24Z","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVW7K5P7O24Z7QWO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVW7K5P7","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:7c39410c08855c0c57f50be0df1b3259d8188b6eace8e87972d010a1d8d09e9d","target":"graph","created_at":"2026-05-18T03:29:38Z","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":"Efficient algorithms for searching for optimal saturated designs are widely available. They maximize a given efficiency measure (such as D-optimality) and provide an optimum design. Nevertheless, they do not guarantee a \\emph{global} optimal design. Indeed, they start from an initial random design and find a local optimal design. If the initial design is changed the optimum found will, in general, be different. A natural question arises. Should we stop at the design found or should we run the algorithm again in search of a better design? This paper uses very recent methods and software for dis","authors_text":"Roberto Fontana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-03-26T15:29:24Z","title":"Random generation of optimal saturated designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6529","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:073e04de08dc23e6bff4d70774a457d952079619afc409ea56d92a94fd339abc","target":"record","created_at":"2026-05-18T03:29:38Z","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":"58263e7d7aa4108b00a427956c5022164ba1a5330d83fb5b5a59d94a0d387d2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-03-26T15:29:24Z","title_canon_sha256":"08361548b3f18a0036719bd80424f34f3658f864fb8be56ce35b75dd012c1077"},"schema_version":"1.0","source":{"id":"1303.6529","kind":"arxiv","version":2}},"canonical_sha256":"4d6df575ff76b99fc2ceb355caa82f9ae202c9a8b046fd61cc4af05ed5f7fb87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d6df575ff76b99fc2ceb355caa82f9ae202c9a8b046fd61cc4af05ed5f7fb87","first_computed_at":"2026-05-18T03:29:38.420035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.420035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5BaZOL7L4IEYR53rU5WcaGnQFGoOmQhb37Al3AnrEMY2B95RXkxPHG1fN2oZ8kiAuES7I9MZK3lIW+124jClBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.420460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:073e04de08dc23e6bff4d70774a457d952079619afc409ea56d92a94fd339abc","sha256:7c39410c08855c0c57f50be0df1b3259d8188b6eace8e87972d010a1d8d09e9d"],"state_sha256":"49784f8d1c6179b8fc3920ffde3054c1c3825e4d92fd4caf66e4342329ab90a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntJOX5dlhpn26Fz111OEh9AZ2akRopwmTbNn4g9acINi1fH31dBdpR1KPWGtAyn0/x6RxfD8BxpY+cy0kjJxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:22:46.662392Z","bundle_sha256":"575d4427bd201bf0eca47cfbdeda9f5a6c1877d38451360e12f11fa53ca1a203"}}