{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O4GCSXOD32XVYV6B27XWNM5ECZ","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":"40f98f4433082bc41b845ca472318f71ccabfdd48051bab5e1abc44a77145b3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-11T09:32:57Z","title_canon_sha256":"4ed9f5232dd32cb5d422f9bbc2e5ff42f2e4e85b2df3e9b5cf2150c951a25188"},"schema_version":"1.0","source":{"id":"1809.03764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03764","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03764v1","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03764","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"O4GCSXOD32XV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O4GCSXOD32XVYV6B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O4GCSXOD","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:ff86c014953f0839223d3ee1a269f7e62d24f0119d13e7dd1cb78066633ebccf","target":"graph","created_at":"2026-05-18T00:05:59Z","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"},"paper":{"abstract_excerpt":"In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have also considered the usefulness of combinatorial $2$-$(t,k,1)$ designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence.","authors_text":"Krassimir Enev, Nikolay Yankov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-11T09:32:57Z","title":"A note on reducing the computation time for minimum distance and equivalence check of binary linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03764","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:660fda564e7ef9159584d1ecd31395c1771ce96f5f9a0b64f256521eae8095f2","target":"record","created_at":"2026-05-18T00:05:59Z","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":"40f98f4433082bc41b845ca472318f71ccabfdd48051bab5e1abc44a77145b3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-11T09:32:57Z","title_canon_sha256":"4ed9f5232dd32cb5d422f9bbc2e5ff42f2e4e85b2df3e9b5cf2150c951a25188"},"schema_version":"1.0","source":{"id":"1809.03764","kind":"arxiv","version":1}},"canonical_sha256":"770c295dc3deaf5c57c1d7ef66b3a41672b167ff077a7f3fcc81b2474adbbbb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"770c295dc3deaf5c57c1d7ef66b3a41672b167ff077a7f3fcc81b2474adbbbb4","first_computed_at":"2026-05-18T00:05:59.887896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:59.887896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBU1m2/I090u76jWrsfBYAwub/kAzNoIE6JPkq4y9Q7oUWLsx3gaSL1m5yBsBtfe7/ZC3cQ7W3ZSE+0sjTGrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:59.888443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:660fda564e7ef9159584d1ecd31395c1771ce96f5f9a0b64f256521eae8095f2","sha256:ff86c014953f0839223d3ee1a269f7e62d24f0119d13e7dd1cb78066633ebccf"],"state_sha256":"2cf41caada46a495ef8aff3ac6336bd55e724f6787b45b15242190b720661304"}