{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H6W6DOS3NAHUX33J473K7IILCW","short_pith_number":"pith:H6W6DOS3","canonical_record":{"source":{"id":"1803.06507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-17T13:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"b84ce9954f1e3a2a6d7a6d1b67916da6bd80f16f6af37b228a246801b2ee02a7","abstract_canon_sha256":"9bfa4c45c15999441234814d5053861f676cdb60ee33e6c3b315ba7f8efb66b6"},"schema_version":"1.0"},"canonical_sha256":"3fade1ba5b680f4bef69e7f6afa10b159a92b6845b282cc602b173007852461c","source":{"kind":"arxiv","id":"1803.06507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06507","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06507v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06507","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"H6W6DOS3NAHU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H6W6DOS3NAHUX33J","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H6W6DOS3","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H6W6DOS3NAHUX33J473K7IILCW","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-17T13:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"b84ce9954f1e3a2a6d7a6d1b67916da6bd80f16f6af37b228a246801b2ee02a7","abstract_canon_sha256":"9bfa4c45c15999441234814d5053861f676cdb60ee33e6c3b315ba7f8efb66b6"},"schema_version":"1.0"},"canonical_sha256":"3fade1ba5b680f4bef69e7f6afa10b159a92b6845b282cc602b173007852461c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:45.725227Z","signature_b64":"lhp8ee4U9/aV9JsHTNo++0EMclqOplOG5qLcV6rNmWZuUs+GvxEB8J86Qr8d68RTz5v+LMV3plDvF3XdIUSsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fade1ba5b680f4bef69e7f6afa10b159a92b6845b282cc602b173007852461c","last_reissued_at":"2026-05-18T00:20:45.724828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:45.724828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06507","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-18T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zo3Lc/1HTE+7226PIC75KHImTjCakpBRu7mVwLgodDbjKQB+jUGAt8wkmESqKzjHMX80HyA6VwTz6Lby3atAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:23.644535Z"},"content_sha256":"ce0288bb35916cc0e5679a065537d57a6e81b5fe63113e69ef08a6115c5e578a","schema_version":"1.0","event_id":"sha256:ce0288bb35916cc0e5679a065537d57a6e81b5fe63113e69ef08a6115c5e578a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H6W6DOS3NAHUX33J473K7IILCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Arrays for Equivalence Classes of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Joshua Cassels","submitted_at":"2018-03-17T13:53:32Z","abstract_excerpt":"Covering arrays for words of length $t$ over a $d$ letter alphabet are $k \\times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$ $t$-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case words are equivalent if they induce the same partition of a $t$ element set. In the second case, words of the same weight are equivalent. In both cases we produce logarithmic upper bounds on the minimum size $k=k(n)$ of a covering array. Definitiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06507","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-18T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGPDWLCDY8Qn1QoA9XLQkNbQ/SVFW0kmMbKt84Ccgsca6u8fFyE/AD6xe1MR38FXWgcjkFtqcmaXj0i8v9JhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:23.644898Z"},"content_sha256":"e2a928334b8ada4b92d7745e49e9c0b1136c54ae1a5af19a2906120f76c56b95","schema_version":"1.0","event_id":"sha256:e2a928334b8ada4b92d7745e49e9c0b1136c54ae1a5af19a2906120f76c56b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6W6DOS3NAHUX33J473K7IILCW/bundle.json","state_url":"https://pith.science/pith/H6W6DOS3NAHUX33J473K7IILCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6W6DOS3NAHUX33J473K7IILCW/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-03T17:47:23Z","links":{"resolver":"https://pith.science/pith/H6W6DOS3NAHUX33J473K7IILCW","bundle":"https://pith.science/pith/H6W6DOS3NAHUX33J473K7IILCW/bundle.json","state":"https://pith.science/pith/H6W6DOS3NAHUX33J473K7IILCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6W6DOS3NAHUX33J473K7IILCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H6W6DOS3NAHUX33J473K7IILCW","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":"9bfa4c45c15999441234814d5053861f676cdb60ee33e6c3b315ba7f8efb66b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-17T13:53:32Z","title_canon_sha256":"b84ce9954f1e3a2a6d7a6d1b67916da6bd80f16f6af37b228a246801b2ee02a7"},"schema_version":"1.0","source":{"id":"1803.06507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06507","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06507v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06507","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"H6W6DOS3NAHU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H6W6DOS3NAHUX33J","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H6W6DOS3","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e2a928334b8ada4b92d7745e49e9c0b1136c54ae1a5af19a2906120f76c56b95","target":"graph","created_at":"2026-05-18T00:20:45Z","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":"Covering arrays for words of length $t$ over a $d$ letter alphabet are $k \\times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$ $t$-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case words are equivalent if they induce the same partition of a $t$ element set. In the second case, words of the same weight are equivalent. In both cases we produce logarithmic upper bounds on the minimum size $k=k(n)$ of a covering array. Definitiv","authors_text":"Anant Godbole, Joshua Cassels","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-17T13:53:32Z","title":"Covering Arrays for Equivalence Classes of Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06507","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:ce0288bb35916cc0e5679a065537d57a6e81b5fe63113e69ef08a6115c5e578a","target":"record","created_at":"2026-05-18T00:20:45Z","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":"9bfa4c45c15999441234814d5053861f676cdb60ee33e6c3b315ba7f8efb66b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-17T13:53:32Z","title_canon_sha256":"b84ce9954f1e3a2a6d7a6d1b67916da6bd80f16f6af37b228a246801b2ee02a7"},"schema_version":"1.0","source":{"id":"1803.06507","kind":"arxiv","version":1}},"canonical_sha256":"3fade1ba5b680f4bef69e7f6afa10b159a92b6845b282cc602b173007852461c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fade1ba5b680f4bef69e7f6afa10b159a92b6845b282cc602b173007852461c","first_computed_at":"2026-05-18T00:20:45.724828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:45.724828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lhp8ee4U9/aV9JsHTNo++0EMclqOplOG5qLcV6rNmWZuUs+GvxEB8J86Qr8d68RTz5v+LMV3plDvF3XdIUSsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:45.725227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce0288bb35916cc0e5679a065537d57a6e81b5fe63113e69ef08a6115c5e578a","sha256:e2a928334b8ada4b92d7745e49e9c0b1136c54ae1a5af19a2906120f76c56b95"],"state_sha256":"7d177aff68d4b882a66b25addd8ff5c99fb4ce24af3d2e10cd555a3802b808c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nlv/R4Y5jXRdrkuJPuw0/yDLdmFsEVNDa8VKV2L+iclf/+jqsNQWUat5kNLKKGvh33MhoMA0ic2kuwQ2OCUMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:47:23.646888Z","bundle_sha256":"dd56295e3ab23c6dd55e5839ed49869785204341e455e5668c6ec62489d6fc62"}}