{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4ONYZCLFTVKMWDGLXNDC6NAE2Y","short_pith_number":"pith:4ONYZCLF","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"},"canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","source":{"kind":"arxiv","id":"2606.08772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08772","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08772v1","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08772","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"4ONYZCLFTVKM","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_16","alias_value":"4ONYZCLFTVKMWDGL","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_8","alias_value":"4ONYZCLF","created_at":"2026-06-09T02:07:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4ONYZCLFTVKMWDGLXNDC6NAE2Y","target":"record","payload":{"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"},"canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","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"},"source_kind":"arxiv","source_id":"2606.08772","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-06-09T02:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UugZ0HXYCZ26Np5e9DqK+7ozMxuspchQhA5CVu6G2KxCx6jaQmdBJUVCem6emkPEOOOEU+drYc53NUXJh0WOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:14:59.475740Z"},"content_sha256":"0af707e268253bb0e2e3c5753ac0ee601248ca2e5cd4c20c70a9b04496669875","schema_version":"1.0","event_id":"sha256:0af707e268253bb0e2e3c5753ac0ee601248ca2e5cd4c20c70a9b04496669875"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4ONYZCLFTVKMWDGLXNDC6NAE2Y","target":"graph","payload":{"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"},"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-06-09T02:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rel//gOmpPPZWmFz7qvKbLyiUpXXrNJTxB8+5XGDkgW2PMkZ7chqJvS7Fslb7Mewowr8epUUrwcZheHgBIS2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:14:59.476129Z"},"content_sha256":"ba7a1fe997b581b47e6c096da49e5d0e9d87e705002a5703c44ac4993af4dddd","schema_version":"1.0","event_id":"sha256:ba7a1fe997b581b47e6c096da49e5d0e9d87e705002a5703c44ac4993af4dddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/bundle.json","state_url":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/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-07-03T21:14:59Z","links":{"resolver":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y","bundle":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/bundle.json","state":"https://pith.science/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ONYZCLFTVKMWDGLXNDC6NAE2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4ONYZCLFTVKMWDGLXNDC6NAE2Y","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":"a924c6a1f5d39153ae6b061d817d30c119a0a7d931df732815efcf18f684be20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T18:35:23Z","title_canon_sha256":"76fcc68607d1da2935293a2e57652688fa1801f410746d8fdb56d51ac1da4c4f"},"schema_version":"1.0","source":{"id":"2606.08772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08772","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08772v1","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08772","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"4ONYZCLFTVKM","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_16","alias_value":"4ONYZCLFTVKMWDGL","created_at":"2026-06-09T02:07:38Z"},{"alias_kind":"pith_short_8","alias_value":"4ONYZCLF","created_at":"2026-06-09T02:07:38Z"}],"graph_snapshots":[{"event_id":"sha256:ba7a1fe997b581b47e6c096da49e5d0e9d87e705002a5703c44ac4993af4dddd","target":"graph","created_at":"2026-06-09T02:07:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.08772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guillermo Rey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T18:35:23Z","title":"Pairwise meets of antichains in $\\mathbb{Z}^d$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08772","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:0af707e268253bb0e2e3c5753ac0ee601248ca2e5cd4c20c70a9b04496669875","target":"record","created_at":"2026-06-09T02:07:38Z","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":"a924c6a1f5d39153ae6b061d817d30c119a0a7d931df732815efcf18f684be20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T18:35:23Z","title_canon_sha256":"76fcc68607d1da2935293a2e57652688fa1801f410746d8fdb56d51ac1da4c4f"},"schema_version":"1.0","source":{"id":"2606.08772","kind":"arxiv","version":1}},"canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e39b8c89659d54cb0ccbbb462f3404d61ae1d06f0ec61b49cfe842e1237b4b38","first_computed_at":"2026-06-09T02:07:38.525353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:38.525353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"js75Ts3syF0xdolu0/K1yhD4z/Vu2htB3yCtsOmMzjcg2Rq67g+lBrVgS++dIBeLhD/zfg5ftV4PQrN2KUYCAg==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:38.526117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0af707e268253bb0e2e3c5753ac0ee601248ca2e5cd4c20c70a9b04496669875","sha256:ba7a1fe997b581b47e6c096da49e5d0e9d87e705002a5703c44ac4993af4dddd"],"state_sha256":"b437a51dbac975df2be77cf5fdfd9baaad80b5ae119d472f5ffe605725ceb73c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CqqlTSJC2RowD+57Hfu+DcPokHu1Cqe0f4z9HEfl56EIcLIhs5RIim25hGy+vP3+in/18o4BuNuJIyfF/gBCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:14:59.477951Z","bundle_sha256":"5a8d646bc1df6179b8e1d5798b6d38fad62858b1c2d9849c8d2f0ea718d54bed"}}