{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XPPRCVSZLTR2WHFDKUXXNODO4O","short_pith_number":"pith:XPPRCVSZ","canonical_record":{"source":{"id":"2606.09600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-08T15:09:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7305bdbb5f14d9a1bcd668c232a463e99653e77364c4f5f2540af9c61ca1d751","abstract_canon_sha256":"f8912fb8c4c3d383e826beee20f020fe50162d2222e97f31bf9eba165e6bd7e4"},"schema_version":"1.0"},"canonical_sha256":"bbdf1156595ce3ab1ca3552f76b86ee3abdbdc1f79c8ae93a53a82f52da64832","source":{"kind":"arxiv","id":"2606.09600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09600","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09600v1","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09600","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"XPPRCVSZLTR2","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_16","alias_value":"XPPRCVSZLTR2WHFD","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_8","alias_value":"XPPRCVSZ","created_at":"2026-06-09T02:08:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XPPRCVSZLTR2WHFDKUXXNODO4O","target":"record","payload":{"canonical_record":{"source":{"id":"2606.09600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-08T15:09:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7305bdbb5f14d9a1bcd668c232a463e99653e77364c4f5f2540af9c61ca1d751","abstract_canon_sha256":"f8912fb8c4c3d383e826beee20f020fe50162d2222e97f31bf9eba165e6bd7e4"},"schema_version":"1.0"},"canonical_sha256":"bbdf1156595ce3ab1ca3552f76b86ee3abdbdc1f79c8ae93a53a82f52da64832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:58.137202Z","signature_b64":"1E/l3EdhmdSG7FMwAUBcQrAfsKYiWaxKEJjlpoEE1DaUvDTDg5GjkiEiV0D32AxKEZbhGh9/AwPkx10B95TNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbdf1156595ce3ab1ca3552f76b86ee3abdbdc1f79c8ae93a53a82f52da64832","last_reissued_at":"2026-06-09T02:08:58.135928Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:58.135928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.09600","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-06-09T02:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPL7D5cFg86oouxuOjsEd8s1VWdCNBN2c0UlYMiUdvqIMKUoB9qsWE5OsSiILKpj7upSJdfO9fiMXjfGWZAkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:36:22.089679Z"},"content_sha256":"3d742726dacfddd7db4a49caea7b0fc6ed7edec455983485fc6d8bc2e3da32a7","schema_version":"1.0","event_id":"sha256:3d742726dacfddd7db4a49caea7b0fc6ed7edec455983485fc6d8bc2e3da32a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XPPRCVSZLTR2WHFDKUXXNODO4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formal Foundations and Proof-Carrying Certificates for q-ary Covering Codes in Lean 4","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Florath","submitted_at":"2026-06-08T15:09:56Z","abstract_excerpt":"Covering codes in finite Hamming spaces ask for small sets of words whose Hamming balls cover the whole space. This paper presents a Lean 4 formalization of the elementary theory of q-ary covering codes, centered on certificate predicates for upper bounds, lower bounds, and exact covering numbers $K_q(n,r)$. The formalization proves the q-ary Hamming-ball volume formula, the sphere-covering lower bound, elementary exact cases, product and relation rules, and selected small exact certificates. It also demonstrates an end-to-end workflow for checking explicit upper bounds transcribed from van La"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09600","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.09600/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-09T02:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q0d1sPevRkDrF5IcTZJ6IqmDpJbxrPWGSxAsBnJGbSfzbqy7hAidyV3rtKF8qQ1db3CqtSdUB8YReVM86ZSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:36:22.090634Z"},"content_sha256":"573c6d0bcf1b805d090a25cc04bf36c8012af347c9210c91b844b6e05c068c60","schema_version":"1.0","event_id":"sha256:573c6d0bcf1b805d090a25cc04bf36c8012af347c9210c91b844b6e05c068c60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/bundle.json","state_url":"https://pith.science/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/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-07-05T13:36:22Z","links":{"resolver":"https://pith.science/pith/XPPRCVSZLTR2WHFDKUXXNODO4O","bundle":"https://pith.science/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/bundle.json","state":"https://pith.science/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPPRCVSZLTR2WHFDKUXXNODO4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XPPRCVSZLTR2WHFDKUXXNODO4O","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":"f8912fb8c4c3d383e826beee20f020fe50162d2222e97f31bf9eba165e6bd7e4","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-08T15:09:56Z","title_canon_sha256":"7305bdbb5f14d9a1bcd668c232a463e99653e77364c4f5f2540af9c61ca1d751"},"schema_version":"1.0","source":{"id":"2606.09600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09600","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09600v1","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09600","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"XPPRCVSZLTR2","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_16","alias_value":"XPPRCVSZLTR2WHFD","created_at":"2026-06-09T02:08:58Z"},{"alias_kind":"pith_short_8","alias_value":"XPPRCVSZ","created_at":"2026-06-09T02:08:58Z"}],"graph_snapshots":[{"event_id":"sha256:573c6d0bcf1b805d090a25cc04bf36c8012af347c9210c91b844b6e05c068c60","target":"graph","created_at":"2026-06-09T02:08:58Z","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/2606.09600/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Covering codes in finite Hamming spaces ask for small sets of words whose Hamming balls cover the whole space. This paper presents a Lean 4 formalization of the elementary theory of q-ary covering codes, centered on certificate predicates for upper bounds, lower bounds, and exact covering numbers $K_q(n,r)$. The formalization proves the q-ary Hamming-ball volume formula, the sphere-covering lower bound, elementary exact cases, product and relation rules, and selected small exact certificates. It also demonstrates an end-to-end workflow for checking explicit upper bounds transcribed from van La","authors_text":"Andreas Florath","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-08T15:09:56Z","title":"Formal Foundations and Proof-Carrying Certificates for q-ary Covering Codes in Lean 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09600","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:3d742726dacfddd7db4a49caea7b0fc6ed7edec455983485fc6d8bc2e3da32a7","target":"record","created_at":"2026-06-09T02:08:58Z","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":"f8912fb8c4c3d383e826beee20f020fe50162d2222e97f31bf9eba165e6bd7e4","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-08T15:09:56Z","title_canon_sha256":"7305bdbb5f14d9a1bcd668c232a463e99653e77364c4f5f2540af9c61ca1d751"},"schema_version":"1.0","source":{"id":"2606.09600","kind":"arxiv","version":1}},"canonical_sha256":"bbdf1156595ce3ab1ca3552f76b86ee3abdbdc1f79c8ae93a53a82f52da64832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbdf1156595ce3ab1ca3552f76b86ee3abdbdc1f79c8ae93a53a82f52da64832","first_computed_at":"2026-06-09T02:08:58.135928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:58.135928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1E/l3EdhmdSG7FMwAUBcQrAfsKYiWaxKEJjlpoEE1DaUvDTDg5GjkiEiV0D32AxKEZbhGh9/AwPkx10B95TNCg==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:58.137202Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d742726dacfddd7db4a49caea7b0fc6ed7edec455983485fc6d8bc2e3da32a7","sha256:573c6d0bcf1b805d090a25cc04bf36c8012af347c9210c91b844b6e05c068c60"],"state_sha256":"1339778ea424ee1386fc8b7ac52bb7ddfa17ac2344c271d04957b037141342de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfRhMPCN8bpqEU+zqnyFwFjr/qDOUjM8VeXGEfROtCLZkDpZHH8k8RRx5OhWtTPptqVohwa1B9BF3WnlebjQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:36:22.094971Z","bundle_sha256":"a10aa510346ec6467c0560faa6cba37a64ee5b5f4f586ebbd7565d9c2bc6e1b1"}}