{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VVALMVT75UYNZLHDJ62S5WKPCM","short_pith_number":"pith:VVALMVT7","canonical_record":{"source":{"id":"1812.05145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"f97797f40be53a27dd3c191a4af573b21b65a52cceb20a2cfcd3e7bc906ee877","abstract_canon_sha256":"fcdde267a89284e848ff6beac22a8e03c5c396e23edc09658628cf24269cb95a"},"schema_version":"1.0"},"canonical_sha256":"ad40b6567fed30dcace34fb52ed94f130718d51694a1e1f6b800399cec3982d8","source":{"kind":"arxiv","id":"1812.05145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05145","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05145v1","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05145","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"VVALMVT75UYN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VVALMVT75UYNZLHD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VVALMVT7","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VVALMVT75UYNZLHDJ62S5WKPCM","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"f97797f40be53a27dd3c191a4af573b21b65a52cceb20a2cfcd3e7bc906ee877","abstract_canon_sha256":"fcdde267a89284e848ff6beac22a8e03c5c396e23edc09658628cf24269cb95a"},"schema_version":"1.0"},"canonical_sha256":"ad40b6567fed30dcace34fb52ed94f130718d51694a1e1f6b800399cec3982d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.402529Z","signature_b64":"5NKWR/3i6ihbl/fjNTX+hamqjGvbSR0k3SNjgmCuwRdwEv9fibKYKQz+galRhRnT3WXWlIWuvHjljiwukRM+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad40b6567fed30dcace34fb52ed94f130718d51694a1e1f6b800399cec3982d8","last_reissued_at":"2026-05-17T23:58:24.401807Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.401807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05145","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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5tOsZPhnZYjUWzXn7HJSJFzTAxNlod/dOYAwZ8u/Z9fCMBBAYk6wRqIRiY2U8IG123hGmUe8GjnxfoefQVKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:09:22.373555Z"},"content_sha256":"4d93b056b97573b3b7fc3d5384eedda1bedb03361cf8af7e79eb7ae0a6097618","schema_version":"1.0","event_id":"sha256:4d93b056b97573b3b7fc3d5384eedda1bedb03361cf8af7e79eb7ae0a6097618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VVALMVT75UYNZLHDJ62S5WKPCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for orthogonal arrays with repeated rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson","submitted_at":"2018-12-12T20:16:07Z","abstract_excerpt":"In this expository paper, we mainly study orthogonal arrays (OAs) of strength two having a row that is repeated $m$ times. It turns out that the Plackett-Burman bound (\\cite{PB}) can be strengthened by a factor of $m$ for orthogonal arrays of strength two that contain a row that is repeated $m$ times. This is a consequence of a more general result due to Mukerjee, Qian and Wu \\cite{Muk} that applies to orthogonal arrays of arbitrary strength $t$.\n  We examine several proofs of the Plackett-Burman bound and discuss which of these proofs can be strengthened to yield the aforementioned bound for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05145","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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ru7WpmRzFhgrvFl+BjinFa3Ive2hssaPrwQtjyE2aBanXJ3ha21zgbDE1iZrYubb6v0T1PUxYcnQlrddyDhJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:09:22.374210Z"},"content_sha256":"d40bb1c0766b12e49a16b53b6fe0f759bea22dac15ef82c18fa9a116a5d284b3","schema_version":"1.0","event_id":"sha256:d40bb1c0766b12e49a16b53b6fe0f759bea22dac15ef82c18fa9a116a5d284b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVALMVT75UYNZLHDJ62S5WKPCM/bundle.json","state_url":"https://pith.science/pith/VVALMVT75UYNZLHDJ62S5WKPCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVALMVT75UYNZLHDJ62S5WKPCM/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-09T06:09:22Z","links":{"resolver":"https://pith.science/pith/VVALMVT75UYNZLHDJ62S5WKPCM","bundle":"https://pith.science/pith/VVALMVT75UYNZLHDJ62S5WKPCM/bundle.json","state":"https://pith.science/pith/VVALMVT75UYNZLHDJ62S5WKPCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVALMVT75UYNZLHDJ62S5WKPCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VVALMVT75UYNZLHDJ62S5WKPCM","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":"fcdde267a89284e848ff6beac22a8e03c5c396e23edc09658628cf24269cb95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:16:07Z","title_canon_sha256":"f97797f40be53a27dd3c191a4af573b21b65a52cceb20a2cfcd3e7bc906ee877"},"schema_version":"1.0","source":{"id":"1812.05145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05145","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05145v1","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05145","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"VVALMVT75UYN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VVALMVT75UYNZLHD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VVALMVT7","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:d40bb1c0766b12e49a16b53b6fe0f759bea22dac15ef82c18fa9a116a5d284b3","target":"graph","created_at":"2026-05-17T23:58:24Z","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 expository paper, we mainly study orthogonal arrays (OAs) of strength two having a row that is repeated $m$ times. It turns out that the Plackett-Burman bound (\\cite{PB}) can be strengthened by a factor of $m$ for orthogonal arrays of strength two that contain a row that is repeated $m$ times. This is a consequence of a more general result due to Mukerjee, Qian and Wu \\cite{Muk} that applies to orthogonal arrays of arbitrary strength $t$.\n  We examine several proofs of the Plackett-Burman bound and discuss which of these proofs can be strengthened to yield the aforementioned bound for ","authors_text":"Douglas R. Stinson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:16:07Z","title":"Bounds for orthogonal arrays with repeated rows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05145","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:4d93b056b97573b3b7fc3d5384eedda1bedb03361cf8af7e79eb7ae0a6097618","target":"record","created_at":"2026-05-17T23:58:24Z","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":"fcdde267a89284e848ff6beac22a8e03c5c396e23edc09658628cf24269cb95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:16:07Z","title_canon_sha256":"f97797f40be53a27dd3c191a4af573b21b65a52cceb20a2cfcd3e7bc906ee877"},"schema_version":"1.0","source":{"id":"1812.05145","kind":"arxiv","version":1}},"canonical_sha256":"ad40b6567fed30dcace34fb52ed94f130718d51694a1e1f6b800399cec3982d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad40b6567fed30dcace34fb52ed94f130718d51694a1e1f6b800399cec3982d8","first_computed_at":"2026-05-17T23:58:24.401807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.401807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NKWR/3i6ihbl/fjNTX+hamqjGvbSR0k3SNjgmCuwRdwEv9fibKYKQz+galRhRnT3WXWlIWuvHjljiwukRM+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.402529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d93b056b97573b3b7fc3d5384eedda1bedb03361cf8af7e79eb7ae0a6097618","sha256:d40bb1c0766b12e49a16b53b6fe0f759bea22dac15ef82c18fa9a116a5d284b3"],"state_sha256":"41c0350699d3f733186d23dbccbfd63680d2711c6e8f4e5b330629f2c5433cfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/OHESvXw96Iqy6iX9pbLM8obm39BnnsWAwo0J8ZlOcmrNR0ZTE8TX0tNta8xHaywvCq2OMZU5vyBg6KEP0qCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:09:22.377839Z","bundle_sha256":"9964e597ec31f645c1bbb03a1cd48546bcfcd2ae8ea9bda9d26a2b401d96b69a"}}