{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DDTJP7PXTOSWCY3DNECRYYBJVR","short_pith_number":"pith:DDTJP7PX","canonical_record":{"source":{"id":"2002.07826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-18T19:01:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6481e3584082abc2ac993bc3601b6f7d85da08176695538fa5e82e06301e8ebf","abstract_canon_sha256":"212f2bb446f8c29fe539db2a9442af9e46fec56ba47d3a120f4853837b7bcc9c"},"schema_version":"1.0"},"canonical_sha256":"18e697fdf79ba561636369051c6029ac6509c5b08cb6f0f21c30bd552e46ebf1","source":{"kind":"arxiv","id":"2002.07826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07826","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07826v1","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07826","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"DDTJP7PXTOSW","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_16","alias_value":"DDTJP7PXTOSWCY3D","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_8","alias_value":"DDTJP7PX","created_at":"2026-07-05T03:15:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DDTJP7PXTOSWCY3DNECRYYBJVR","target":"record","payload":{"canonical_record":{"source":{"id":"2002.07826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-18T19:01:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6481e3584082abc2ac993bc3601b6f7d85da08176695538fa5e82e06301e8ebf","abstract_canon_sha256":"212f2bb446f8c29fe539db2a9442af9e46fec56ba47d3a120f4853837b7bcc9c"},"schema_version":"1.0"},"canonical_sha256":"18e697fdf79ba561636369051c6029ac6509c5b08cb6f0f21c30bd552e46ebf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:27.165172Z","signature_b64":"rt4G+M0BcUir249qazxFBPuHVR4dkknZtxmOQdEyp4CXMyIzeDyrr133N5ShgHU4TnUxa0Y3eJrqvbALRiEkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e697fdf79ba561636369051c6029ac6509c5b08cb6f0f21c30bd552e46ebf1","last_reissued_at":"2026-07-05T03:15:27.164811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:27.164811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.07826","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-05T03:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNGfV9oKQ8n2+4Khz1Wps1shz8z1TFUt0RzMVVN9vQVA3SAsYK4sH7Ugl8GeL0DkT7blg4+eWXfdGIowES5QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T02:59:03.603580Z"},"content_sha256":"5952cdb0ba033c22321047bc8552d026e0477b38b50a3fd272aa5994f740a229","schema_version":"1.0","event_id":"sha256:5952cdb0ba033c22321047bc8552d026e0477b38b50a3fd272aa5994f740a229"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DDTJP7PXTOSWCY3DNECRYYBJVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computer classification of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iliya Bouyukliev, Sascha Kurz, Stefka Bouyuklieva","submitted_at":"2020-02-18T19:01:05Z","abstract_excerpt":"We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements. We validate a correct implementation of the algorithms with known classification results from the literature, which we partially extend to larger ranges of parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07826","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/2002.07826/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-05T03:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUzHW7OO7oLvK3hsr5m5Lnc6BOWj4AZmHzTEwUjHQCsNkPDQOouRJmBNNYANsIy5nDtg5GtmWiBDZhrT5k5TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T02:59:03.604102Z"},"content_sha256":"0f36e357e51800283cec3f2aca755427859dfcb7affb06b51dc950344950ad5c","schema_version":"1.0","event_id":"sha256:0f36e357e51800283cec3f2aca755427859dfcb7affb06b51dc950344950ad5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/bundle.json","state_url":"https://pith.science/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/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-12T02:59:03Z","links":{"resolver":"https://pith.science/pith/DDTJP7PXTOSWCY3DNECRYYBJVR","bundle":"https://pith.science/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/bundle.json","state":"https://pith.science/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDTJP7PXTOSWCY3DNECRYYBJVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DDTJP7PXTOSWCY3DNECRYYBJVR","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":"212f2bb446f8c29fe539db2a9442af9e46fec56ba47d3a120f4853837b7bcc9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-18T19:01:05Z","title_canon_sha256":"6481e3584082abc2ac993bc3601b6f7d85da08176695538fa5e82e06301e8ebf"},"schema_version":"1.0","source":{"id":"2002.07826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07826","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07826v1","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07826","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"DDTJP7PXTOSW","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_16","alias_value":"DDTJP7PXTOSWCY3D","created_at":"2026-07-05T03:15:27Z"},{"alias_kind":"pith_short_8","alias_value":"DDTJP7PX","created_at":"2026-07-05T03:15:27Z"}],"graph_snapshots":[{"event_id":"sha256:0f36e357e51800283cec3f2aca755427859dfcb7affb06b51dc950344950ad5c","target":"graph","created_at":"2026-07-05T03:15:27Z","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/2002.07826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements. We validate a correct implementation of the algorithms with known classification results from the literature, which we partially extend to larger ranges of parameters.","authors_text":"Iliya Bouyukliev, Sascha Kurz, Stefka Bouyuklieva","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-18T19:01:05Z","title":"Computer classification of linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07826","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:5952cdb0ba033c22321047bc8552d026e0477b38b50a3fd272aa5994f740a229","target":"record","created_at":"2026-07-05T03:15:27Z","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":"212f2bb446f8c29fe539db2a9442af9e46fec56ba47d3a120f4853837b7bcc9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-18T19:01:05Z","title_canon_sha256":"6481e3584082abc2ac993bc3601b6f7d85da08176695538fa5e82e06301e8ebf"},"schema_version":"1.0","source":{"id":"2002.07826","kind":"arxiv","version":1}},"canonical_sha256":"18e697fdf79ba561636369051c6029ac6509c5b08cb6f0f21c30bd552e46ebf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18e697fdf79ba561636369051c6029ac6509c5b08cb6f0f21c30bd552e46ebf1","first_computed_at":"2026-07-05T03:15:27.164811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:15:27.164811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rt4G+M0BcUir249qazxFBPuHVR4dkknZtxmOQdEyp4CXMyIzeDyrr133N5ShgHU4TnUxa0Y3eJrqvbALRiEkAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:15:27.165172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5952cdb0ba033c22321047bc8552d026e0477b38b50a3fd272aa5994f740a229","sha256:0f36e357e51800283cec3f2aca755427859dfcb7affb06b51dc950344950ad5c"],"state_sha256":"d4b03aabbc656b50eef7952b33a587e867362e15192010bf67f33c73d15fb95a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiZwZw2vGZUcywuKhiWO5Z5WTnzW80KkNJoaMbgXTJzxsPChh1HLihDogjpaHBystVYUl6+tKbMtZiPCe4wiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T02:59:03.607789Z","bundle_sha256":"2d14302f4ba497712519d70880b92e481e4693b3cdf2a9d2abd098a8b8647ea8"}}