{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LFRQ464GWV3BH4UGRKXYNKPLW4","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":"10e983618b980f54a1c1ed30ca4c28dd1023380dffdbad08de63593f27adda0f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T07:46:55Z","title_canon_sha256":"91c33626fcf2544d27f5a80c9e0fea446dc52e00ea08acb77687ec9110e01924"},"schema_version":"1.0","source":{"id":"1210.8253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8253","created_at":"2026-05-18T03:41:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8253v1","created_at":"2026-05-18T03:41:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8253","created_at":"2026-05-18T03:41:55Z"},{"alias_kind":"pith_short_12","alias_value":"LFRQ464GWV3B","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFRQ464GWV3BH4UG","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFRQ464G","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:e09412f53d4a50bf6821ae647a8cff71c8fb1e6860719851ff2cf80af11f8ce3","target":"graph","created_at":"2026-05-18T03:41:55Z","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":"It is proven that for any numbers n=2^m-1, m >= 4 and r, such that n - log(n+1)<= r <= n excluding n = r = 63, n = 127, r in {126,127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r.","authors_text":"Faina I. Solov'eva, George K. Guskov, Ivan Yu. Mogilnykh","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T07:46:55Z","title":"Ranks of propelinear perfect binary codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8253","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:6e56ec153933ec6ae27c8cb4baffd9d769d35c1f8b658735a887ee1ec4eec5f9","target":"record","created_at":"2026-05-18T03:41:55Z","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":"10e983618b980f54a1c1ed30ca4c28dd1023380dffdbad08de63593f27adda0f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T07:46:55Z","title_canon_sha256":"91c33626fcf2544d27f5a80c9e0fea446dc52e00ea08acb77687ec9110e01924"},"schema_version":"1.0","source":{"id":"1210.8253","kind":"arxiv","version":1}},"canonical_sha256":"59630e7b86b57613f2868aaf86a9ebb73de723c8d5634422b252d639de6b35c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59630e7b86b57613f2868aaf86a9ebb73de723c8d5634422b252d639de6b35c1","first_computed_at":"2026-05-18T03:41:55.554438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:55.554438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c4Tzs0KI/2IRPhR6lAzNKjz1kuwd701xMQTkQNJwDyiEpPAAmqsPfhxgK4dG74EcKE+oWzRU+2Cue/hzQVu+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:55.555033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e56ec153933ec6ae27c8cb4baffd9d769d35c1f8b658735a887ee1ec4eec5f9","sha256:e09412f53d4a50bf6821ae647a8cff71c8fb1e6860719851ff2cf80af11f8ce3"],"state_sha256":"9dc9ade3cdb51d46935373647f713e216b95ca2bf05b912a017b96949fbaa76e"}