{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DNCATCMVBJJYADECW7U7BANRUI","short_pith_number":"pith:DNCATCMV","canonical_record":{"source":{"id":"1511.04293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T14:37:15Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e364c25315e8013dc1c2c952a7fb137bf481bd64d367254284d3bf816ef5f2aa","abstract_canon_sha256":"e2b52bf0b833214c3f6c19a90bdc4684077b94a7f25865b06210995ec4ffda56"},"schema_version":"1.0"},"canonical_sha256":"1b440989950a53800c82b7e9f081b1a23a87dc2702c227c7fb6abbe43541e3da","source":{"kind":"arxiv","id":"1511.04293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04293","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04293v1","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04293","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"DNCATCMVBJJY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DNCATCMVBJJYADEC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DNCATCMV","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DNCATCMVBJJYADECW7U7BANRUI","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T14:37:15Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e364c25315e8013dc1c2c952a7fb137bf481bd64d367254284d3bf816ef5f2aa","abstract_canon_sha256":"e2b52bf0b833214c3f6c19a90bdc4684077b94a7f25865b06210995ec4ffda56"},"schema_version":"1.0"},"canonical_sha256":"1b440989950a53800c82b7e9f081b1a23a87dc2702c227c7fb6abbe43541e3da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:59.225219Z","signature_b64":"8PN2/L9F/KPJ02sbmwJmh2AiYammuZ14TZfarxWw6stXXzXD78codG25mWGgdUkYgDmBl5KB1L286xmEJhUlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b440989950a53800c82b7e9f081b1a23a87dc2702c227c7fb6abbe43541e3da","last_reissued_at":"2026-05-18T01:26:59.224592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:59.224592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04293","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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8mRC2qtRF/q+Zbtu0jT7++f9UIvytbcZfUx4PAtnfeZYXrAG2JaSI2Xk9dPZvj7kmKof9BduPx7U+cUFalfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:24:18.726718Z"},"content_sha256":"eb19aeb462bfcfbc010f6ec4c23d829dd5a62620a3b3ffe3a10a432d293842de","schema_version":"1.0","event_id":"sha256:eb19aeb462bfcfbc010f6ec4c23d829dd5a62620a3b3ffe3a10a432d293842de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DNCATCMVBJJYADECW7U7BANRUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Searching for Disjoint Covering Systems with Precisely One Repeated Modulus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Aviezri S. Fraenkel, Doron Zeilberger, Shalosh B. Ekhad","submitted_at":"2015-11-13T14:37:15Z","abstract_excerpt":"A set of arithmetical sequences $$ a_1\\, (\\bmod{ \\,\\, m_1}) \\quad, \\quad a_2 \\, (\\bmod{\\,\\, m_2}) \\quad, \\quad \\dots \\quad , \\quad a_k \\, (\\bmod{\\,\\,m_k}) \\quad \\quad , $$ with $$ m_1 \\leq m_2 \\leq \\dots \\leq m_k \\quad \\quad , $$ is called a {\\it disjoint covering system} (alias {\\it exact covering system}) if every positive integer belongs to {\\bf exactly} one of the sequences. Mirski, Newman, Davenport and Rado famously proved that the moduli can't all be distinct. In fact the two largest moduli must be equal, i.e. $m_{k-1}=m_k$ This raises the natural question:\"How close can you get to gett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04293","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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvkL+lGzilfaR2PYq+6w6RT683x2/gGWQj8Ye3Jh6251gmvNHfzOXb/O1l0z2QPUyD+IJfdTwLI+lvoSXYUCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:24:18.727365Z"},"content_sha256":"1105d1c48a7be92b982f4fadd4fe421a110ec029daec2ca3d326f7aa45a23a9f","schema_version":"1.0","event_id":"sha256:1105d1c48a7be92b982f4fadd4fe421a110ec029daec2ca3d326f7aa45a23a9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNCATCMVBJJYADECW7U7BANRUI/bundle.json","state_url":"https://pith.science/pith/DNCATCMVBJJYADECW7U7BANRUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNCATCMVBJJYADECW7U7BANRUI/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-30T08:24:18Z","links":{"resolver":"https://pith.science/pith/DNCATCMVBJJYADECW7U7BANRUI","bundle":"https://pith.science/pith/DNCATCMVBJJYADECW7U7BANRUI/bundle.json","state":"https://pith.science/pith/DNCATCMVBJJYADECW7U7BANRUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNCATCMVBJJYADECW7U7BANRUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DNCATCMVBJJYADECW7U7BANRUI","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":"e2b52bf0b833214c3f6c19a90bdc4684077b94a7f25865b06210995ec4ffda56","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T14:37:15Z","title_canon_sha256":"e364c25315e8013dc1c2c952a7fb137bf481bd64d367254284d3bf816ef5f2aa"},"schema_version":"1.0","source":{"id":"1511.04293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04293","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04293v1","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04293","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"DNCATCMVBJJY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DNCATCMVBJJYADEC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DNCATCMV","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:1105d1c48a7be92b982f4fadd4fe421a110ec029daec2ca3d326f7aa45a23a9f","target":"graph","created_at":"2026-05-18T01:26:59Z","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 set of arithmetical sequences $$ a_1\\, (\\bmod{ \\,\\, m_1}) \\quad, \\quad a_2 \\, (\\bmod{\\,\\, m_2}) \\quad, \\quad \\dots \\quad , \\quad a_k \\, (\\bmod{\\,\\,m_k}) \\quad \\quad , $$ with $$ m_1 \\leq m_2 \\leq \\dots \\leq m_k \\quad \\quad , $$ is called a {\\it disjoint covering system} (alias {\\it exact covering system}) if every positive integer belongs to {\\bf exactly} one of the sequences. Mirski, Newman, Davenport and Rado famously proved that the moduli can't all be distinct. In fact the two largest moduli must be equal, i.e. $m_{k-1}=m_k$ This raises the natural question:\"How close can you get to gett","authors_text":"Aviezri S. Fraenkel, Doron Zeilberger, Shalosh B. Ekhad","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T14:37:15Z","title":"Searching for Disjoint Covering Systems with Precisely One Repeated Modulus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04293","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:eb19aeb462bfcfbc010f6ec4c23d829dd5a62620a3b3ffe3a10a432d293842de","target":"record","created_at":"2026-05-18T01:26:59Z","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":"e2b52bf0b833214c3f6c19a90bdc4684077b94a7f25865b06210995ec4ffda56","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T14:37:15Z","title_canon_sha256":"e364c25315e8013dc1c2c952a7fb137bf481bd64d367254284d3bf816ef5f2aa"},"schema_version":"1.0","source":{"id":"1511.04293","kind":"arxiv","version":1}},"canonical_sha256":"1b440989950a53800c82b7e9f081b1a23a87dc2702c227c7fb6abbe43541e3da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b440989950a53800c82b7e9f081b1a23a87dc2702c227c7fb6abbe43541e3da","first_computed_at":"2026-05-18T01:26:59.224592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:59.224592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8PN2/L9F/KPJ02sbmwJmh2AiYammuZ14TZfarxWw6stXXzXD78codG25mWGgdUkYgDmBl5KB1L286xmEJhUlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:59.225219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb19aeb462bfcfbc010f6ec4c23d829dd5a62620a3b3ffe3a10a432d293842de","sha256:1105d1c48a7be92b982f4fadd4fe421a110ec029daec2ca3d326f7aa45a23a9f"],"state_sha256":"9a5a69483c940b6d54e3b2bf8b5681a80b71fd21c0fac7038d2991785403aaef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqjpmPga/KzxOtDjhmw9rOutmWFBUy/ioUV3usJJQaIBQewDmAyKpZKj9T/WG6wKeRpZeFRgclIkFaR9gK8BBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:24:18.730482Z","bundle_sha256":"47135371f7122df38f94e7921fa00f8f4e7d4fcc3b5a92df33167318320e3099"}}