{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5I7YF5VCVXPP37BPVCMQ3WHEYM","short_pith_number":"pith:5I7YF5VC","canonical_record":{"source":{"id":"1508.06558","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-08-24T21:47:16Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"711a4846a3fa96ff0464e4ad325096a75e0ee2b45913fc9ef97848a1270b18ff","abstract_canon_sha256":"23774643995b41084b26a524b3680d6f5148a13caf29c9e8e2b34bfb2b2ce48b"},"schema_version":"1.0"},"canonical_sha256":"ea3f82f6a2addefdfc2fa8990dd8e4c336496e2b1073147b0dbb44db61a99a7e","source":{"kind":"arxiv","id":"1508.06558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06558","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06558v1","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06558","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"5I7YF5VCVXPP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5I7YF5VCVXPP37BP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5I7YF5VC","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5I7YF5VCVXPP37BPVCMQ3WHEYM","target":"record","payload":{"canonical_record":{"source":{"id":"1508.06558","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-08-24T21:47:16Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"711a4846a3fa96ff0464e4ad325096a75e0ee2b45913fc9ef97848a1270b18ff","abstract_canon_sha256":"23774643995b41084b26a524b3680d6f5148a13caf29c9e8e2b34bfb2b2ce48b"},"schema_version":"1.0"},"canonical_sha256":"ea3f82f6a2addefdfc2fa8990dd8e4c336496e2b1073147b0dbb44db61a99a7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:42.674409Z","signature_b64":"m0w3hgBO+HdM0T+o7zbBQ+7HaSlz7EFfOThq2VrHX1v0gE8h928qpLTaM2aqRGkkLqvQnK6LLhDSu4cM+1EHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3f82f6a2addefdfc2fa8990dd8e4c336496e2b1073147b0dbb44db61a99a7e","last_reissued_at":"2026-05-18T01:34:42.673544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:42.673544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.06558","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-18T01:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSV72TOlmgBUK+cCGdc5ddI3jmhgOfKWHbn6O2Q6w/7e8JvD1R1U0KYKH/lmIk+v+YUocHB2MGCGAowKki5MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:31:00.724578Z"},"content_sha256":"b091aa5a5f51083c6f8609dfcb713d50c73f1bc841aa11db581d74f88e17a6c5","schema_version":"1.0","event_id":"sha256:b091aa5a5f51083c6f8609dfcb713d50c73f1bc841aa11db581d74f88e17a6c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5I7YF5VCVXPP37BPVCMQ3WHEYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the minimum size of an orthogonal array","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Jay H. Beder, Margaret Ann McComack","submitted_at":"2015-08-24T21:47:16Z","abstract_excerpt":"It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.\n  We refer to an ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06558","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-18T01:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/SE/AUaOD5XeftWH7grkkw0LSJd5XzGsm6vBoBGQnvBxVbtURa+zaOGSQ2xtXEadAuY7CPOGGU3go5mO27yCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:31:00.724928Z"},"content_sha256":"faa6d51375db31f54ed4f181937041bcb743cd5b8e3ff17936230b9b38eb5dcf","schema_version":"1.0","event_id":"sha256:faa6d51375db31f54ed4f181937041bcb743cd5b8e3ff17936230b9b38eb5dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/bundle.json","state_url":"https://pith.science/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/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-28T14:31:00Z","links":{"resolver":"https://pith.science/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM","bundle":"https://pith.science/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/bundle.json","state":"https://pith.science/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5I7YF5VCVXPP37BPVCMQ3WHEYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5I7YF5VCVXPP37BPVCMQ3WHEYM","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":"23774643995b41084b26a524b3680d6f5148a13caf29c9e8e2b34bfb2b2ce48b","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-08-24T21:47:16Z","title_canon_sha256":"711a4846a3fa96ff0464e4ad325096a75e0ee2b45913fc9ef97848a1270b18ff"},"schema_version":"1.0","source":{"id":"1508.06558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06558","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06558v1","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06558","created_at":"2026-05-18T01:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"5I7YF5VCVXPP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5I7YF5VCVXPP37BP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5I7YF5VC","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:faa6d51375db31f54ed4f181937041bcb743cd5b8e3ff17936230b9b38eb5dcf","target":"graph","created_at":"2026-05-18T01:34:42Z","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":"It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.\n  We refer to an ar","authors_text":"Jay H. Beder, Margaret Ann McComack","cross_cats":["math.CO","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-08-24T21:47:16Z","title":"A note on the minimum size of an orthogonal array"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06558","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:b091aa5a5f51083c6f8609dfcb713d50c73f1bc841aa11db581d74f88e17a6c5","target":"record","created_at":"2026-05-18T01:34:42Z","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":"23774643995b41084b26a524b3680d6f5148a13caf29c9e8e2b34bfb2b2ce48b","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-08-24T21:47:16Z","title_canon_sha256":"711a4846a3fa96ff0464e4ad325096a75e0ee2b45913fc9ef97848a1270b18ff"},"schema_version":"1.0","source":{"id":"1508.06558","kind":"arxiv","version":1}},"canonical_sha256":"ea3f82f6a2addefdfc2fa8990dd8e4c336496e2b1073147b0dbb44db61a99a7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea3f82f6a2addefdfc2fa8990dd8e4c336496e2b1073147b0dbb44db61a99a7e","first_computed_at":"2026-05-18T01:34:42.673544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:42.673544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0w3hgBO+HdM0T+o7zbBQ+7HaSlz7EFfOThq2VrHX1v0gE8h928qpLTaM2aqRGkkLqvQnK6LLhDSu4cM+1EHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:42.674409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b091aa5a5f51083c6f8609dfcb713d50c73f1bc841aa11db581d74f88e17a6c5","sha256:faa6d51375db31f54ed4f181937041bcb743cd5b8e3ff17936230b9b38eb5dcf"],"state_sha256":"6d750f4c9ae9936eb31446c7a79eb8d2bd18162f7eb87bbd3bf90cfe0a2c1787"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4JG/eEvyLUa9v4twLogbqr+wuVRPkD//jH9WP5IM6PgvUcJPZZqEe+OE9PEp5Lbq3FSrxA1s1NI2z69HQabBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:31:00.726866Z","bundle_sha256":"0abf412c81a9373456ac291bf573108eb66386ed39580445e8cfc04b28cf02e2"}}