{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6VNC7CNEKEHPWH47MDXSJ3VIPC","short_pith_number":"pith:6VNC7CNE","canonical_record":{"source":{"id":"1605.02131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0efeba9ed595226eb3037b592d766c4672a31de02e249bb3aea36cd0b655d376","abstract_canon_sha256":"2e6c52d2d0d94524d2ff4f196da12d843b3f398c1249eb8a402818d395c1c0bd"},"schema_version":"1.0"},"canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","source":{"kind":"arxiv","id":"1605.02131","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02131","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02131v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02131","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"6VNC7CNEKEHP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VNC7CNEKEHPWH47","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VNC7CNE","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6VNC7CNEKEHPWH47MDXSJ3VIPC","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0efeba9ed595226eb3037b592d766c4672a31de02e249bb3aea36cd0b655d376","abstract_canon_sha256":"2e6c52d2d0d94524d2ff4f196da12d843b3f398c1249eb8a402818d395c1c0bd"},"schema_version":"1.0"},"canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.999534Z","signature_b64":"VYUe9ZlY0RkiTjUUTi2GmeVL1Jne6HQaxLJVso0QXvrbWgEC6Ca8y9YH9CCsfREMWZFZzivc2Z9D8UKan7s3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","last_reissued_at":"2026-05-18T01:15:21.998715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.998715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02131","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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NxBEBuBvYoYBYCWFJgQxIcZTAInuOVGIfvlmcJrq9A1s1F3dR7146k9uWiUklBP3UgKjxHVqRztxfWPCFJrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:25:03.296655Z"},"content_sha256":"2d18a7bf96cc03c18b28332d4dcf8ddcd9e984dee33e81e1590f5ef473a18469","schema_version":"1.0","event_id":"sha256:2d18a7bf96cc03c18b28332d4dcf8ddcd9e984dee33e81e1590f5ef473a18469"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6VNC7CNEKEHPWH47MDXSJ3VIPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Covering Arrays: Algorithms and Asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Annalisa De Bonis, Charles J. Colbourn, Kaushik Sarkar, Ugo Vaccaro","submitted_at":"2016-05-07T02:09:26Z","abstract_excerpt":"A covering array $\\mathsf{CA}(N;t,k,v)$ is an $N\\times k$ array with entries in $\\{1, 2, \\ldots , v\\}$, for which every $N\\times t$ subarray contains each $t$-tuple of $\\{1, 2, \\ldots , v\\}^t$ among its rows. Covering arrays find application in interaction testing, including software and hardware testing, advanced materials development, and biological systems. A central question is to determine or bound $\\mathsf{CAN}(t,k,v)$, the minimum number $N$ of rows of a $\\mathsf{CA}(N;t,k,v)$. The well known bound $\\mathsf{CAN}(t,k,v)=O((t-1)v^t\\log k)$ is not too far from being asymptotically optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02131","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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGADt7NJpCPz/dphsaQLtmqRQULZraeodp9VCURqNYxXDT8L9vCZfsP1w81egaTW5Xd3cCJ2BkCZt2LMBm6AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:25:03.297334Z"},"content_sha256":"b28d8312b1a346184732503a46163724cb6533ce0a9c2a523cb09147b63d53bd","schema_version":"1.0","event_id":"sha256:b28d8312b1a346184732503a46163724cb6533ce0a9c2a523cb09147b63d53bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/bundle.json","state_url":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/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-05-18T17:25:03Z","links":{"resolver":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC","bundle":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/bundle.json","state":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6VNC7CNEKEHPWH47MDXSJ3VIPC","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":"2e6c52d2d0d94524d2ff4f196da12d843b3f398c1249eb8a402818d395c1c0bd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","title_canon_sha256":"0efeba9ed595226eb3037b592d766c4672a31de02e249bb3aea36cd0b655d376"},"schema_version":"1.0","source":{"id":"1605.02131","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02131","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02131v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02131","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"6VNC7CNEKEHP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VNC7CNEKEHPWH47","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VNC7CNE","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b28d8312b1a346184732503a46163724cb6533ce0a9c2a523cb09147b63d53bd","target":"graph","created_at":"2026-05-18T01:15:21Z","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 $\\mathsf{CA}(N;t,k,v)$ is an $N\\times k$ array with entries in $\\{1, 2, \\ldots , v\\}$, for which every $N\\times t$ subarray contains each $t$-tuple of $\\{1, 2, \\ldots , v\\}^t$ among its rows. Covering arrays find application in interaction testing, including software and hardware testing, advanced materials development, and biological systems. A central question is to determine or bound $\\mathsf{CAN}(t,k,v)$, the minimum number $N$ of rows of a $\\mathsf{CA}(N;t,k,v)$. The well known bound $\\mathsf{CAN}(t,k,v)=O((t-1)v^t\\log k)$ is not too far from being asymptotically optimal.","authors_text":"Annalisa De Bonis, Charles J. Colbourn, Kaushik Sarkar, Ugo Vaccaro","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","title":"Partial Covering Arrays: Algorithms and Asymptotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02131","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:2d18a7bf96cc03c18b28332d4dcf8ddcd9e984dee33e81e1590f5ef473a18469","target":"record","created_at":"2026-05-18T01:15:21Z","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":"2e6c52d2d0d94524d2ff4f196da12d843b3f398c1249eb8a402818d395c1c0bd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","title_canon_sha256":"0efeba9ed595226eb3037b592d766c4672a31de02e249bb3aea36cd0b655d376"},"schema_version":"1.0","source":{"id":"1605.02131","kind":"arxiv","version":1}},"canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","first_computed_at":"2026-05-18T01:15:21.998715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.998715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYUe9ZlY0RkiTjUUTi2GmeVL1Jne6HQaxLJVso0QXvrbWgEC6Ca8y9YH9CCsfREMWZFZzivc2Z9D8UKan7s3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.999534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02131","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d18a7bf96cc03c18b28332d4dcf8ddcd9e984dee33e81e1590f5ef473a18469","sha256:b28d8312b1a346184732503a46163724cb6533ce0a9c2a523cb09147b63d53bd"],"state_sha256":"910e8b33f963c351ae058fb72381a49b4e02e56f5c82d828b1ceee7cfaf510f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeRLtv5XXVGk7+16IBkC5NcxGtIm7hxl8Ch+fRJMIr5PLX3JzM5f+ysytgNXWYoMmFfELXDDgR0qjpiMRsy2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T17:25:03.299272Z","bundle_sha256":"c6a1d48db29752e7e6fac409838a20583386259b65c0f905e5b7e2acef573114"}}