{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GTVASFFU4U4BK2R5MBUCOR6ENR","short_pith_number":"pith:GTVASFFU","canonical_record":{"source":{"id":"1503.08876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T00:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"68ceb874be473ad9979bfabc4c40ad240fef1d0122ddf895fc3d9291ca1ccbaa","abstract_canon_sha256":"9ba54b9745a49bef86c9392448a73edf12b6f9b2fbd0184f5f7b968dd0d2e0fd"},"schema_version":"1.0"},"canonical_sha256":"34ea0914b4e538156a3d60682747c46c5ceae14b25619aa088ce0cbbacd19496","source":{"kind":"arxiv","id":"1503.08876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08876","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08876v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08876","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"GTVASFFU4U4B","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GTVASFFU4U4BK2R5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GTVASFFU","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GTVASFFU4U4BK2R5MBUCOR6ENR","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T00:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"68ceb874be473ad9979bfabc4c40ad240fef1d0122ddf895fc3d9291ca1ccbaa","abstract_canon_sha256":"9ba54b9745a49bef86c9392448a73edf12b6f9b2fbd0184f5f7b968dd0d2e0fd"},"schema_version":"1.0"},"canonical_sha256":"34ea0914b4e538156a3d60682747c46c5ceae14b25619aa088ce0cbbacd19496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:51.964518Z","signature_b64":"brw4cBqHBo3Fqe/QQdEN0saCmhX/BK7CtXtXWgi3aTIUEt71LFCVwhNGOGQPotqvL0mzGdUZF98EQAIpzBpBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ea0914b4e538156a3d60682747c46c5ceae14b25619aa088ce0cbbacd19496","last_reissued_at":"2026-05-18T02:19:51.963783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:51.963783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08876","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-18T02:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRLLUC9qSptvZ8eVR8PTBjqEezTC8vyWqdBJmcoPnD5EJKTEe+0Ndfv2A60SDeyoQXG4US+pNiebFe/DMpUTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:12:59.374626Z"},"content_sha256":"784e3933377af375313a8c1c6fbc88ff4f3f1bcae3fd2233a9e338b4994d0466","schema_version":"1.0","event_id":"sha256:784e3933377af375313a8c1c6fbc88ff4f3f1bcae3fd2233a9e338b4994d0466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GTVASFFU4U4BK2R5MBUCOR6ENR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic size of covering arrays: an application of entropy compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Nevena Franceti\\'c","submitted_at":"2015-03-31T00:04:00Z","abstract_excerpt":"A covering array $CA(N; t,k,v)$ is an $N \\times k$ array $A$ whose each cell takes a value for a $v$-set $V$ called an alphabet. Moreover, the set $V^t$ is contained in the set of rows of every $N \\times t$ subarray of $A$. The parameter $N$ is called the size of an array and $CAN(t,k,v)$ denotes the smallest $N$ for which a $CA(N; t,k,v)$ exists. It is well known that $CAN(t,k,v) = {\\rm \\Theta}(\\log_2 k)$~\\cite{godbole_bounds_1996}. In this paper we derive two upper bounds on $d(t,v)=\\limsup_{k \\rightarrow \\infty} \\frac{CAN(t,k,v)}{\\log_2 k}$ using the algorithmic approach to the Lov\\'{a}sz l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08876","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-18T02:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xa5TDINfDtEwKHipY+bts9AXYYRC87jYAFx5fbTNdNUA8EtmibkGlwc3YJv0IX2fYzqcjYTChmEu80lO3XTtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:12:59.375293Z"},"content_sha256":"c312f3fd71a6fcf00a2d6df093c04c2b026d3017a4773ba22886976b6de93572","schema_version":"1.0","event_id":"sha256:c312f3fd71a6fcf00a2d6df093c04c2b026d3017a4773ba22886976b6de93572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/bundle.json","state_url":"https://pith.science/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/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:12:59Z","links":{"resolver":"https://pith.science/pith/GTVASFFU4U4BK2R5MBUCOR6ENR","bundle":"https://pith.science/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/bundle.json","state":"https://pith.science/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTVASFFU4U4BK2R5MBUCOR6ENR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GTVASFFU4U4BK2R5MBUCOR6ENR","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":"9ba54b9745a49bef86c9392448a73edf12b6f9b2fbd0184f5f7b968dd0d2e0fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T00:04:00Z","title_canon_sha256":"68ceb874be473ad9979bfabc4c40ad240fef1d0122ddf895fc3d9291ca1ccbaa"},"schema_version":"1.0","source":{"id":"1503.08876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08876","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08876v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08876","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"GTVASFFU4U4B","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GTVASFFU4U4BK2R5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GTVASFFU","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:c312f3fd71a6fcf00a2d6df093c04c2b026d3017a4773ba22886976b6de93572","target":"graph","created_at":"2026-05-18T02:19:51Z","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 $CA(N; t,k,v)$ is an $N \\times k$ array $A$ whose each cell takes a value for a $v$-set $V$ called an alphabet. Moreover, the set $V^t$ is contained in the set of rows of every $N \\times t$ subarray of $A$. The parameter $N$ is called the size of an array and $CAN(t,k,v)$ denotes the smallest $N$ for which a $CA(N; t,k,v)$ exists. It is well known that $CAN(t,k,v) = {\\rm \\Theta}(\\log_2 k)$~\\cite{godbole_bounds_1996}. In this paper we derive two upper bounds on $d(t,v)=\\limsup_{k \\rightarrow \\infty} \\frac{CAN(t,k,v)}{\\log_2 k}$ using the algorithmic approach to the Lov\\'{a}sz l","authors_text":"Brett Stevens, Nevena Franceti\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T00:04:00Z","title":"Asymptotic size of covering arrays: an application of entropy compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08876","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:784e3933377af375313a8c1c6fbc88ff4f3f1bcae3fd2233a9e338b4994d0466","target":"record","created_at":"2026-05-18T02:19:51Z","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":"9ba54b9745a49bef86c9392448a73edf12b6f9b2fbd0184f5f7b968dd0d2e0fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T00:04:00Z","title_canon_sha256":"68ceb874be473ad9979bfabc4c40ad240fef1d0122ddf895fc3d9291ca1ccbaa"},"schema_version":"1.0","source":{"id":"1503.08876","kind":"arxiv","version":1}},"canonical_sha256":"34ea0914b4e538156a3d60682747c46c5ceae14b25619aa088ce0cbbacd19496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ea0914b4e538156a3d60682747c46c5ceae14b25619aa088ce0cbbacd19496","first_computed_at":"2026-05-18T02:19:51.963783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:51.963783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brw4cBqHBo3Fqe/QQdEN0saCmhX/BK7CtXtXWgi3aTIUEt71LFCVwhNGOGQPotqvL0mzGdUZF98EQAIpzBpBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:51.964518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:784e3933377af375313a8c1c6fbc88ff4f3f1bcae3fd2233a9e338b4994d0466","sha256:c312f3fd71a6fcf00a2d6df093c04c2b026d3017a4773ba22886976b6de93572"],"state_sha256":"c289d34d6b1bde999583e280ac1d7aaec01be3587bbc0e2f2ceec5aa50d135cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFclykq2V6NA+rLLCVgDoh9nXt6r92XQqv+blCkTXra/XbFJ65xNL8Z3rJAEf20X/E6QVPAZ/yKe7t/SxWYGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:12:59.379169Z","bundle_sha256":"051ab28a935032b1c3757349d0b662733340722c554713fdb0cebef4147d35de"}}