{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6UV5R2SNMW2BGTH3XXZOFXJ7GX","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":"d5eadf7f2df806e3afe800aa76627c93abf41dcdfa5ca275ed038b8552e144aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-04T21:50:27Z","title_canon_sha256":"884d4cad10b52b413a1ed089f5be5d6e66888a83fa0650093220300bc007a034"},"schema_version":"1.0","source":{"id":"1704.01199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01199","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01199v1","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01199","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"6UV5R2SNMW2B","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6UV5R2SNMW2BGTH3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6UV5R2SN","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:32754c55ad8a1a78bd3d7a3bd5869333c7f7fbd52273894d6ba853ebb9508a42","target":"graph","created_at":"2026-05-18T00:46:58Z","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":"The projective special linear group $\\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \\equiv 3 \\pmod{4}$ on the set $\\{0,1, \\cdots, n-1, \\infty\\}$. It is known that the extended odd-like quadratic residue codes are invariant under $\\PSL_2(n)$. Hence, the extended quadratic residue codes hold an infinite family of $2$-designs for primes $n \\equiv 1 \\pmod{4}$, an infinite family of $3$-designs for primes $n \\equiv 3 \\pmod{4}$. To construct more $t$-designs with $t \\in \\{2, 3\\}$, one would search for other extended cyclic codes over finite fields that are invariant under","authors_text":"Cunsheng Ding, Hao Liu, Vladimir D. Tonchev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-04T21:50:27Z","title":"All binary linear codes that are invariant under $\\PSL_2(n)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01199","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:abe0be8fbe347e77998f06183905b151a8f49acdba4b5a8f82d4d8dcc52dc724","target":"record","created_at":"2026-05-18T00:46:58Z","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":"d5eadf7f2df806e3afe800aa76627c93abf41dcdfa5ca275ed038b8552e144aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-04T21:50:27Z","title_canon_sha256":"884d4cad10b52b413a1ed089f5be5d6e66888a83fa0650093220300bc007a034"},"schema_version":"1.0","source":{"id":"1704.01199","kind":"arxiv","version":1}},"canonical_sha256":"f52bd8ea4d65b4134cfbbdf2e2dd3f35f40443a6d88f0e9f9a5c5c20749bdfd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f52bd8ea4d65b4134cfbbdf2e2dd3f35f40443a6d88f0e9f9a5c5c20749bdfd3","first_computed_at":"2026-05-18T00:46:58.816727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:58.816727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nxh+xLF6dzoRr8g5RHeAwqOBxhjYtQMtBLTcffUhhpEwuaf1CDreq4oY/k7KH3hL04YWvcwHq8T78RPeTvP4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:58.817185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abe0be8fbe347e77998f06183905b151a8f49acdba4b5a8f82d4d8dcc52dc724","sha256:32754c55ad8a1a78bd3d7a3bd5869333c7f7fbd52273894d6ba853ebb9508a42"],"state_sha256":"4b373ed0d2316f3b42507eae0086471fbeb6e6c93910840fc9bcbc2686e3920f"}