{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E33VGLXKPOIHJBFKVAHCS6XF3V","short_pith_number":"pith:E33VGLXK","canonical_record":{"source":{"id":"2605.13617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-13T14:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"693e6be0b1b678c8da263a68f778928f5ecd1ecabbf1b1ddd1c60b2e2ef4d8b9","abstract_canon_sha256":"9bf8e788d8e8089598c3a656a0fd1135fc2295fa6d5ded43575175ae7973dc7d"},"schema_version":"1.0"},"canonical_sha256":"26f7532eea7b907484aaa80e297ae5dd52daba3a0c7e453370221aa9716f7d53","source":{"kind":"arxiv","id":"2605.13617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13617","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13617v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13617","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"E33VGLXKPOIH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"E33VGLXKPOIHJBFK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"E33VGLXK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E33VGLXKPOIHJBFKVAHCS6XF3V","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-13T14:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"693e6be0b1b678c8da263a68f778928f5ecd1ecabbf1b1ddd1c60b2e2ef4d8b9","abstract_canon_sha256":"9bf8e788d8e8089598c3a656a0fd1135fc2295fa6d5ded43575175ae7973dc7d"},"schema_version":"1.0"},"canonical_sha256":"26f7532eea7b907484aaa80e297ae5dd52daba3a0c7e453370221aa9716f7d53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.960447Z","signature_b64":"GkJfwUdz9qeT1gukjb5t/misObhwT7tTN8NPJh4L6hwr3c2+J0nANtNssDYVVDZvlAz5iUgw95Lfz0nk3bVIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f7532eea7b907484aaa80e297ae5dd52daba3a0c7e453370221aa9716f7d53","last_reissued_at":"2026-05-18T02:44:17.959881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.959881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13617","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:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bka/K+K1rgSE2daVzwVY3pNs+n6Rrho0RX3FfUFY6rmsUoCUVjEcEW/4anWDIwLb15BMBkQE7c0lAPzdcKSUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:29:05.808161Z"},"content_sha256":"811b42180d2d158027ab080d3deae562a360ddcc83220cc4f8c46616e1e17378","schema_version":"1.0","event_id":"sha256:811b42180d2d158027ab080d3deae562a360ddcc83220cc4f8c46616e1e17378"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E33VGLXKPOIHJBFKVAHCS6XF3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Some Properties of LCM-Lattices of Edge Ideals of k-Uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges.","cross_cats":[],"primary_cat":"math.AC","authors_text":"Muneeba Mansha, Sarfraz Ahmad","submitted_at":"2026-05-13T14:46:34Z","abstract_excerpt":"In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\\H$ be a hypergraph, $I(\\H)$ its corresponding edge ideal in a polynomial ring in $n$ variables, and $\\mathrm{Icm}(I(\\H))$ the associated lcm-lattice. We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case. Additionally, we study the effects of polarization on the lcm-lattices of $I(\\H)$ and its"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The hypergraph is k-uniform and the stated combinatorial conditions on its edges suffice to force the lattice-theoretic properties; the proofs rely on the standard correspondence between monomial generators and hypergraph edges without additional hidden restrictions on the ground set or characteristic.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Conditions are established for lcm-lattices of edge ideals of k-uniform hypergraphs to be Boolean, modular, or complemented, with extensions to products and polarization effects.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ca22aaeba2199b89633c78d3a8337385df4bde624327815026e7973cf8f0101f"},"source":{"id":"2605.13617","kind":"arxiv","version":1},"verdict":{"id":"a00164f3-6c41-4500-9f85-25e61f8e4790","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:54:36.313176Z","strongest_claim":"We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case.","one_line_summary":"Conditions are established for lcm-lattices of edge ideals of k-uniform hypergraphs to be Boolean, modular, or complemented, with extensions to products and polarization effects.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The hypergraph is k-uniform and the stated combinatorial conditions on its edges suffice to force the lattice-theoretic properties; the proofs rely on the standard correspondence between monomial generators and hypergraph edges without additional hidden restrictions on the ground set or characteristic.","pith_extraction_headline":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges."},"references":{"count":12,"sample":[{"doi":"","year":1967,"title":"Birkhoff, G. (1967). Lattice theory, vol. XXV. In American Mathematical Society Colloquium Publications, Providence, RI","work_id":"746f963d-dd2c-4dc6-982f-f47aef68e105","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"A., & Priestley, H","work_id":"dd20505e-c656-4f1d-9ffe-86e8b855205b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Properties of LCM Lattices of Monomial Ideals","work_id":"524223de-82f7-4144-ab02-8bd9e4e305ac","ref_index":3,"cited_arxiv_id":"2505.08722","is_internal_anchor":true},{"doi":"","year":2025,"title":"Dorang, M. T. (2025). Characterizations of edge ideals via LCM lattices (Master’s thesis, Iowa State University)","work_id":"62bd1a8d-abef-4efc-badd-40d90f96f437","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Faridi, S. (2019). Lattice complements and the subadditivity of syzygies of simplicial forests. Journal/Conference, 535-546","work_id":"8910cc37-0f86-4549-b0d7-52f777964977","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"585e2f7f54a710781e68615188418d578f6a5c6a3fd06ca1f99bfcac6092663e","internal_anchors":1},"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":"a00164f3-6c41-4500-9f85-25e61f8e4790"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhqhPefwVaDfMCWkFwHWwdi4PYEIQX4Yym2gyUJEhBMyA6iUmBkE04vuSkLc80+xTchYQ9fwRBhyQijNP/k/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:29:05.809657Z"},"content_sha256":"64af41b503b65c084d0c791d10cd017f4afc9b4af0df1a6cbfc667a27af7f8fb","schema_version":"1.0","event_id":"sha256:64af41b503b65c084d0c791d10cd017f4afc9b4af0df1a6cbfc667a27af7f8fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/bundle.json","state_url":"https://pith.science/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/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-05-31T13:29:05Z","links":{"resolver":"https://pith.science/pith/E33VGLXKPOIHJBFKVAHCS6XF3V","bundle":"https://pith.science/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/bundle.json","state":"https://pith.science/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E33VGLXKPOIHJBFKVAHCS6XF3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E33VGLXKPOIHJBFKVAHCS6XF3V","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":"9bf8e788d8e8089598c3a656a0fd1135fc2295fa6d5ded43575175ae7973dc7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-13T14:46:34Z","title_canon_sha256":"693e6be0b1b678c8da263a68f778928f5ecd1ecabbf1b1ddd1c60b2e2ef4d8b9"},"schema_version":"1.0","source":{"id":"2605.13617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13617","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13617v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13617","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"E33VGLXKPOIH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"E33VGLXKPOIHJBFK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"E33VGLXK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:64af41b503b65c084d0c791d10cd017f4afc9b4af0df1a6cbfc667a27af7f8fb","target":"graph","created_at":"2026-05-18T02:44:17Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The hypergraph is k-uniform and the stated combinatorial conditions on its edges suffice to force the lattice-theoretic properties; the proofs rely on the standard correspondence between monomial generators and hypergraph edges without additional hidden restrictions on the ground set or characteristic."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Conditions are established for lcm-lattices of edge ideals of k-uniform hypergraphs to be Boolean, modular, or complemented, with extensions to products and polarization effects."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges."}],"snapshot_sha256":"ca22aaeba2199b89633c78d3a8337385df4bde624327815026e7973cf8f0101f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\\H$ be a hypergraph, $I(\\H)$ its corresponding edge ideal in a polynomial ring in $n$ variables, and $\\mathrm{Icm}(I(\\H))$ the associated lcm-lattice. We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case. Additionally, we study the effects of polarization on the lcm-lattices of $I(\\H)$ and its","authors_text":"Muneeba Mansha, Sarfraz Ahmad","cross_cats":[],"headline":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-13T14:46:34Z","title":"On Some Properties of LCM-Lattices of Edge Ideals of k-Uniform Hypergraphs"},"references":{"count":12,"internal_anchors":1,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Birkhoff, G. (1967). Lattice theory, vol. XXV. In American Mathematical Society Colloquium Publications, Providence, RI","work_id":"746f963d-dd2c-4dc6-982f-f47aef68e105","year":1967},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A., & Priestley, H","work_id":"dd20505e-c656-4f1d-9ffe-86e8b855205b","year":2002},{"cited_arxiv_id":"2505.08722","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Properties of LCM Lattices of Monomial Ideals","work_id":"524223de-82f7-4144-ab02-8bd9e4e305ac","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Dorang, M. T. (2025). Characterizations of edge ideals via LCM lattices (Master’s thesis, Iowa State University)","work_id":"62bd1a8d-abef-4efc-badd-40d90f96f437","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Faridi, S. (2019). Lattice complements and the subadditivity of syzygies of simplicial forests. Journal/Conference, 535-546","work_id":"8910cc37-0f86-4549-b0d7-52f777964977","year":2019}],"snapshot_sha256":"585e2f7f54a710781e68615188418d578f6a5c6a3fd06ca1f99bfcac6092663e"},"source":{"id":"2605.13617","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:54:36.313176Z","id":"a00164f3-6c41-4500-9f85-25e61f8e4790","model_set":{"reader":"grok-4.3"},"one_line_summary":"Conditions are established for lcm-lattices of edge ideals of k-uniform hypergraphs to be Boolean, modular, or complemented, with extensions to products and polarization effects.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The lcm-lattice of an edge ideal of a k-uniform hypergraph is Boolean, modular, or complemented under stated conditions on its edges.","strongest_claim":"We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case.","weakest_assumption":"The hypergraph is k-uniform and the stated combinatorial conditions on its edges suffice to force the lattice-theoretic properties; the proofs rely on the standard correspondence between monomial generators and hypergraph edges without additional hidden restrictions on the ground set or characteristic."}},"verdict_id":"a00164f3-6c41-4500-9f85-25e61f8e4790"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:811b42180d2d158027ab080d3deae562a360ddcc83220cc4f8c46616e1e17378","target":"record","created_at":"2026-05-18T02:44:17Z","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":"9bf8e788d8e8089598c3a656a0fd1135fc2295fa6d5ded43575175ae7973dc7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-13T14:46:34Z","title_canon_sha256":"693e6be0b1b678c8da263a68f778928f5ecd1ecabbf1b1ddd1c60b2e2ef4d8b9"},"schema_version":"1.0","source":{"id":"2605.13617","kind":"arxiv","version":1}},"canonical_sha256":"26f7532eea7b907484aaa80e297ae5dd52daba3a0c7e453370221aa9716f7d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26f7532eea7b907484aaa80e297ae5dd52daba3a0c7e453370221aa9716f7d53","first_computed_at":"2026-05-18T02:44:17.959881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.959881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GkJfwUdz9qeT1gukjb5t/misObhwT7tTN8NPJh4L6hwr3c2+J0nANtNssDYVVDZvlAz5iUgw95Lfz0nk3bVIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.960447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811b42180d2d158027ab080d3deae562a360ddcc83220cc4f8c46616e1e17378","sha256:64af41b503b65c084d0c791d10cd017f4afc9b4af0df1a6cbfc667a27af7f8fb"],"state_sha256":"16d9fa7fd46cd6fc547038ea878e07c2342681df845118a6da82d60cee858bb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0p8D8lK0+RYQb0K4uXR2XzYAQ7FvHElKBb87/wV1Qh+NyQpWq105+dvWt4E6l0N6iiflk7kRFSRwtGmuEx+VDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:29:05.816232Z","bundle_sha256":"9a9609485ba6131caa95d0fc3a160811d8e816f6f40aab20ceb7ca144a30ff44"}}