{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4ONYZCLFTVKMWDGLXNDC6NAE2Y","short_pith_number":"pith:4ONYZCLF","schema_version":"1.0","canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","source":{"kind":"arxiv","id":"2606.08772","version":1},"attestation_state":"computed","paper":{"title":"Pairwise meets of antichains in $\\mathbb{Z}^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Rey","submitted_at":"2026-06-07T18:35:23Z","abstract_excerpt":"The meet of two points in $\\mathbb{Z}^d$ is their coordinatewise minimum. We show that every finite antichain $A$ in $\\mathbb{Z}^d$ has at least $c_d |A|^{d/(d-1)}$ distinct pairwise meets, where $c_d > 0$ depends only on $d$, and that the exponent $d/(d-1)$ is best possible. As a corollary we obtain an isoperimetric inequality for downsets: every finite downset $D$ in $\\mathbb{Z}^d_{\\geq 0}$ satisfies $|D| \\geq c_d |\\max(D)|^{d/(d-1)}$, where $\\max(D)$ is its set of maximal elements. By prime factorization the meet bound also yields a lower bound on greatest common divisors: a primitive set o"},"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":"2606.08772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T18:35:23Z","cross_cats_sorted":[],"title_canon_sha256":"76fcc68607d1da2935293a2e57652688fa1801f410746d8fdb56d51ac1da4c4f","abstract_canon_sha256":"a924c6a1f5d39153ae6b061d817d30c119a0a7d931df732815efcf18f684be20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:38.526117Z","signature_b64":"js75Ts3syF0xdolu0/K1yhD4z/Vu2htB3yCtsOmMzjcg2Rq67g+lBrVgS++dIBeLhD/zfg5ftV4PQrN2KUYCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","last_reissued_at":"2026-06-09T02:07:38.525353Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:38.525353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise meets of antichains in $\\mathbb{Z}^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Rey","submitted_at":"2026-06-07T18:35:23Z","abstract_excerpt":"The meet of two points in $\\mathbb{Z}^d$ is their coordinatewise minimum. We show that every finite antichain $A$ in $\\mathbb{Z}^d$ has at least $c_d |A|^{d/(d-1)}$ distinct pairwise meets, where $c_d > 0$ depends only on $d$, and that the exponent $d/(d-1)$ is best possible. As a corollary we obtain an isoperimetric inequality for downsets: every finite downset $D$ in $\\mathbb{Z}^d_{\\geq 0}$ satisfies $|D| \\geq c_d |\\max(D)|^{d/(d-1)}$, where $\\max(D)$ is its set of maximal elements. By prime factorization the meet bound also yields a lower bound on greatest common divisors: a primitive set o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08772","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.08772/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.08772","created_at":"2026-06-09T02:07:38.525477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08772v1","created_at":"2026-06-09T02:07:38.525477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08772","created_at":"2026-06-09T02:07:38.525477+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ONYZCLFTVKM","created_at":"2026-06-09T02:07:38.525477+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ONYZCLFTVKMWDGL","created_at":"2026-06-09T02:07:38.525477+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ONYZCLF","created_at":"2026-06-09T02:07:38.525477+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/4ONYZCLFTVKMWDGLXNDC6NAE2Y","json":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y.json","graph_json":"https://pith.science/api/pith-number/4ONYZCLFTVKMWDGLXNDC6NAE2Y/graph.json","events_json":"https://pith.science/api/pith-number/4ONYZCLFTVKMWDGLXNDC6NAE2Y/events.json","paper":"https://pith.science/paper/4ONYZCLF"},"agent_actions":{"view_html":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y","download_json":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y.json","view_paper":"https://pith.science/paper/4ONYZCLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08772&json=true","fetch_graph":"https://pith.science/api/pith-number/4ONYZCLFTVKMWDGLXNDC6NAE2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/4ONYZCLFTVKMWDGLXNDC6NAE2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/action/storage_attestation","attest_author":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/action/author_attestation","sign_citation":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/action/citation_signature","submit_replication":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/action/replication_record"}},"created_at":"2026-06-09T02:07:38.525477+00:00","updated_at":"2026-06-09T02:07:38.525477+00:00"}