{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ISWBW6E4G5ZDDSOT7UETRTAZN","short_pith_number":"pith:5ISWBW6E","canonical_record":{"source":{"id":"1901.03594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"c05fc34204223c39f35518e0ca157ae5a8853274398f7d45f40ca2b53b3b5404","abstract_canon_sha256":"acaa96c0fcd972508b2a598763a816f1a5093802bb09e6a99fa7ed9a3680bf87"},"schema_version":"1.0"},"canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","source":{"kind":"arxiv","id":"1901.03594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03594","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03594v2","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03594","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"5ISWBW6E4G5Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ISWBW6E4G5ZDDSO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ISWBW6E","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ISWBW6E4G5ZDDSOT7UETRTAZN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"c05fc34204223c39f35518e0ca157ae5a8853274398f7d45f40ca2b53b3b5404","abstract_canon_sha256":"acaa96c0fcd972508b2a598763a816f1a5093802bb09e6a99fa7ed9a3680bf87"},"schema_version":"1.0"},"canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.620942Z","signature_b64":"QCYwxjMDqd1rftn444wqyq3D+7bZE8IEKOc+Ek7Cl3+i7Op81r3drmROHTXBcjJUhP0EsM2Alzf4TvrkXgo/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","last_reissued_at":"2026-05-17T23:42:02.620249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.620249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03594","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-17T23:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yzOxoGJJaPIcbab12juMeUQqZtOWZi2DPw5rW0lYvVZLzHT4XP8xj2DGT69JsUGqUE0i2/BrJwupUkhzau7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:41:27.429482Z"},"content_sha256":"3c501546a2702131d66da9295f56387827618560f4dc76dcd10bc5660fa5ae13","schema_version":"1.0","event_id":"sha256:3c501546a2702131d66da9295f56387827618560f4dc76dcd10bc5660fa5ae13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ISWBW6E4G5ZDDSOT7UETRTAZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Structure of Small Strength-$2$ Covering Arrays","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Janne I. Kokkala, Karen Meagher, Kari J. Nurmela, Patric R. J. \\\"Osterg{\\aa}rd, Reza Naserasr","submitted_at":"2019-01-11T14:30:24Z","abstract_excerpt":"A covering array $\\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \\times k$ array of symbols from an alphabet of size $v$ such that in every $N \\times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \\emph{optimal} if it has the smallest possible $N$ for given $t$, $k$, and $v$, and \\emph{uniform} if every symbol occurs $\\lfloor N/v \\rfloor$ or $\\lceil N/v \\rceil$ times in every column. Prior to this paper the only known optimal covering arrays for $t=2$ were orthogonal arrays, covering arrays with $v=2$ constructed from Sperner's Theorem and the Erd\\H{o}s-Ko-Rado Theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03594","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-17T23:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaF/ko+jcAQtG9YAIkEAk++rY6w8hpEh/7UsIp10pAQm6D55zmJC9+ZiXKJmLhZ12GSgK89tf50mmCVmnuOgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:41:27.430117Z"},"content_sha256":"15f63f476da1785a8aeafc5ecebae24a34bd407b8c52368925320843bde7bed5","schema_version":"1.0","event_id":"sha256:15f63f476da1785a8aeafc5ecebae24a34bd407b8c52368925320843bde7bed5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/bundle.json","state_url":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/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-06T21:41:27Z","links":{"resolver":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN","bundle":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/bundle.json","state":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ISWBW6E4G5ZDDSOT7UETRTAZN","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":"acaa96c0fcd972508b2a598763a816f1a5093802bb09e6a99fa7ed9a3680bf87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","title_canon_sha256":"c05fc34204223c39f35518e0ca157ae5a8853274398f7d45f40ca2b53b3b5404"},"schema_version":"1.0","source":{"id":"1901.03594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03594","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03594v2","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03594","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"5ISWBW6E4G5Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ISWBW6E4G5ZDDSO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ISWBW6E","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:15f63f476da1785a8aeafc5ecebae24a34bd407b8c52368925320843bde7bed5","target":"graph","created_at":"2026-05-17T23:42:02Z","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":"A covering array $\\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \\times k$ array of symbols from an alphabet of size $v$ such that in every $N \\times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \\emph{optimal} if it has the smallest possible $N$ for given $t$, $k$, and $v$, and \\emph{uniform} if every symbol occurs $\\lfloor N/v \\rfloor$ or $\\lceil N/v \\rceil$ times in every column. Prior to this paper the only known optimal covering arrays for $t=2$ were orthogonal arrays, covering arrays with $v=2$ constructed from Sperner's Theorem and the Erd\\H{o}s-Ko-Rado Theore","authors_text":"Brett Stevens, Janne I. Kokkala, Karen Meagher, Kari J. Nurmela, Patric R. J. \\\"Osterg{\\aa}rd, Reza Naserasr","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","title":"On the Structure of Small Strength-$2$ Covering Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03594","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:3c501546a2702131d66da9295f56387827618560f4dc76dcd10bc5660fa5ae13","target":"record","created_at":"2026-05-17T23:42:02Z","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":"acaa96c0fcd972508b2a598763a816f1a5093802bb09e6a99fa7ed9a3680bf87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","title_canon_sha256":"c05fc34204223c39f35518e0ca157ae5a8853274398f7d45f40ca2b53b3b5404"},"schema_version":"1.0","source":{"id":"1901.03594","kind":"arxiv","version":2}},"canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","first_computed_at":"2026-05-17T23:42:02.620249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:02.620249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCYwxjMDqd1rftn444wqyq3D+7bZE8IEKOc+Ek7Cl3+i7Op81r3drmROHTXBcjJUhP0EsM2Alzf4TvrkXgo/Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:02.620942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c501546a2702131d66da9295f56387827618560f4dc76dcd10bc5660fa5ae13","sha256:15f63f476da1785a8aeafc5ecebae24a34bd407b8c52368925320843bde7bed5"],"state_sha256":"5cba9f969a7f2a74ef3bc62843e1c27aa73783fcaad2d384ca6844bb1a206087"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBKUWQXOUWTttC6D75Gs0NPguw60479ejZWTuDLZdGhxuUBeq4E2Cg6rDteE3aU170x4ldZ9alWuBomVrEoMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:41:27.433323Z","bundle_sha256":"af8862935ecd8515927167b22bed3fc65be84169ee79959835745d509e90cb3f"}}