{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:BMKSIARZRFEEY5Z45D32FNK73H","short_pith_number":"pith:BMKSIARZ","canonical_record":{"source":{"id":"math/0205303","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2002-05-28T21:50:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b2cb4691b3aaf5f49a8e88767e99d10e24f1230da6a81484aa216d4904f36f6a","abstract_canon_sha256":"56a47857a2cdee9b53efecdc49053e5c6bdd1f2f9a9c8b909c35a43de8c75d48"},"schema_version":"1.0"},"canonical_sha256":"0b1524023989484c773ce8f7a2b55fd9f981ec7f9509936bb898572e39d7138c","source":{"kind":"arxiv","id":"math/0205303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0205303","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"math/0205303v1","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0205303","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMKSIARZRFEE","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"BMKSIARZRFEEY5Z4","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"BMKSIARZ","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:BMKSIARZRFEEY5Z45D32FNK73H","target":"record","payload":{"canonical_record":{"source":{"id":"math/0205303","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2002-05-28T21:50:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b2cb4691b3aaf5f49a8e88767e99d10e24f1230da6a81484aa216d4904f36f6a","abstract_canon_sha256":"56a47857a2cdee9b53efecdc49053e5c6bdd1f2f9a9c8b909c35a43de8c75d48"},"schema_version":"1.0"},"canonical_sha256":"0b1524023989484c773ce8f7a2b55fd9f981ec7f9509936bb898572e39d7138c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:37.779921Z","signature_b64":"vqbXNOSsHvjWsgEUmthDSO1yuarELAH39cNMQ91vMhN69aojUY2eSBOUOVswzXt1yOzMKUcozvtSdGdP4PThAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1524023989484c773ce8f7a2b55fd9f981ec7f9509936bb898572e39d7138c","last_reissued_at":"2026-05-18T02:42:37.779216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:37.779216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0205303","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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9SViMkYgKDOlAGu55lTbjt50jsMa4BraT3FvuTI59jnpcikfVJ5nMuSzgYLJURgYMG5uBQzBp625ky3+4PQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:46.648113Z"},"content_sha256":"60431eff0dee69cced9724280b2a64c645acbd2fb46b8830419f2ce113beafc0","schema_version":"1.0","event_id":"sha256:60431eff0dee69cced9724280b2a64c645acbd2fb46b8830419f2ce113beafc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:BMKSIARZRFEEY5Z45D32FNK73H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Asymmetric Coverings and Covering Numbers","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"David Applegate, E. M. Rains, N. J. A. Sloane","submitted_at":"2002-05-28T21:50:03Z","abstract_excerpt":"An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In this paper we compute the smallest size of any D(n,1) for n <= 8. We also investigate ``continuous'' and ``banded'' versions of the problem. The latter involves the classical covering numbers C(n,k,k-1), and we determine the following new values: C(10,5,4) = 51, C(11,7,6,) =84, C(12,8,7) = 126, C(13,9,8)= 185 and C(14,10,9) = 259. We also find the number of nonisomorphic minimal covering designs in several cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0205303","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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIaUkUCEgHbjziavnGgDX8iPzoK+9YQ/GscPlL+gRdAS5qKQnTSbFFhMw528GvHPD5BfVvqKbuHzTlJSXOmUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:46.648811Z"},"content_sha256":"abc43f4caf23c414250c075a663e90001b591137e09d6a853aef7493c22bce09","schema_version":"1.0","event_id":"sha256:abc43f4caf23c414250c075a663e90001b591137e09d6a853aef7493c22bce09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMKSIARZRFEEY5Z45D32FNK73H/bundle.json","state_url":"https://pith.science/pith/BMKSIARZRFEEY5Z45D32FNK73H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMKSIARZRFEEY5Z45D32FNK73H/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-07T16:18:46Z","links":{"resolver":"https://pith.science/pith/BMKSIARZRFEEY5Z45D32FNK73H","bundle":"https://pith.science/pith/BMKSIARZRFEEY5Z45D32FNK73H/bundle.json","state":"https://pith.science/pith/BMKSIARZRFEEY5Z45D32FNK73H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMKSIARZRFEEY5Z45D32FNK73H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:BMKSIARZRFEEY5Z45D32FNK73H","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":"56a47857a2cdee9b53efecdc49053e5c6bdd1f2f9a9c8b909c35a43de8c75d48","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"math.CO","submitted_at":"2002-05-28T21:50:03Z","title_canon_sha256":"b2cb4691b3aaf5f49a8e88767e99d10e24f1230da6a81484aa216d4904f36f6a"},"schema_version":"1.0","source":{"id":"math/0205303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0205303","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"math/0205303v1","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0205303","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMKSIARZRFEE","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"BMKSIARZRFEEY5Z4","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"BMKSIARZ","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:abc43f4caf23c414250c075a663e90001b591137e09d6a853aef7493c22bce09","target":"graph","created_at":"2026-05-18T02:42:37Z","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":"An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In this paper we compute the smallest size of any D(n,1) for n <= 8. We also investigate ``continuous'' and ``banded'' versions of the problem. The latter involves the classical covering numbers C(n,k,k-1), and we determine the following new values: C(10,5,4) = 51, C(11,7,6,) =84, C(12,8,7) = 126, C(13,9,8)= 185 and C(14,10,9) = 259. We also find the number of nonisomorphic minimal covering designs in several cases.","authors_text":"David Applegate, E. M. Rains, N. J. A. Sloane","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2002-05-28T21:50:03Z","title":"On Asymmetric Coverings and Covering Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0205303","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:60431eff0dee69cced9724280b2a64c645acbd2fb46b8830419f2ce113beafc0","target":"record","created_at":"2026-05-18T02:42:37Z","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":"56a47857a2cdee9b53efecdc49053e5c6bdd1f2f9a9c8b909c35a43de8c75d48","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"math.CO","submitted_at":"2002-05-28T21:50:03Z","title_canon_sha256":"b2cb4691b3aaf5f49a8e88767e99d10e24f1230da6a81484aa216d4904f36f6a"},"schema_version":"1.0","source":{"id":"math/0205303","kind":"arxiv","version":1}},"canonical_sha256":"0b1524023989484c773ce8f7a2b55fd9f981ec7f9509936bb898572e39d7138c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b1524023989484c773ce8f7a2b55fd9f981ec7f9509936bb898572e39d7138c","first_computed_at":"2026-05-18T02:42:37.779216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:37.779216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqbXNOSsHvjWsgEUmthDSO1yuarELAH39cNMQ91vMhN69aojUY2eSBOUOVswzXt1yOzMKUcozvtSdGdP4PThAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:37.779921Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0205303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60431eff0dee69cced9724280b2a64c645acbd2fb46b8830419f2ce113beafc0","sha256:abc43f4caf23c414250c075a663e90001b591137e09d6a853aef7493c22bce09"],"state_sha256":"6c635de2821fef3549ab04f0bbf8063a41858398d51c78302e7aa7b8a01b0816"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldUrhzbabhtehtOXlR+innTg1LNKpFo4hMtZMB7ioSnG/XNqt/lQlVTEonN70wJzMGvzTpwwy2HF77bw/kT/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:18:46.652111Z","bundle_sha256":"3b34b981d2978a67efdd6f07282d3f9c6cc7d99ae62ab600d6ac91e83852b021"}}