{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4VRGGDJSXIQT2BCVJAPL5F7JUT","short_pith_number":"pith:4VRGGDJS","canonical_record":{"source":{"id":"2606.13307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T13:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"32cfca59e0be840bddfdb55ac579ea9b3e1a04cbb270b30d5c47153ef1ecb959","abstract_canon_sha256":"de0fc78f52630fc3eb63126d406effd4aebb012afcf22ba08c51ff93c8f96431"},"schema_version":"1.0"},"canonical_sha256":"e562630d32ba213d0455481ebe97e9a4f35115852af5659c00502eb3e3937485","source":{"kind":"arxiv","id":"2606.13307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13307","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13307v1","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13307","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"4VRGGDJSXIQT","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"4VRGGDJSXIQT2BCV","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"4VRGGDJS","created_at":"2026-06-12T01:09:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4VRGGDJSXIQT2BCVJAPL5F7JUT","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T13:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"32cfca59e0be840bddfdb55ac579ea9b3e1a04cbb270b30d5c47153ef1ecb959","abstract_canon_sha256":"de0fc78f52630fc3eb63126d406effd4aebb012afcf22ba08c51ff93c8f96431"},"schema_version":"1.0"},"canonical_sha256":"e562630d32ba213d0455481ebe97e9a4f35115852af5659c00502eb3e3937485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:51.541361Z","signature_b64":"/xoyUKrgpV8Y7oIdeVjf4q2Dr0MRcBYVqw39KWxj9/1GQCh6+8DaGAtL3+8NbaN2jBvWZor0oKJUZv0WsA9UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e562630d32ba213d0455481ebe97e9a4f35115852af5659c00502eb3e3937485","last_reissued_at":"2026-06-12T01:09:51.539618Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:51.539618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13307","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-12T01:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otg6WgkIOeKoNDxUGFWbMsbI7u/4AmJWkDZ2jRZwtBz8Br/tnr/Ie+vmRkj41G/3y7cPmCVah3OKHYY3q+l+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:27:09.441989Z"},"content_sha256":"feea761832d2d1e685e093316d46ca7d5f5a184a7c574b3913499585bcba8165","schema_version":"1.0","event_id":"sha256:feea761832d2d1e685e093316d46ca7d5f5a184a7c574b3913499585bcba8165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4VRGGDJSXIQT2BCVJAPL5F7JUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Fourier Transform Approach to Cyclically Covering Subspaces of $\\mathbb{F}^n_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Pingzhi Yuan, Yangcheng Li","submitted_at":"2026-06-11T13:04:23Z","abstract_excerpt":"Let $q$ be a prime power and $n$ a positive integer. A subspace \\( U \\subseteq \\mathbb{F}_q^n \\) is called cyclically covering if the union of all its cyclic shifts covers the whole space \\( \\mathbb{F}_q^n \\). Let \\( h_q(n) \\) denote the maximum possible codimension of such a subspace. When \\(\\gcd(q,n)=1\\), we derive necessary and sufficient conditions for \\(h_q(n)=0\\) via Discrete Fourier Transforms, and prove this equality is equivalent to the existence of full-weight codewords in cyclic codes of \\(\\mathbb{F}_q^n\\). We also characterize codimension-$k$ cyclically covering subspaces.\n  Based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13307","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.13307/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-12T01:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XY+zOQ0FYxTuAXsW78bfGb4t2zfuHN3KEo/oJJIGMvYOeLZUHkiM4H8r6dkfCjHwyEh35RZgWUo1/XfCZNyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:27:09.442374Z"},"content_sha256":"3d30585adacf7e5209dcaa13f63d7d2c64309c4c2f7c40fd4cc3a8e38925687c","schema_version":"1.0","event_id":"sha256:3d30585adacf7e5209dcaa13f63d7d2c64309c4c2f7c40fd4cc3a8e38925687c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/bundle.json","state_url":"https://pith.science/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/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-30T06:27:09Z","links":{"resolver":"https://pith.science/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT","bundle":"https://pith.science/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/bundle.json","state":"https://pith.science/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VRGGDJSXIQT2BCVJAPL5F7JUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4VRGGDJSXIQT2BCVJAPL5F7JUT","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":"de0fc78f52630fc3eb63126d406effd4aebb012afcf22ba08c51ff93c8f96431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T13:04:23Z","title_canon_sha256":"32cfca59e0be840bddfdb55ac579ea9b3e1a04cbb270b30d5c47153ef1ecb959"},"schema_version":"1.0","source":{"id":"2606.13307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13307","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13307v1","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13307","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"4VRGGDJSXIQT","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"4VRGGDJSXIQT2BCV","created_at":"2026-06-12T01:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"4VRGGDJS","created_at":"2026-06-12T01:09:51Z"}],"graph_snapshots":[{"event_id":"sha256:3d30585adacf7e5209dcaa13f63d7d2c64309c4c2f7c40fd4cc3a8e38925687c","target":"graph","created_at":"2026-06-12T01:09:51Z","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.13307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $q$ be a prime power and $n$ a positive integer. A subspace \\( U \\subseteq \\mathbb{F}_q^n \\) is called cyclically covering if the union of all its cyclic shifts covers the whole space \\( \\mathbb{F}_q^n \\). Let \\( h_q(n) \\) denote the maximum possible codimension of such a subspace. When \\(\\gcd(q,n)=1\\), we derive necessary and sufficient conditions for \\(h_q(n)=0\\) via Discrete Fourier Transforms, and prove this equality is equivalent to the existence of full-weight codewords in cyclic codes of \\(\\mathbb{F}_q^n\\). We also characterize codimension-$k$ cyclically covering subspaces.\n  Based ","authors_text":"Pingzhi Yuan, Yangcheng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T13:04:23Z","title":"Discrete Fourier Transform Approach to Cyclically Covering Subspaces of $\\mathbb{F}^n_q$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13307","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:feea761832d2d1e685e093316d46ca7d5f5a184a7c574b3913499585bcba8165","target":"record","created_at":"2026-06-12T01:09:51Z","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":"de0fc78f52630fc3eb63126d406effd4aebb012afcf22ba08c51ff93c8f96431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T13:04:23Z","title_canon_sha256":"32cfca59e0be840bddfdb55ac579ea9b3e1a04cbb270b30d5c47153ef1ecb959"},"schema_version":"1.0","source":{"id":"2606.13307","kind":"arxiv","version":1}},"canonical_sha256":"e562630d32ba213d0455481ebe97e9a4f35115852af5659c00502eb3e3937485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e562630d32ba213d0455481ebe97e9a4f35115852af5659c00502eb3e3937485","first_computed_at":"2026-06-12T01:09:51.539618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:51.539618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/xoyUKrgpV8Y7oIdeVjf4q2Dr0MRcBYVqw39KWxj9/1GQCh6+8DaGAtL3+8NbaN2jBvWZor0oKJUZv0WsA9UDg==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:51.541361Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feea761832d2d1e685e093316d46ca7d5f5a184a7c574b3913499585bcba8165","sha256:3d30585adacf7e5209dcaa13f63d7d2c64309c4c2f7c40fd4cc3a8e38925687c"],"state_sha256":"b258dfb69b47f111343cc16ada6d937f1ccabf8690c142bed264b0da5d41df62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18QrZ3dzXgMWdX14VEVb10DmBo+skroH1099PfX2T2mHJ/O+vgiUciQok1jmBqbOMeG9PzisFPJKZBY6Dj5aBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T06:27:09.444674Z","bundle_sha256":"0d60d3f923f12db24d25a6bad241c41a61c8db18b6e252521684366f49d7441c"}}