{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MADADSEC7QRK4RZYTERRCMEFC","short_pith_number":"pith:2MADADSE","schema_version":"1.0","canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","source":{"kind":"arxiv","id":"1401.5409","version":2},"attestation_state":"computed","paper":{"title":"Trivial Meet and Join within the Lattice of Monotone Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Hammett, John Engbers","submitted_at":"2014-01-21T18:17:43Z","abstract_excerpt":"The lattice of monotone triangles $(\\mathfrak{M}_n,\\le)$ ordered by entry-wise comparisons is studied. Let $\\tau_{\\min}$ denote the unique minimal element in this lattice, and $\\tau_{\\max}$ the unique maximum. The number of $r$-tuples of monotone triangles $(\\tau_1,\\ldots,\\tau_r)$ with minimal infimum $\\tau_{\\min}$ (maximal supremum $\\tau_{\\max}$, resp.) is shown to asymptotically approach $r|\\mathfrak{M}_n|^{r-1}$ as $n \\to \\infty$. Thus, with high probability this event implies that one of the $\\tau_i$ is $\\tau_{\\min}$ ($\\tau_{\\max}$, resp.). Higher-order error terms are also discussed."},"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":"1401.5409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T18:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"891f43d1459d085e0850c8067eb7a12caaa9e94ca08b1d008d2fc369a646e81d","abstract_canon_sha256":"550fff0c6c5e2ec69081d8171b93bd8c1212638308161244721fb1b91cb66871"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:07.581907Z","signature_b64":"K8hcLVRvwjt2og2oFPhceN1StN3d4z8Z213jbAquB+x5sRahM1AMCt6ZZLxQnRubmWgj+GO9gZmsaBwgNgmKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","last_reissued_at":"2026-05-18T02:47:07.581550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:07.581550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trivial Meet and Join within the Lattice of Monotone Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Hammett, John Engbers","submitted_at":"2014-01-21T18:17:43Z","abstract_excerpt":"The lattice of monotone triangles $(\\mathfrak{M}_n,\\le)$ ordered by entry-wise comparisons is studied. Let $\\tau_{\\min}$ denote the unique minimal element in this lattice, and $\\tau_{\\max}$ the unique maximum. The number of $r$-tuples of monotone triangles $(\\tau_1,\\ldots,\\tau_r)$ with minimal infimum $\\tau_{\\min}$ (maximal supremum $\\tau_{\\max}$, resp.) is shown to asymptotically approach $r|\\mathfrak{M}_n|^{r-1}$ as $n \\to \\infty$. Thus, with high probability this event implies that one of the $\\tau_i$ is $\\tau_{\\min}$ ($\\tau_{\\max}$, resp.). Higher-order error terms are also discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5409","kind":"arxiv","version":2},"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":"1401.5409","created_at":"2026-05-18T02:47:07.581606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5409v2","created_at":"2026-05-18T02:47:07.581606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5409","created_at":"2026-05-18T02:47:07.581606+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MADADSEC7QR","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MADADSEC7QRK4RZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MADADSE","created_at":"2026-05-18T12:28:11.866339+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/2MADADSEC7QRK4RZYTERRCMEFC","json":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC.json","graph_json":"https://pith.science/api/pith-number/2MADADSEC7QRK4RZYTERRCMEFC/graph.json","events_json":"https://pith.science/api/pith-number/2MADADSEC7QRK4RZYTERRCMEFC/events.json","paper":"https://pith.science/paper/2MADADSE"},"agent_actions":{"view_html":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC","download_json":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC.json","view_paper":"https://pith.science/paper/2MADADSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5409&json=true","fetch_graph":"https://pith.science/api/pith-number/2MADADSEC7QRK4RZYTERRCMEFC/graph.json","fetch_events":"https://pith.science/api/pith-number/2MADADSEC7QRK4RZYTERRCMEFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/action/storage_attestation","attest_author":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/action/author_attestation","sign_citation":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/action/citation_signature","submit_replication":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/action/replication_record"}},"created_at":"2026-05-18T02:47:07.581606+00:00","updated_at":"2026-05-18T02:47:07.581606+00:00"}