{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3GY7ITODQHRV5Q6QO5272FSSKG","short_pith_number":"pith:3GY7ITOD","schema_version":"1.0","canonical_sha256":"d9b1f44dc381e35ec3d07775fd16525180a27d36cc2dc4a5ed7cb99b05397805","source":{"kind":"arxiv","id":"1701.03751","version":1},"attestation_state":"computed","paper":{"title":"Generation of Union Closed Sets and Moore families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gunnar Brinkmann, Robin Deklerck","submitted_at":"2017-01-13T17:45:37Z","abstract_excerpt":"In this article we will describe an algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets. We confirm the number of isomorphism classes of Union closed Sets and Moore sets on n<=6 elements presented by other authors and give the number of isomorphism classes of Union closed Sets and Moore sets on 7 elements. Due to the enormous growth of the number of isomorphism classes it seems unlikely that constructive enumeration for 8 or more elements will be possible in the foreseeable future."},"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":"1701.03751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T17:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"abb7587920e7dff983f9501dd00fe0c478c901608aa548f1df898c7855ac1e19","abstract_canon_sha256":"e5c2431f3284fa88e8c933c51bf99785a7bc89830df9b27682cbac31b9b034c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.945478Z","signature_b64":"BX++bXgSkdrJM9FdMO3rkoeDQj/2NU6F0p88RcxKW7FSXQdH2VnUT04HDFNIvRZ+6Ic7umMv6aLE9oUy0LxABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b1f44dc381e35ec3d07775fd16525180a27d36cc2dc4a5ed7cb99b05397805","last_reissued_at":"2026-05-18T00:52:53.944783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.944783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation of Union Closed Sets and Moore families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gunnar Brinkmann, Robin Deklerck","submitted_at":"2017-01-13T17:45:37Z","abstract_excerpt":"In this article we will describe an algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets. We confirm the number of isomorphism classes of Union closed Sets and Moore sets on n<=6 elements presented by other authors and give the number of isomorphism classes of Union closed Sets and Moore sets on 7 elements. Due to the enormous growth of the number of isomorphism classes it seems unlikely that constructive enumeration for 8 or more elements will be possible in the foreseeable future."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03751","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":"1701.03751","created_at":"2026-05-18T00:52:53.944885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03751v1","created_at":"2026-05-18T00:52:53.944885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03751","created_at":"2026-05-18T00:52:53.944885+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GY7ITODQHRV","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GY7ITODQHRV5Q6Q","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GY7ITOD","created_at":"2026-05-18T12:30:58.224056+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/3GY7ITODQHRV5Q6QO5272FSSKG","json":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG.json","graph_json":"https://pith.science/api/pith-number/3GY7ITODQHRV5Q6QO5272FSSKG/graph.json","events_json":"https://pith.science/api/pith-number/3GY7ITODQHRV5Q6QO5272FSSKG/events.json","paper":"https://pith.science/paper/3GY7ITOD"},"agent_actions":{"view_html":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG","download_json":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG.json","view_paper":"https://pith.science/paper/3GY7ITOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03751&json=true","fetch_graph":"https://pith.science/api/pith-number/3GY7ITODQHRV5Q6QO5272FSSKG/graph.json","fetch_events":"https://pith.science/api/pith-number/3GY7ITODQHRV5Q6QO5272FSSKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG/action/storage_attestation","attest_author":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG/action/author_attestation","sign_citation":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG/action/citation_signature","submit_replication":"https://pith.science/pith/3GY7ITODQHRV5Q6QO5272FSSKG/action/replication_record"}},"created_at":"2026-05-18T00:52:53.944885+00:00","updated_at":"2026-05-18T00:52:53.944885+00:00"}