{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IPIUDJCTSRSP2PKWNW7AKRDEBG","short_pith_number":"pith:IPIUDJCT","schema_version":"1.0","canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","source":{"kind":"arxiv","id":"1008.2818","version":1},"attestation_state":"computed","paper":{"title":"Decomposition theorem on matchable distributive lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dewu Yang, Haiyuan Yao, Heping Zhang","submitted_at":"2010-08-17T04:57:40Z","abstract_excerpt":"A distributive lattice structure ${\\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a distributive lattice. It is natural to ask which lattices are MDLs. We show that if a plane bipartite graph $G$ is elementary, then ${\\mathbf M}(G)$ is irreducible. Based on this result, a decomposition theorem on MDLs is obtained: a finite distributive lattice $\\mathbf{L}$ is an MDL if and only if each factor in any cartesian product decomposition of $\\mathbf{L}$ "},"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":"1008.2818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-17T04:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"a2eb9ecfd1ee4d8cc2dea86b3568dcdac7ed64f2615e6db9abecf79218d1816a","abstract_canon_sha256":"8644608e6813a563062be862e44d1ab1ecb42d18bbd63edee56caade3d0447f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:32.946963Z","signature_b64":"KsmMCsLhCSt6Pdw6Qic78kvF0GRwAFhxj9dUCd69vKKqoW0y13MZT0/QBRpKMr/ojkWKYuJUV9GLz9PrU5+3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","last_reissued_at":"2026-05-18T02:25:32.946609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:32.946609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition theorem on matchable distributive lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dewu Yang, Haiyuan Yao, Heping Zhang","submitted_at":"2010-08-17T04:57:40Z","abstract_excerpt":"A distributive lattice structure ${\\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a distributive lattice. It is natural to ask which lattices are MDLs. We show that if a plane bipartite graph $G$ is elementary, then ${\\mathbf M}(G)$ is irreducible. Based on this result, a decomposition theorem on MDLs is obtained: a finite distributive lattice $\\mathbf{L}$ is an MDL if and only if each factor in any cartesian product decomposition of $\\mathbf{L}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2818","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":"1008.2818","created_at":"2026-05-18T02:25:32.946662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2818v1","created_at":"2026-05-18T02:25:32.946662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2818","created_at":"2026-05-18T02:25:32.946662+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPIUDJCTSRSP","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPIUDJCTSRSP2PKW","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPIUDJCT","created_at":"2026-05-18T12:26:09.077623+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/IPIUDJCTSRSP2PKWNW7AKRDEBG","json":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG.json","graph_json":"https://pith.science/api/pith-number/IPIUDJCTSRSP2PKWNW7AKRDEBG/graph.json","events_json":"https://pith.science/api/pith-number/IPIUDJCTSRSP2PKWNW7AKRDEBG/events.json","paper":"https://pith.science/paper/IPIUDJCT"},"agent_actions":{"view_html":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG","download_json":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG.json","view_paper":"https://pith.science/paper/IPIUDJCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2818&json=true","fetch_graph":"https://pith.science/api/pith-number/IPIUDJCTSRSP2PKWNW7AKRDEBG/graph.json","fetch_events":"https://pith.science/api/pith-number/IPIUDJCTSRSP2PKWNW7AKRDEBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/action/storage_attestation","attest_author":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/action/author_attestation","sign_citation":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/action/citation_signature","submit_replication":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/action/replication_record"}},"created_at":"2026-05-18T02:25:32.946662+00:00","updated_at":"2026-05-18T02:25:32.946662+00:00"}