{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GLTZJT4N32MMTRLXXPIYPVKWM5","short_pith_number":"pith:GLTZJT4N","canonical_record":{"source":{"id":"1901.02479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T19:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"619d397c28ef7eb843346027921b2bc6fd9d79477feb04a7e8a4fc57057a39d6","abstract_canon_sha256":"1cd0f3274b038e024f8566b0dc096c778d426cba1e634a8e5fafdc9426617478"},"schema_version":"1.0"},"canonical_sha256":"32e794cf8dde98c9c577bbd187d5566746a68a3e236523397b79efef79dbcb0e","source":{"kind":"arxiv","id":"1901.02479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02479","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02479v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02479","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"GLTZJT4N32MM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLTZJT4N32MMTRLX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLTZJT4N","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GLTZJT4N32MMTRLXXPIYPVKWM5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T19:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"619d397c28ef7eb843346027921b2bc6fd9d79477feb04a7e8a4fc57057a39d6","abstract_canon_sha256":"1cd0f3274b038e024f8566b0dc096c778d426cba1e634a8e5fafdc9426617478"},"schema_version":"1.0"},"canonical_sha256":"32e794cf8dde98c9c577bbd187d5566746a68a3e236523397b79efef79dbcb0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.432039Z","signature_b64":"ffr0F5bXEgJNcc98ZRGxVA3XxIMvTt3vrTeCBfUpXmkA4kV4VkCzhjxThN/j8L02x8ScErRK6s3zfzcEKUzRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32e794cf8dde98c9c577bbd187d5566746a68a3e236523397b79efef79dbcb0e","last_reissued_at":"2026-05-17T23:56:40.431358Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.431358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02479","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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lcVzPoLg22ohmUnhugED/8vOMI1FGbEbHmeEqOFlcg16GBa7DZUydGz6+LNkjiryppPxH0AJetxBJGXkl3ACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:59:16.234207Z"},"content_sha256":"fc8a99e38e5eab00caac0639c9393195892e7803d13aabb5cf427d752e105f65","schema_version":"1.0","event_id":"sha256:fc8a99e38e5eab00caac0639c9393195892e7803d13aabb5cf427d752e105f65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GLTZJT4N32MMTRLXXPIYPVKWM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-uniform covering array with symmetric forbidden edge constraints","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens","submitted_at":"2019-01-08T19:34:48Z","abstract_excerpt":"It has been conjectured that whenever an optimal covering array exists there is also a uniform covering array with the same parameters and this is true for all known optimal covering arrays. When used as a test suite, the application context may have pairs of parameters that must be avoided and Covering arrays avoiding forbidden edges (CAFE) are a generalization accommodating this requirement. We prove that there is an arc-transitive, highly symmetric constraint graph where the unique optimal covering array avoiding forbidden edges is not uniform. This does not refute the conjecture but it doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02479","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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Guv/l9Ba/dSG8gF2LWYimbkiEExKToC7ydl3PlzCvxABI7q8SdYGIui4rbCjWwoayn/UTpk8tmg7AwDQ0ayeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:59:16.234895Z"},"content_sha256":"475fa4dc89b8edfc35784fe69f8f056854efa9ec87d4e7b56e49ef109f606ecd","schema_version":"1.0","event_id":"sha256:475fa4dc89b8edfc35784fe69f8f056854efa9ec87d4e7b56e49ef109f606ecd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/bundle.json","state_url":"https://pith.science/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/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-07T03:59:16Z","links":{"resolver":"https://pith.science/pith/GLTZJT4N32MMTRLXXPIYPVKWM5","bundle":"https://pith.science/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/bundle.json","state":"https://pith.science/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLTZJT4N32MMTRLXXPIYPVKWM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GLTZJT4N32MMTRLXXPIYPVKWM5","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":"1cd0f3274b038e024f8566b0dc096c778d426cba1e634a8e5fafdc9426617478","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T19:34:48Z","title_canon_sha256":"619d397c28ef7eb843346027921b2bc6fd9d79477feb04a7e8a4fc57057a39d6"},"schema_version":"1.0","source":{"id":"1901.02479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02479","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02479v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02479","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"GLTZJT4N32MM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLTZJT4N32MMTRLX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLTZJT4N","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:475fa4dc89b8edfc35784fe69f8f056854efa9ec87d4e7b56e49ef109f606ecd","target":"graph","created_at":"2026-05-17T23:56:40Z","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 has been conjectured that whenever an optimal covering array exists there is also a uniform covering array with the same parameters and this is true for all known optimal covering arrays. When used as a test suite, the application context may have pairs of parameters that must be avoided and Covering arrays avoiding forbidden edges (CAFE) are a generalization accommodating this requirement. We prove that there is an arc-transitive, highly symmetric constraint graph where the unique optimal covering array avoiding forbidden edges is not uniform. This does not refute the conjecture but it doe","authors_text":"Brett Stevens","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T19:34:48Z","title":"Non-uniform covering array with symmetric forbidden edge constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02479","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:fc8a99e38e5eab00caac0639c9393195892e7803d13aabb5cf427d752e105f65","target":"record","created_at":"2026-05-17T23:56:40Z","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":"1cd0f3274b038e024f8566b0dc096c778d426cba1e634a8e5fafdc9426617478","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T19:34:48Z","title_canon_sha256":"619d397c28ef7eb843346027921b2bc6fd9d79477feb04a7e8a4fc57057a39d6"},"schema_version":"1.0","source":{"id":"1901.02479","kind":"arxiv","version":1}},"canonical_sha256":"32e794cf8dde98c9c577bbd187d5566746a68a3e236523397b79efef79dbcb0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32e794cf8dde98c9c577bbd187d5566746a68a3e236523397b79efef79dbcb0e","first_computed_at":"2026-05-17T23:56:40.431358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.431358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ffr0F5bXEgJNcc98ZRGxVA3XxIMvTt3vrTeCBfUpXmkA4kV4VkCzhjxThN/j8L02x8ScErRK6s3zfzcEKUzRAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.432039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8a99e38e5eab00caac0639c9393195892e7803d13aabb5cf427d752e105f65","sha256:475fa4dc89b8edfc35784fe69f8f056854efa9ec87d4e7b56e49ef109f606ecd"],"state_sha256":"18cdb9895aa5290e9df0df7cc6139fe6e8ba16a934ff34cd3c73ad23b5b36281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugAIMRxKo2ievW6dlweYan09RInio74hYvz+KLBqSTYNzVUfCZP18PykElJ78uWioVAgVKKYlu5FZsYeS2jJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:59:16.238438Z","bundle_sha256":"898725ed5920f40bb84e9786cfe4af048c9620aa454f84aa6694a6c5109ca5e3"}}