{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MADADSEC7QRK4RZYTERRCMEFC","short_pith_number":"pith:2MADADSE","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"},"canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","source":{"kind":"arxiv","id":"1401.5409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5409","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5409v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5409","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"2MADADSEC7QR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MADADSEC7QRK4RZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MADADSE","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MADADSEC7QRK4RZYTERRCMEFC","target":"record","payload":{"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"},"canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","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"},"source_kind":"arxiv","source_id":"1401.5409","source_version":2,"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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tH7iirBiZa+PA9o2IZXZrZIePpcACKWox9n3gCa3LijrsFRHU4Cs3ctUOt6UYWPVGjFtKuSKUodt/YP+XzgABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:33:30.050369Z"},"content_sha256":"6ac69abc38fcc45884217263f544bf485ba1e41d056e41fde343a79ae26bc282","schema_version":"1.0","event_id":"sha256:6ac69abc38fcc45884217263f544bf485ba1e41d056e41fde343a79ae26bc282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MADADSEC7QRK4RZYTERRCMEFC","target":"graph","payload":{"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"},"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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5tZL+j31AKX/rxRsrjSW8V6kIhwYjss23anB/rbZNHJvRVuNEYLx7x3uJtlponevyhgCW2VJBBJN5nbKOPYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:33:30.050735Z"},"content_sha256":"fc5bc4123bd7ead7c31002a007497c2325ed555c6e6aaf1229507fffa4249982","schema_version":"1.0","event_id":"sha256:fc5bc4123bd7ead7c31002a007497c2325ed555c6e6aaf1229507fffa4249982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/bundle.json","state_url":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MADADSEC7QRK4RZYTERRCMEFC/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-23T16:33:30Z","links":{"resolver":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC","bundle":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/bundle.json","state":"https://pith.science/pith/2MADADSEC7QRK4RZYTERRCMEFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MADADSEC7QRK4RZYTERRCMEFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MADADSEC7QRK4RZYTERRCMEFC","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":"550fff0c6c5e2ec69081d8171b93bd8c1212638308161244721fb1b91cb66871","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T18:17:43Z","title_canon_sha256":"891f43d1459d085e0850c8067eb7a12caaa9e94ca08b1d008d2fc369a646e81d"},"schema_version":"1.0","source":{"id":"1401.5409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5409","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5409v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5409","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"2MADADSEC7QR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MADADSEC7QRK4RZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MADADSE","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:fc5bc4123bd7ead7c31002a007497c2325ed555c6e6aaf1229507fffa4249982","target":"graph","created_at":"2026-05-18T02:47:07Z","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":"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.","authors_text":"Adam Hammett, John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T18:17:43Z","title":"Trivial Meet and Join within the Lattice of Monotone Triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5409","kind":"arxiv","version":2},"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:6ac69abc38fcc45884217263f544bf485ba1e41d056e41fde343a79ae26bc282","target":"record","created_at":"2026-05-18T02:47:07Z","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":"550fff0c6c5e2ec69081d8171b93bd8c1212638308161244721fb1b91cb66871","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T18:17:43Z","title_canon_sha256":"891f43d1459d085e0850c8067eb7a12caaa9e94ca08b1d008d2fc369a646e81d"},"schema_version":"1.0","source":{"id":"1401.5409","kind":"arxiv","version":2}},"canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d300300e4417e1157239c4c918898428a43d7e91963ad78c1925a46c31977bec","first_computed_at":"2026-05-18T02:47:07.581550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:07.581550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8hcLVRvwjt2og2oFPhceN1StN3d4z8Z213jbAquB+x5sRahM1AMCt6ZZLxQnRubmWgj+GO9gZmsaBwgNgmKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:07.581907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac69abc38fcc45884217263f544bf485ba1e41d056e41fde343a79ae26bc282","sha256:fc5bc4123bd7ead7c31002a007497c2325ed555c6e6aaf1229507fffa4249982"],"state_sha256":"1463e0abb94744ad3c69b30a7562e148e9ef061802e07193c928b02136608284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBmPxeWcKmlmMuEyHCEAXWcZHZdmnX5tov0Q3AaEIgqXiZzLMZXGlSv2nRvwK5xf+9me69tCcmZ9TG3ov87yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:33:30.052762Z","bundle_sha256":"cb79e8818cb608b19b0e2ff3407ee085b94760b96b6fd0888127f918b37aadf8"}}