{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SYPIR5WVFJO6S3MG5BSYDTNUZL","short_pith_number":"pith:SYPIR5WV","canonical_record":{"source":{"id":"2403.17509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-26T09:11:27Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d66e98af1cc55b4e82b9541f9039df392be06ca1a90231c53a3b6ed3197e6cf4","abstract_canon_sha256":"8b47d4d8c2505a0a340cc49e57a676bdcd1aa9a8ce05545adf3e742a711723fa"},"schema_version":"1.0"},"canonical_sha256":"961e88f6d52a5de96d86e86581cdb4cacb77c8add8f3205043e35cbb8ee21425","source":{"kind":"arxiv","id":"2403.17509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.17509","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2403.17509v1","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17509","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"SYPIR5WVFJO6","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYPIR5WVFJO6S3MG","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYPIR5WV","created_at":"2026-07-05T10:15:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SYPIR5WVFJO6S3MG5BSYDTNUZL","target":"record","payload":{"canonical_record":{"source":{"id":"2403.17509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-26T09:11:27Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d66e98af1cc55b4e82b9541f9039df392be06ca1a90231c53a3b6ed3197e6cf4","abstract_canon_sha256":"8b47d4d8c2505a0a340cc49e57a676bdcd1aa9a8ce05545adf3e742a711723fa"},"schema_version":"1.0"},"canonical_sha256":"961e88f6d52a5de96d86e86581cdb4cacb77c8add8f3205043e35cbb8ee21425","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:43.403795Z","signature_b64":"YwSLLv0g7NkkBKZsowDZPfPmqiUkMGz4YaRYeeVDtAQnYTmUqzW/bClRT4GNf9nCAc4WNRcralKsoyPG/0o/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961e88f6d52a5de96d86e86581cdb4cacb77c8add8f3205043e35cbb8ee21425","last_reissued_at":"2026-07-05T10:15:43.403364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:43.403364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.17509","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-07-05T10:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAtbnw32FdLLK8LusPIx8iT0Q2nNmmO7n60Guvn5mQK2mkTB+3gPUNpZlsdoDoCqXhcfYuJB2Ig5PIfc91csAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:26:14.383813Z"},"content_sha256":"5236cca38fac950657b65fa319b39b28d578c567dce40944b1cd9da30e308d56","schema_version":"1.0","event_id":"sha256:5236cca38fac950657b65fa319b39b28d578c567dce40944b1cd9da30e308d56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SYPIR5WVFJO6S3MG5BSYDTNUZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computer classification of linear codes based on lattice point enumeration and integer linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz","submitted_at":"2024-03-26T09:11:27Z","abstract_excerpt":"Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in Galois Geometry often require a certain divisibility of the occurring weights. In this paper we present an algorithmic framework for the classification of linear codes over finite fields with restricted sets of weights. The underlying algorithms are based on lattice point enumeration and integer linear programming. We present new enumeration and non-existence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17509","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/2403.17509/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-07-05T10:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zy+AYFc6x4IcoFrSikklCjIb0IbO9TgCO6c2gsbfdWzS6YEeUvZF7d6opOgGC8FU5IoOEdR3K3ACqMt0Ltm0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:26:14.384396Z"},"content_sha256":"8544c160883b51fb12cddb055d0d42746af08d0b00b284117b6be6bfbb6b54a3","schema_version":"1.0","event_id":"sha256:8544c160883b51fb12cddb055d0d42746af08d0b00b284117b6be6bfbb6b54a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/bundle.json","state_url":"https://pith.science/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/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-08-11T12:26:14Z","links":{"resolver":"https://pith.science/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL","bundle":"https://pith.science/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/bundle.json","state":"https://pith.science/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYPIR5WVFJO6S3MG5BSYDTNUZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SYPIR5WVFJO6S3MG5BSYDTNUZL","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":"8b47d4d8c2505a0a340cc49e57a676bdcd1aa9a8ce05545adf3e742a711723fa","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-26T09:11:27Z","title_canon_sha256":"d66e98af1cc55b4e82b9541f9039df392be06ca1a90231c53a3b6ed3197e6cf4"},"schema_version":"1.0","source":{"id":"2403.17509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.17509","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2403.17509v1","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17509","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"SYPIR5WVFJO6","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYPIR5WVFJO6S3MG","created_at":"2026-07-05T10:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYPIR5WV","created_at":"2026-07-05T10:15:43Z"}],"graph_snapshots":[{"event_id":"sha256:8544c160883b51fb12cddb055d0d42746af08d0b00b284117b6be6bfbb6b54a3","target":"graph","created_at":"2026-07-05T10:15:43Z","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/2403.17509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in Galois Geometry often require a certain divisibility of the occurring weights. In this paper we present an algorithmic framework for the classification of linear codes over finite fields with restricted sets of weights. The underlying algorithms are based on lattice point enumeration and integer linear programming. We present new enumeration and non-existence","authors_text":"Sascha Kurz","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-26T09:11:27Z","title":"Computer classification of linear codes based on lattice point enumeration and integer linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17509","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:5236cca38fac950657b65fa319b39b28d578c567dce40944b1cd9da30e308d56","target":"record","created_at":"2026-07-05T10:15:43Z","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":"8b47d4d8c2505a0a340cc49e57a676bdcd1aa9a8ce05545adf3e742a711723fa","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-26T09:11:27Z","title_canon_sha256":"d66e98af1cc55b4e82b9541f9039df392be06ca1a90231c53a3b6ed3197e6cf4"},"schema_version":"1.0","source":{"id":"2403.17509","kind":"arxiv","version":1}},"canonical_sha256":"961e88f6d52a5de96d86e86581cdb4cacb77c8add8f3205043e35cbb8ee21425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"961e88f6d52a5de96d86e86581cdb4cacb77c8add8f3205043e35cbb8ee21425","first_computed_at":"2026-07-05T10:15:43.403364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:43.403364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YwSLLv0g7NkkBKZsowDZPfPmqiUkMGz4YaRYeeVDtAQnYTmUqzW/bClRT4GNf9nCAc4WNRcralKsoyPG/0o/Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:43.403795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.17509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5236cca38fac950657b65fa319b39b28d578c567dce40944b1cd9da30e308d56","sha256:8544c160883b51fb12cddb055d0d42746af08d0b00b284117b6be6bfbb6b54a3"],"state_sha256":"7b0ac4aeb2a0d60fced1dab888d6dfd793c0561d50916a92aaa52c73f4fce59b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6Tc3j+2ZqLh/nYQHjLQuzHJXTugD5g5YFWdxNfAO06rP4AQEUxav1oCOxDdvzvqIfgprpcTWAzXUqIeMC8DBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:26:14.389026Z","bundle_sha256":"758cac2f525078e2fcded564f1fd2d6afdf1230039e135346150767afee3805a"}}