{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RW4MOUQAVRHEDQQYPSGTKKAFAX","short_pith_number":"pith:RW4MOUQA","canonical_record":{"source":{"id":"2402.03810","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-06T08:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"4a81f9ca657a8295be0288c79d14afd1c15938fa95dd71f836a9b07ce011184b","abstract_canon_sha256":"927960e2f436d4f8f3dba54b0170c26ef889a818c58c62adb3051760e761eb69"},"schema_version":"1.0"},"canonical_sha256":"8db8c75200ac4e41c2187c8d35280505ef1ca51996ed56378fbd864e5e18fe33","source":{"kind":"arxiv","id":"2402.03810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.03810","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.03810v2","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03810","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"RW4MOUQAVRHE","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"RW4MOUQAVRHEDQQY","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"RW4MOUQA","created_at":"2026-06-09T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RW4MOUQAVRHEDQQYPSGTKKAFAX","target":"record","payload":{"canonical_record":{"source":{"id":"2402.03810","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-06T08:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"4a81f9ca657a8295be0288c79d14afd1c15938fa95dd71f836a9b07ce011184b","abstract_canon_sha256":"927960e2f436d4f8f3dba54b0170c26ef889a818c58c62adb3051760e761eb69"},"schema_version":"1.0"},"canonical_sha256":"8db8c75200ac4e41c2187c8d35280505ef1ca51996ed56378fbd864e5e18fe33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:03.255930Z","signature_b64":"eALnLtbVAv0jiFxzp97P0Pw+y9aiDRbG0dIOWTwKs1HHxRuwLqGA+nF8diFOw16LlI08ihAcfP2Ad0W8saWDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8db8c75200ac4e41c2187c8d35280505ef1ca51996ed56378fbd864e5e18fe33","last_reissued_at":"2026-06-09T01:05:03.255437Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:03.255437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.03810","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-06-09T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLIthNLe/SEkKxYIqPC9XmaXVkIBEEMPtiBErvKOHjAyQgcFznw7VgusyhIDOEptepBBBVbcINaOFmkaer8iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:03.389287Z"},"content_sha256":"c6d514a009908e39b60a6e3926fa9c72e5beb7b31a63ccdf6d357230d7b1fd02","schema_version":"1.0","event_id":"sha256:c6d514a009908e39b60a6e3926fa9c72e5beb7b31a63ccdf6d357230d7b1fd02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RW4MOUQAVRHEDQQYPSGTKKAFAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Erd\\H{o}s covering systems in global function fields","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Biao Wang, Chunlin Wang, Huixi Li, Shaoyun Yi","submitted_at":"2024-02-06T08:53:57Z","abstract_excerpt":"A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers. A well-known problem on covering systems is the minimum modulus problem posed by Erd\\H{o}s in 1950, who asked whether the minimum modulus in such systems with distinct moduli can be arbitrarily large. This problem was resolved by Hough in 2015, who showed that the minimum modulus is at most $10^{16}$. In 2022, Balister, Bollob\\'as, Morris, Sahasrabudhe and Tiba reduced Hough's bound to $616,000$ by developing Hough's method. They call it the distortion method. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03810","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/2402.03810/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-06-09T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhrZ0gbwbU7/GNra7VxJGYB9p0XOiJENRiu5k21U0+huBOMjESNN5Z8LTVT8WlSjtMc5uardCpEOvmPchBLRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:03.389668Z"},"content_sha256":"e2291fba05bd08160c2923ca0d6c7526979181d8b42479dd3100809bd2464497","schema_version":"1.0","event_id":"sha256:e2291fba05bd08160c2923ca0d6c7526979181d8b42479dd3100809bd2464497"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/bundle.json","state_url":"https://pith.science/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/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-27T16:11:03Z","links":{"resolver":"https://pith.science/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX","bundle":"https://pith.science/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/bundle.json","state":"https://pith.science/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RW4MOUQAVRHEDQQYPSGTKKAFAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RW4MOUQAVRHEDQQYPSGTKKAFAX","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":"927960e2f436d4f8f3dba54b0170c26ef889a818c58c62adb3051760e761eb69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-06T08:53:57Z","title_canon_sha256":"4a81f9ca657a8295be0288c79d14afd1c15938fa95dd71f836a9b07ce011184b"},"schema_version":"1.0","source":{"id":"2402.03810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.03810","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.03810v2","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03810","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"RW4MOUQAVRHE","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"RW4MOUQAVRHEDQQY","created_at":"2026-06-09T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"RW4MOUQA","created_at":"2026-06-09T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:e2291fba05bd08160c2923ca0d6c7526979181d8b42479dd3100809bd2464497","target":"graph","created_at":"2026-06-09T01:05:03Z","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/2402.03810/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers. A well-known problem on covering systems is the minimum modulus problem posed by Erd\\H{o}s in 1950, who asked whether the minimum modulus in such systems with distinct moduli can be arbitrarily large. This problem was resolved by Hough in 2015, who showed that the minimum modulus is at most $10^{16}$. In 2022, Balister, Bollob\\'as, Morris, Sahasrabudhe and Tiba reduced Hough's bound to $616,000$ by developing Hough's method. They call it the distortion method. In this paper, ","authors_text":"Biao Wang, Chunlin Wang, Huixi Li, Shaoyun Yi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-06T08:53:57Z","title":"On Erd\\H{o}s covering systems in global function fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03810","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:c6d514a009908e39b60a6e3926fa9c72e5beb7b31a63ccdf6d357230d7b1fd02","target":"record","created_at":"2026-06-09T01:05:03Z","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":"927960e2f436d4f8f3dba54b0170c26ef889a818c58c62adb3051760e761eb69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-06T08:53:57Z","title_canon_sha256":"4a81f9ca657a8295be0288c79d14afd1c15938fa95dd71f836a9b07ce011184b"},"schema_version":"1.0","source":{"id":"2402.03810","kind":"arxiv","version":2}},"canonical_sha256":"8db8c75200ac4e41c2187c8d35280505ef1ca51996ed56378fbd864e5e18fe33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8db8c75200ac4e41c2187c8d35280505ef1ca51996ed56378fbd864e5e18fe33","first_computed_at":"2026-06-09T01:05:03.255437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:03.255437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eALnLtbVAv0jiFxzp97P0Pw+y9aiDRbG0dIOWTwKs1HHxRuwLqGA+nF8diFOw16LlI08ihAcfP2Ad0W8saWDCg==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:03.255930Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.03810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6d514a009908e39b60a6e3926fa9c72e5beb7b31a63ccdf6d357230d7b1fd02","sha256:e2291fba05bd08160c2923ca0d6c7526979181d8b42479dd3100809bd2464497"],"state_sha256":"a81765bfc72a7def56386c5793e902380f1849a4c4789cb09853af83eba5b1d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0piqphQC7acjedV2selcZg5pOa0/r2sbi1/fmObTNzW44cKb93tw52DCSELwR42AXhMPwZxUH6Txfmns90HtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:11:03.391628Z","bundle_sha256":"d35f077139647fb1c12963f03308bd2ab0c8a764e264080888579545e1a162e1"}}