{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IPIUDJCTSRSP2PKWNW7AKRDEBG","short_pith_number":"pith:IPIUDJCT","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"},"canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","source":{"kind":"arxiv","id":"1008.2818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2818","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2818v1","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2818","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"IPIUDJCTSRSP","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IPIUDJCTSRSP2PKW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IPIUDJCT","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IPIUDJCTSRSP2PKWNW7AKRDEBG","target":"record","payload":{"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"},"canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","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"},"source_kind":"arxiv","source_id":"1008.2818","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfEEt4XX1m7XtZGLCApZo4BjZOit/7Dxyt/HT4U/t9aA4yUupq+91aGvhSu7TsQROeAMJBFFBPwdU2Zf4K8LDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:59:50.621239Z"},"content_sha256":"9c8b56df34757fc92cdd94b167438bcce2d834a6b3cd27bad9467de51e7d60f2","schema_version":"1.0","event_id":"sha256:9c8b56df34757fc92cdd94b167438bcce2d834a6b3cd27bad9467de51e7d60f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IPIUDJCTSRSP2PKWNW7AKRDEBG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYkD7R2kjx9dxRFWW3Q740t2H0t+0yQe27UluP1DyjawZ46DJSyX6iRPyY3r3qRFZRSzZu+G3k2z8OuuMZyhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:59:50.621606Z"},"content_sha256":"57a266bcb5ef64f32c8bdb4577095b939137c4faa4cda76b37280228e8bb8e64","schema_version":"1.0","event_id":"sha256:57a266bcb5ef64f32c8bdb4577095b939137c4faa4cda76b37280228e8bb8e64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/bundle.json","state_url":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T13:59:50Z","links":{"resolver":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG","bundle":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/bundle.json","state":"https://pith.science/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPIUDJCTSRSP2PKWNW7AKRDEBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IPIUDJCTSRSP2PKWNW7AKRDEBG","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":"8644608e6813a563062be862e44d1ab1ecb42d18bbd63edee56caade3d0447f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-17T04:57:40Z","title_canon_sha256":"a2eb9ecfd1ee4d8cc2dea86b3568dcdac7ed64f2615e6db9abecf79218d1816a"},"schema_version":"1.0","source":{"id":"1008.2818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2818","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2818v1","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2818","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"IPIUDJCTSRSP","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IPIUDJCTSRSP2PKW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IPIUDJCT","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:57a266bcb5ef64f32c8bdb4577095b939137c4faa4cda76b37280228e8bb8e64","target":"graph","created_at":"2026-05-18T02:25:32Z","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":"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}$ ","authors_text":"Dewu Yang, Haiyuan Yao, Heping Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-17T04:57:40Z","title":"Decomposition theorem on matchable distributive lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2818","kind":"arxiv","version":1},"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:9c8b56df34757fc92cdd94b167438bcce2d834a6b3cd27bad9467de51e7d60f2","target":"record","created_at":"2026-05-18T02:25:32Z","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":"8644608e6813a563062be862e44d1ab1ecb42d18bbd63edee56caade3d0447f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-17T04:57:40Z","title_canon_sha256":"a2eb9ecfd1ee4d8cc2dea86b3568dcdac7ed64f2615e6db9abecf79218d1816a"},"schema_version":"1.0","source":{"id":"1008.2818","kind":"arxiv","version":1}},"canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d141a4539464fd3d566dbe054464099c5ad068944aa705f798d6f7696d3a3b","first_computed_at":"2026-05-18T02:25:32.946609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:32.946609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KsmMCsLhCSt6Pdw6Qic78kvF0GRwAFhxj9dUCd69vKKqoW0y13MZT0/QBRpKMr/ojkWKYuJUV9GLz9PrU5+3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:32.946963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c8b56df34757fc92cdd94b167438bcce2d834a6b3cd27bad9467de51e7d60f2","sha256:57a266bcb5ef64f32c8bdb4577095b939137c4faa4cda76b37280228e8bb8e64"],"state_sha256":"b73890f4b60fb98c51ad9c3b638bb43bcbff0915da9fb5695c7b39ea51582367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APNrlT2UBenNchSjvTHe8cVOJ+8YnbPpGmHcJuz35gslbDRVhd4mJXWN4K4PrKcs64AbJ7UwSY8vLo3KvDy8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:59:50.623774Z","bundle_sha256":"10cd7c419dceffd9aede7ee21ab92623ade71c2113fd15299f723473324b42c4"}}