{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LSSQEMYKZXCVJECRK34USMZGYP","short_pith_number":"pith:LSSQEMYK","schema_version":"1.0","canonical_sha256":"5ca502330acdc554905156f9493326c3ebd51640d6edddb81b9cefbb25651f54","source":{"kind":"arxiv","id":"1907.10363","version":1},"attestation_state":"computed","paper":{"title":"Classification of linear codes using canonical augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Iliya Bouyukliev, Stefka Bouyuklieva","submitted_at":"2019-07-24T11:02:23Z","abstract_excerpt":"We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements."},"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":"1907.10363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-24T11:02:23Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"41bed4ca22858e80b1627dda83422d5a821fc812bb2976cab9b5696a5bba2631","abstract_canon_sha256":"a99a94ad16b136d160464e97228d7c0d3f6314bd05aadc84905dbc615b94d91a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.169964Z","signature_b64":"OqRE9cRFUXMlPe5jyVw5GsFmqJ4ZEsHOsHB0QVv8e4nsro9daC60IfnsIm7lXLW7+Vd6PgY8KnDnKNy4iLqcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ca502330acdc554905156f9493326c3ebd51640d6edddb81b9cefbb25651f54","last_reissued_at":"2026-05-17T23:39:38.169307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.169307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of linear codes using canonical augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Iliya Bouyukliev, Stefka Bouyuklieva","submitted_at":"2019-07-24T11:02:23Z","abstract_excerpt":"We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10363","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":""},"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":"1907.10363","created_at":"2026-05-17T23:39:38.169423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10363v1","created_at":"2026-05-17T23:39:38.169423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10363","created_at":"2026-05-17T23:39:38.169423+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSSQEMYKZXCV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSSQEMYKZXCVJECR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSSQEMYK","created_at":"2026-05-18T12:33:21.387695+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/LSSQEMYKZXCVJECRK34USMZGYP","json":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP.json","graph_json":"https://pith.science/api/pith-number/LSSQEMYKZXCVJECRK34USMZGYP/graph.json","events_json":"https://pith.science/api/pith-number/LSSQEMYKZXCVJECRK34USMZGYP/events.json","paper":"https://pith.science/paper/LSSQEMYK"},"agent_actions":{"view_html":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP","download_json":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP.json","view_paper":"https://pith.science/paper/LSSQEMYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10363&json=true","fetch_graph":"https://pith.science/api/pith-number/LSSQEMYKZXCVJECRK34USMZGYP/graph.json","fetch_events":"https://pith.science/api/pith-number/LSSQEMYKZXCVJECRK34USMZGYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP/action/storage_attestation","attest_author":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP/action/author_attestation","sign_citation":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP/action/citation_signature","submit_replication":"https://pith.science/pith/LSSQEMYKZXCVJECRK34USMZGYP/action/replication_record"}},"created_at":"2026-05-17T23:39:38.169423+00:00","updated_at":"2026-05-17T23:39:38.169423+00:00"}