{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E5XJS6QJB3EQB2LITJWKB4UK7B","short_pith_number":"pith:E5XJS6QJ","schema_version":"1.0","canonical_sha256":"276e997a090ec900e9689a6ca0f28af86855236ef19414f1446bb75951de1c55","source":{"kind":"arxiv","id":"1709.06044","version":2},"attestation_state":"computed","paper":{"title":"Counting Steiner triple systems with classical parameters and prescribed rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Jungnickel, Vladimir D. Tonchev","submitted_at":"2017-09-18T17:00:26Z","abstract_excerpt":"By a famous result of Doyen, Hubaut and Vandensavel \\cite{DHV}, the 2-rank of a Steiner triple system on $2^n-1$ points is at least $2^n -1 -n$, and equality holds only for the classical point-line design in the projective geometry $PG(n-1,2)$. It follows from results of Assmus \\cite{A} that, given any integer $t$ with $1 \\leq t \\leq n-1$, there is a code $C_{n,t}$ containing representatives of all isomorphism classes of STS$(2^n-1)$ with 2-rank at most $2^n -1 -n + t$. Using a mixture of coding theoretic, geometric, design theoretic and combinatorial arguments, we prove a general formula for "},"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":"1709.06044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T17:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"04687a7c3132103c451301e58709535a1e96fda3d4f5c6fce238ef631349be1c","abstract_canon_sha256":"97c3793c56e3acffd20b4dff428a1cd01e103f316b1bb453022d0d6a805e3de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.110297Z","signature_b64":"6KD2djwceagKXpgVLzgmHIk2QVobRDaXh9g/GSsLv0EsjaX5dV7ZuyujvwwnHCcMo/XA7z8Q/icsxSSJC+e8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276e997a090ec900e9689a6ca0f28af86855236ef19414f1446bb75951de1c55","last_reissued_at":"2026-05-18T00:08:55.109634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.109634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Steiner triple systems with classical parameters and prescribed rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Jungnickel, Vladimir D. Tonchev","submitted_at":"2017-09-18T17:00:26Z","abstract_excerpt":"By a famous result of Doyen, Hubaut and Vandensavel \\cite{DHV}, the 2-rank of a Steiner triple system on $2^n-1$ points is at least $2^n -1 -n$, and equality holds only for the classical point-line design in the projective geometry $PG(n-1,2)$. It follows from results of Assmus \\cite{A} that, given any integer $t$ with $1 \\leq t \\leq n-1$, there is a code $C_{n,t}$ containing representatives of all isomorphism classes of STS$(2^n-1)$ with 2-rank at most $2^n -1 -n + t$. Using a mixture of coding theoretic, geometric, design theoretic and combinatorial arguments, we prove a general formula for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06044","kind":"arxiv","version":2},"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":"1709.06044","created_at":"2026-05-18T00:08:55.109737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06044v2","created_at":"2026-05-18T00:08:55.109737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06044","created_at":"2026-05-18T00:08:55.109737+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5XJS6QJB3EQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5XJS6QJB3EQB2LI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5XJS6QJ","created_at":"2026-05-18T12:31:12.930513+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/E5XJS6QJB3EQB2LITJWKB4UK7B","json":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B.json","graph_json":"https://pith.science/api/pith-number/E5XJS6QJB3EQB2LITJWKB4UK7B/graph.json","events_json":"https://pith.science/api/pith-number/E5XJS6QJB3EQB2LITJWKB4UK7B/events.json","paper":"https://pith.science/paper/E5XJS6QJ"},"agent_actions":{"view_html":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B","download_json":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B.json","view_paper":"https://pith.science/paper/E5XJS6QJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06044&json=true","fetch_graph":"https://pith.science/api/pith-number/E5XJS6QJB3EQB2LITJWKB4UK7B/graph.json","fetch_events":"https://pith.science/api/pith-number/E5XJS6QJB3EQB2LITJWKB4UK7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B/action/storage_attestation","attest_author":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B/action/author_attestation","sign_citation":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B/action/citation_signature","submit_replication":"https://pith.science/pith/E5XJS6QJB3EQB2LITJWKB4UK7B/action/replication_record"}},"created_at":"2026-05-18T00:08:55.109737+00:00","updated_at":"2026-05-18T00:08:55.109737+00:00"}