{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2TXJJUQYFFNW7LOYB7WMKAWUQG","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":"54b0ec1fd30034122b3b2f55b128dc606486cb37623596b8c67b83ff42901508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-19T16:10:28Z","title_canon_sha256":"b4660bcbdb64023da9764dac88670171271a514c72eab574286a33a2888b33fe"},"schema_version":"1.0","source":{"id":"1309.5036","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5036","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5036v3","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5036","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"2TXJJUQYFFNW","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2TXJJUQYFFNW7LOY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2TXJJUQY","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:59be77941da767018114a834a40d4c3be05a6e53ee5f9e07f05bea889b2f4875","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18. Here we adapt and improve this algorithm to construct and count modular lattices up to size 24, semimodular lattices up to size 22, and lattices of size 19. We also show that $2^{n-3}$ is a lower bound for the number of nonisomorphic modular lattices of size $n$.","authors_text":"Nathan Lawless, Peter Jipsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-19T16:10:28Z","title":"Generating all finite modular lattices of a given size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5036","kind":"arxiv","version":3},"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:d72ef737fe10acfcebc7b2cb7c4dee2f981d675042044c6c3e195c23d9e147fe","target":"record","created_at":"2026-05-18T01:32:42Z","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":"54b0ec1fd30034122b3b2f55b128dc606486cb37623596b8c67b83ff42901508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-19T16:10:28Z","title_canon_sha256":"b4660bcbdb64023da9764dac88670171271a514c72eab574286a33a2888b33fe"},"schema_version":"1.0","source":{"id":"1309.5036","kind":"arxiv","version":3}},"canonical_sha256":"d4ee94d218295b6fadd80fecc502d48190006b90fc610502fd0617136aee6d96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4ee94d218295b6fadd80fecc502d48190006b90fc610502fd0617136aee6d96","first_computed_at":"2026-05-18T01:32:42.032368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.032368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"elLGRy6j2AMzYKNuggV8TrfyLwONnOwDZXLR4MXVOONTkzdoD6gBIb2N6E1x32hYYFjKaSNu2XFtB0HhnZv0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.032795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5036","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d72ef737fe10acfcebc7b2cb7c4dee2f981d675042044c6c3e195c23d9e147fe","sha256:59be77941da767018114a834a40d4c3be05a6e53ee5f9e07f05bea889b2f4875"],"state_sha256":"cbf30c2b5fccb848c8bc528892fba16df6abae52187663d3c38d1e45d7e54b60"}