{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3Z6P2ZLRMKH4OYI6BPMXOGBB64","short_pith_number":"pith:3Z6P2ZLR","schema_version":"1.0","canonical_sha256":"de7cfd6571628fc7611e0bd9771821f705c2b3f615479b6904de338cc5ec7918","source":{"kind":"arxiv","id":"2312.07883","version":4},"attestation_state":"computed","paper":{"title":"Multispreads","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Ivan Yu. Mogilnykh","submitted_at":"2023-12-13T04:00:37Z","abstract_excerpt":"Additive one-weight codes over a finite field of non-prime order are equivalent to special subspace coverings of the points of a projective space, which we call multispreads. The current paper is devoted to the characterization of the parameters of multispreads, which is equivalent to the characterization of the parameters of additive one-weight codes and, via duality, of additive completely regular codes of covering radius 1 (intriguing sets). We characterize these parameters for the case of the prime-square order of the field and make a partial characterization for the prime-cube case and th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2312.07883","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-12-13T04:00:37Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"a21f1e818bfcc8b44ec7cbce088f2c0a678646bf69af124ebfa6a655f61bd45e","abstract_canon_sha256":"bd65100bc87e3173d8728c1d6168f13ba7e4bc1b3038838ca161fb5d44cbc955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:09.408075Z","signature_b64":"G0sPh1RI7N74dewQSnXqeM0BCM3RDET+0gcbLRpPh8hOKxwci8EzxSvl4jsnM1UgVf4G8vkkIzkBLIJ8TwIQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7cfd6571628fc7611e0bd9771821f705c2b3f615479b6904de338cc5ec7918","last_reissued_at":"2026-07-05T11:28:09.407594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:09.407594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multispreads","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Ivan Yu. Mogilnykh","submitted_at":"2023-12-13T04:00:37Z","abstract_excerpt":"Additive one-weight codes over a finite field of non-prime order are equivalent to special subspace coverings of the points of a projective space, which we call multispreads. The current paper is devoted to the characterization of the parameters of multispreads, which is equivalent to the characterization of the parameters of additive one-weight codes and, via duality, of additive completely regular codes of covering radius 1 (intriguing sets). We characterize these parameters for the case of the prime-square order of the field and make a partial characterization for the prime-cube case and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07883","kind":"arxiv","version":4},"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/2312.07883/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.07883","created_at":"2026-07-05T11:28:09.407652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.07883v4","created_at":"2026-07-05T11:28:09.407652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07883","created_at":"2026-07-05T11:28:09.407652+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z6P2ZLRMKH4","created_at":"2026-07-05T11:28:09.407652+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z6P2ZLRMKH4OYI6","created_at":"2026-07-05T11:28:09.407652+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z6P2ZLR","created_at":"2026-07-05T11:28:09.407652+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.07650","citing_title":"Optimal additive quaternary codes of dimension $3.5$ and $4$","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2412.14615","citing_title":"Additive codes attaining the Griesmer bound","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64","json":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64.json","graph_json":"https://pith.science/api/pith-number/3Z6P2ZLRMKH4OYI6BPMXOGBB64/graph.json","events_json":"https://pith.science/api/pith-number/3Z6P2ZLRMKH4OYI6BPMXOGBB64/events.json","paper":"https://pith.science/paper/3Z6P2ZLR"},"agent_actions":{"view_html":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64","download_json":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64.json","view_paper":"https://pith.science/paper/3Z6P2ZLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.07883&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z6P2ZLRMKH4OYI6BPMXOGBB64/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z6P2ZLRMKH4OYI6BPMXOGBB64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64/action/storage_attestation","attest_author":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64/action/author_attestation","sign_citation":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64/action/citation_signature","submit_replication":"https://pith.science/pith/3Z6P2ZLRMKH4OYI6BPMXOGBB64/action/replication_record"}},"created_at":"2026-07-05T11:28:09.407652+00:00","updated_at":"2026-07-05T11:28:09.407652+00:00"}