{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XJAIJTPBLI343ETNY6OMYGHZA7","short_pith_number":"pith:XJAIJTPB","schema_version":"1.0","canonical_sha256":"ba4084cde15a37cd926dc79ccc18f907e72596b26ee7da3f01ca4bb1e40bd2f4","source":{"kind":"arxiv","id":"2011.02923","version":1},"attestation_state":"computed","paper":{"title":"A generalization of the cylinder conjecture for divisible codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sam Mattheus, Sascha Kurz","submitted_at":"2020-11-05T15:48:04Z","abstract_excerpt":"We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\\mathbb{F}_q$ and their classification. Through a mix of linear programming, combinatorial techniques and computer enumeration, we investigate the structural properties of these codes. In this way, we can prove a reduction theorem for a generalization of the cylinder conjecture, show some instances where it does not hold and prove its validity for small values of $q$. In particular, we correct a flawed proof for the original cylinder conjectur"},"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":"2011.02923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-05T15:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"a4fd75020917b9c973773763246321c5a741460fa1aa7790016990e4edb0ea7a","abstract_canon_sha256":"9baf63eb178faf388a9040f2320e574429431631f66be596cd68e34d175440f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:55.786745Z","signature_b64":"bw9idNUflbO0tDrgqKl9r3/398Brvhw97UWa4oEcEDkc6fbCYoSA+Wsh/n3LNSmU2L1ZNyV4DwVVt0X1tz8yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4084cde15a37cd926dc79ccc18f907e72596b26ee7da3f01ca4bb1e40bd2f4","last_reissued_at":"2026-07-05T03:39:55.786349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:55.786349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of the cylinder conjecture for divisible codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sam Mattheus, Sascha Kurz","submitted_at":"2020-11-05T15:48:04Z","abstract_excerpt":"We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\\mathbb{F}_q$ and their classification. Through a mix of linear programming, combinatorial techniques and computer enumeration, we investigate the structural properties of these codes. In this way, we can prove a reduction theorem for a generalization of the cylinder conjecture, show some instances where it does not hold and prove its validity for small values of $q$. In particular, we correct a flawed proof for the original cylinder conjectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.02923","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/2011.02923/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":"2011.02923","created_at":"2026-07-05T03:39:55.786423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.02923v1","created_at":"2026-07-05T03:39:55.786423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.02923","created_at":"2026-07-05T03:39:55.786423+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJAIJTPBLI34","created_at":"2026-07-05T03:39:55.786423+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJAIJTPBLI343ETN","created_at":"2026-07-05T03:39:55.786423+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJAIJTPB","created_at":"2026-07-05T03:39:55.786423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7","json":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7.json","graph_json":"https://pith.science/api/pith-number/XJAIJTPBLI343ETNY6OMYGHZA7/graph.json","events_json":"https://pith.science/api/pith-number/XJAIJTPBLI343ETNY6OMYGHZA7/events.json","paper":"https://pith.science/paper/XJAIJTPB"},"agent_actions":{"view_html":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7","download_json":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7.json","view_paper":"https://pith.science/paper/XJAIJTPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.02923&json=true","fetch_graph":"https://pith.science/api/pith-number/XJAIJTPBLI343ETNY6OMYGHZA7/graph.json","fetch_events":"https://pith.science/api/pith-number/XJAIJTPBLI343ETNY6OMYGHZA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7/action/storage_attestation","attest_author":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7/action/author_attestation","sign_citation":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7/action/citation_signature","submit_replication":"https://pith.science/pith/XJAIJTPBLI343ETNY6OMYGHZA7/action/replication_record"}},"created_at":"2026-07-05T03:39:55.786423+00:00","updated_at":"2026-07-05T03:39:55.786423+00:00"}