{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:IVE76FPRKUATX3M2BUVSCWL6NJ","short_pith_number":"pith:IVE76FPR","canonical_record":{"source":{"id":"math/0601017","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2006-01-01T23:53:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e39b3998e920c6e6ef04229e53e413332f2d32fd64d031b1d66a18ba4cce2e4","abstract_canon_sha256":"d4415ef7214d652be1fe4a2e0321126c4c42b7ae08aa73587e67ab1da27fe1da"},"schema_version":"1.0"},"canonical_sha256":"4549ff15f155013bed9a0d2b21597e6a6d525b67c7419f41ecb58b3a5770eb47","source":{"kind":"arxiv","id":"math/0601017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601017","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601017v2","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601017","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"IVE76FPRKUAT","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"IVE76FPRKUATX3M2","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"IVE76FPR","created_at":"2026-07-04T14:52:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:IVE76FPRKUATX3M2BUVSCWL6NJ","target":"record","payload":{"canonical_record":{"source":{"id":"math/0601017","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2006-01-01T23:53:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e39b3998e920c6e6ef04229e53e413332f2d32fd64d031b1d66a18ba4cce2e4","abstract_canon_sha256":"d4415ef7214d652be1fe4a2e0321126c4c42b7ae08aa73587e67ab1da27fe1da"},"schema_version":"1.0"},"canonical_sha256":"4549ff15f155013bed9a0d2b21597e6a6d525b67c7419f41ecb58b3a5770eb47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:52:45.854308Z","signature_b64":"3Motc1rxcGnP+CYfn3GErcR6wdoM2i9GMDhxM5LR2MoUNEo7bkyT8FBgNNjS4AohAsvMc19DD7WE8oR+BaUmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4549ff15f155013bed9a0d2b21597e6a6d525b67c7419f41ecb58b3a5770eb47","last_reissued_at":"2026-07-04T14:52:45.853905Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:52:45.853905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0601017","source_version":2,"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-07-04T14:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lseOj3dTy+UdwMSbfLQw4ynmm0/PdRjR+w/AsaHsF6+BNMaCPaux92Haw4VVgXbN+c5t5zWj01ZQ/jty3IguCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:42:50.282240Z"},"content_sha256":"6fcd070ef35cd58db5637b8acb9618b0426ccfca101775436117bb31d31c5b52","schema_version":"1.0","event_id":"sha256:6fcd070ef35cd58db5637b8acb9618b0426ccfca101775436117bb31d31c5b52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:IVE76FPRKUATX3M2BUVSCWL6NJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On covering numbers","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2006-01-01T23:53:06Z","abstract_excerpt":"A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering number is said to be primitive if none of its proper divisors is a covering number. In this paper we give some sufficient conditions for n to be a (primitive) covering number; in particular, we show that for any r=2,3,... there are infinitely many primitive covering numbers having exactly r distinct prime divisors. In 1980 P. Erdos asked whether there are inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601017","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0601017/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZFzDaQADSjd0fsrpaUpPF4fFCrbq0n2gVShel08HoT84cx4iY7/UDRBhBHSG41G/wmgSp1syW6e8OLDnXlnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:42:50.283405Z"},"content_sha256":"b68d05443524985b6278992d679b69a0f7614cdc38ba6b2e3380f0b661029dd0","schema_version":"1.0","event_id":"sha256:b68d05443524985b6278992d679b69a0f7614cdc38ba6b2e3380f0b661029dd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/bundle.json","state_url":"https://pith.science/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/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-08-03T23:42:50Z","links":{"resolver":"https://pith.science/pith/IVE76FPRKUATX3M2BUVSCWL6NJ","bundle":"https://pith.science/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/bundle.json","state":"https://pith.science/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVE76FPRKUATX3M2BUVSCWL6NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:IVE76FPRKUATX3M2BUVSCWL6NJ","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":"d4415ef7214d652be1fe4a2e0321126c4c42b7ae08aa73587e67ab1da27fe1da","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.NT","submitted_at":"2006-01-01T23:53:06Z","title_canon_sha256":"4e39b3998e920c6e6ef04229e53e413332f2d32fd64d031b1d66a18ba4cce2e4"},"schema_version":"1.0","source":{"id":"math/0601017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601017","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601017v2","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601017","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"IVE76FPRKUAT","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"IVE76FPRKUATX3M2","created_at":"2026-07-04T14:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"IVE76FPR","created_at":"2026-07-04T14:52:45Z"}],"graph_snapshots":[{"event_id":"sha256:b68d05443524985b6278992d679b69a0f7614cdc38ba6b2e3380f0b661029dd0","target":"graph","created_at":"2026-07-04T14:52: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0601017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering number is said to be primitive if none of its proper divisors is a covering number. In this paper we give some sufficient conditions for n to be a (primitive) covering number; in particular, we show that for any r=2,3,... there are infinitely many primitive covering numbers having exactly r distinct prime divisors. In 1980 P. Erdos asked whether there are inf","authors_text":"Zhi-Wei Sun","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.NT","submitted_at":"2006-01-01T23:53:06Z","title":"On covering numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601017","kind":"arxiv","version":2},"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:6fcd070ef35cd58db5637b8acb9618b0426ccfca101775436117bb31d31c5b52","target":"record","created_at":"2026-07-04T14:52: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":"d4415ef7214d652be1fe4a2e0321126c4c42b7ae08aa73587e67ab1da27fe1da","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.NT","submitted_at":"2006-01-01T23:53:06Z","title_canon_sha256":"4e39b3998e920c6e6ef04229e53e413332f2d32fd64d031b1d66a18ba4cce2e4"},"schema_version":"1.0","source":{"id":"math/0601017","kind":"arxiv","version":2}},"canonical_sha256":"4549ff15f155013bed9a0d2b21597e6a6d525b67c7419f41ecb58b3a5770eb47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4549ff15f155013bed9a0d2b21597e6a6d525b67c7419f41ecb58b3a5770eb47","first_computed_at":"2026-07-04T14:52:45.853905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:52:45.853905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Motc1rxcGnP+CYfn3GErcR6wdoM2i9GMDhxM5LR2MoUNEo7bkyT8FBgNNjS4AohAsvMc19DD7WE8oR+BaUmDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:52:45.854308Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0601017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fcd070ef35cd58db5637b8acb9618b0426ccfca101775436117bb31d31c5b52","sha256:b68d05443524985b6278992d679b69a0f7614cdc38ba6b2e3380f0b661029dd0"],"state_sha256":"05cd6f8f2e87cc70baee5c206f8f0b5bfca49a3ff6f03795dac97e8438df9f9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXoYU+kYhTS2wGjRxru5LstdNyFLZmkZr8w/Z9WY3k5O8wBv4h1ge4ZkGK7zWpMoUcOScLtyGXGA989JbNmXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T23:42:50.290916Z","bundle_sha256":"92884aeb9e0f998c7f59e48ff6f884d3ec4b0bf633cec69b231e72d35638f68d"}}