{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BZY3RCV4X37T2NQUOO54XPTWJT","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":"7f691ecbb4da7fe749c5e63ab8da1a7591ff61313fa827b6131fd55f2acec228","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-19T16:43:09Z","title_canon_sha256":"a468de3180cdd30827557d5f0ee7e4ab4ed736639478596c76d6f17f52255bf9"},"schema_version":"1.0","source":{"id":"1912.09357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.09357","created_at":"2026-07-05T00:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"1912.09357v1","created_at":"2026-07-05T00:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.09357","created_at":"2026-07-05T00:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"BZY3RCV4X37T","created_at":"2026-07-05T00:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"BZY3RCV4X37T2NQU","created_at":"2026-07-05T00:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"BZY3RCV4","created_at":"2026-07-05T00:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:eb8a59feacfabf356bdc40ffee8577a541ada3e7e4f3be652c0523fff759fb7b","target":"graph","created_at":"2026-07-05T00:27:25Z","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/1912.09357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we partially extend to larger ranges of parameters.","authors_text":"Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-19T16:43:09Z","title":"LinCode -- computer classification of linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.09357","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:ff397dcd93ccec676d4016cc142b9ceb13e0f638ffb82cd1f38bc19e2ed995c8","target":"record","created_at":"2026-07-05T00:27:25Z","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":"7f691ecbb4da7fe749c5e63ab8da1a7591ff61313fa827b6131fd55f2acec228","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-19T16:43:09Z","title_canon_sha256":"a468de3180cdd30827557d5f0ee7e4ab4ed736639478596c76d6f17f52255bf9"},"schema_version":"1.0","source":{"id":"1912.09357","kind":"arxiv","version":1}},"canonical_sha256":"0e71b88abcbeff3d361473bbcbbe764cd0d1df1de57d4d67f3efaf9b798a5a2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e71b88abcbeff3d361473bbcbbe764cd0d1df1de57d4d67f3efaf9b798a5a2f","first_computed_at":"2026-07-05T00:27:25.781920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:25.781920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Y2CU/ug6huRncu8cO884ZzEn82aQKdndOjqTUyACCzWfklC2c8/FKEARkRa6dnTbnpqfqYS6r2gF59wB5e7Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:25.782378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.09357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff397dcd93ccec676d4016cc142b9ceb13e0f638ffb82cd1f38bc19e2ed995c8","sha256:eb8a59feacfabf356bdc40ffee8577a541ada3e7e4f3be652c0523fff759fb7b"],"state_sha256":"c0bf75eca07b5657d8c65b121caef4955f1b9fda9986d095c512e9b22cc4ed94"}