{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GW6SD5GTSPGOMLWHN57JJAALVU","short_pith_number":"pith:GW6SD5GT","schema_version":"1.0","canonical_sha256":"35bd21f4d393cce62ec76f7e94800bad102a822ffa69fb992145a388d0633b76","source":{"kind":"arxiv","id":"1704.03715","version":4},"attestation_state":"computed","paper":{"title":"Tight embedding of modular lattices into partition lattices: progress and program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcel Wild","submitted_at":"2017-04-12T11:49:42Z","abstract_excerpt":"Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible, i.e. |V| = d(L)+1 where d(L) is the length of L. In other words, we strive for a tight (=cover-preserving) lattice homomorphism from L into Part(V). After a 24 year break the author offers progress, and outlines a program to finally fully characterize the lattices L that admit a tight embedding. Not just 'modular latticians' but also combinatorists are encourag"},"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":"1704.03715","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-12T11:49:42Z","cross_cats_sorted":[],"title_canon_sha256":"e31c12763616c3011572aa9eff5fa78e36ffc4b6749734e5f7b1a1926ce10d84","abstract_canon_sha256":"8989ac130640e5a547a41f1bccec6e4b3ea1139dc81d7aa1261b052e68ce550d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.712576Z","signature_b64":"4OF5fpQ+rM7RkGsaCPizvXMB5fM+jyYawJPBPF+Op82ljFecgwpeLicqGo2zD5sEZR+G0Fsgkxi1mqAhOiclAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35bd21f4d393cce62ec76f7e94800bad102a822ffa69fb992145a388d0633b76","last_reissued_at":"2026-05-18T00:03:29.711888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.711888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight embedding of modular lattices into partition lattices: progress and program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcel Wild","submitted_at":"2017-04-12T11:49:42Z","abstract_excerpt":"Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible, i.e. |V| = d(L)+1 where d(L) is the length of L. In other words, we strive for a tight (=cover-preserving) lattice homomorphism from L into Part(V). After a 24 year break the author offers progress, and outlines a program to finally fully characterize the lattices L that admit a tight embedding. Not just 'modular latticians' but also combinatorists are encourag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03715","kind":"arxiv","version":4},"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":"1704.03715","created_at":"2026-05-18T00:03:29.712002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03715v4","created_at":"2026-05-18T00:03:29.712002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03715","created_at":"2026-05-18T00:03:29.712002+00:00"},{"alias_kind":"pith_short_12","alias_value":"GW6SD5GTSPGO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GW6SD5GTSPGOMLWH","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GW6SD5GT","created_at":"2026-05-18T12:31:18.294218+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/GW6SD5GTSPGOMLWHN57JJAALVU","json":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU.json","graph_json":"https://pith.science/api/pith-number/GW6SD5GTSPGOMLWHN57JJAALVU/graph.json","events_json":"https://pith.science/api/pith-number/GW6SD5GTSPGOMLWHN57JJAALVU/events.json","paper":"https://pith.science/paper/GW6SD5GT"},"agent_actions":{"view_html":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU","download_json":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU.json","view_paper":"https://pith.science/paper/GW6SD5GT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03715&json=true","fetch_graph":"https://pith.science/api/pith-number/GW6SD5GTSPGOMLWHN57JJAALVU/graph.json","fetch_events":"https://pith.science/api/pith-number/GW6SD5GTSPGOMLWHN57JJAALVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU/action/storage_attestation","attest_author":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU/action/author_attestation","sign_citation":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU/action/citation_signature","submit_replication":"https://pith.science/pith/GW6SD5GTSPGOMLWHN57JJAALVU/action/replication_record"}},"created_at":"2026-05-18T00:03:29.712002+00:00","updated_at":"2026-05-18T00:03:29.712002+00:00"}