{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LFRQ464GWV3BH4UGRKXYNKPLW4","short_pith_number":"pith:LFRQ464G","schema_version":"1.0","canonical_sha256":"59630e7b86b57613f2868aaf86a9ebb73de723c8d5634422b252d639de6b35c1","source":{"kind":"arxiv","id":"1210.8253","version":1},"attestation_state":"computed","paper":{"title":"Ranks of propelinear perfect binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Faina I. Solov'eva, George K. Guskov, Ivan Yu. Mogilnykh","submitted_at":"2012-10-31T07:46:55Z","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."},"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":"1210.8253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T07:46:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"91c33626fcf2544d27f5a80c9e0fea446dc52e00ea08acb77687ec9110e01924","abstract_canon_sha256":"10e983618b980f54a1c1ed30ca4c28dd1023380dffdbad08de63593f27adda0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:55.555033Z","signature_b64":"c4Tzs0KI/2IRPhR6lAzNKjz1kuwd701xMQTkQNJwDyiEpPAAmqsPfhxgK4dG74EcKE+oWzRU+2Cue/hzQVu+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59630e7b86b57613f2868aaf86a9ebb73de723c8d5634422b252d639de6b35c1","last_reissued_at":"2026-05-18T03:41:55.554438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:55.554438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranks of propelinear perfect binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Faina I. Solov'eva, George K. Guskov, Ivan Yu. Mogilnykh","submitted_at":"2012-10-31T07:46:55Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8253","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":"1210.8253","created_at":"2026-05-18T03:41:55.554538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8253v1","created_at":"2026-05-18T03:41:55.554538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8253","created_at":"2026-05-18T03:41:55.554538+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFRQ464GWV3B","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFRQ464GWV3BH4UG","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFRQ464G","created_at":"2026-05-18T12:27:14.488303+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/LFRQ464GWV3BH4UGRKXYNKPLW4","json":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4.json","graph_json":"https://pith.science/api/pith-number/LFRQ464GWV3BH4UGRKXYNKPLW4/graph.json","events_json":"https://pith.science/api/pith-number/LFRQ464GWV3BH4UGRKXYNKPLW4/events.json","paper":"https://pith.science/paper/LFRQ464G"},"agent_actions":{"view_html":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4","download_json":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4.json","view_paper":"https://pith.science/paper/LFRQ464G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8253&json=true","fetch_graph":"https://pith.science/api/pith-number/LFRQ464GWV3BH4UGRKXYNKPLW4/graph.json","fetch_events":"https://pith.science/api/pith-number/LFRQ464GWV3BH4UGRKXYNKPLW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4/action/storage_attestation","attest_author":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4/action/author_attestation","sign_citation":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4/action/citation_signature","submit_replication":"https://pith.science/pith/LFRQ464GWV3BH4UGRKXYNKPLW4/action/replication_record"}},"created_at":"2026-05-18T03:41:55.554538+00:00","updated_at":"2026-05-18T03:41:55.554538+00:00"}