{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7XFDIT7AORD5D7IXSRXBHWHJA6","short_pith_number":"pith:7XFDIT7A","schema_version":"1.0","canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","source":{"kind":"arxiv","id":"1411.3024","version":1},"attestation_state":"computed","paper":{"title":"Minimum number of monotone subsequences of length 4 in permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Udvari, Bernard Lidick\\'y, Jan Volec, J\\'ozsef Balogh, Oleg Pikhurko, Ping Hu","submitted_at":"2014-11-11T23:48:41Z","abstract_excerpt":"We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\\binom{\\lfloor n/3 \\rfloor}{4} + \\binom{\\lfloor(n+1)/3\\rfloor}{4} + \\binom{\\lfloor (n+2)/3\\rfloor}{4}$. Furthermore, we characterize all permutations on $[n]$ that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colorings of complete graphs with two colors, where the number of monochromatic $K_4$'s is minimized. We show that all "},"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":"1411.3024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T23:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"ef63ad392b51eaecb49909689d2b2e5d368cefd87517fafaee97280dbafbcdfa","abstract_canon_sha256":"0c0503e8ef072d5054c935dcbd852b1bda8add61e09d1841315f55c75bef539a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:38.251982Z","signature_b64":"y/8kjrQK5jlet8qNc40ThM0Uyk+YjWRB2IztVm3xo8VNtrTocT65gItTMqNEYznykGDJvr1H8c5Sj3KHUR5VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","last_reissued_at":"2026-05-18T01:59:38.251290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:38.251290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum number of monotone subsequences of length 4 in permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Udvari, Bernard Lidick\\'y, Jan Volec, J\\'ozsef Balogh, Oleg Pikhurko, Ping Hu","submitted_at":"2014-11-11T23:48:41Z","abstract_excerpt":"We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\\binom{\\lfloor n/3 \\rfloor}{4} + \\binom{\\lfloor(n+1)/3\\rfloor}{4} + \\binom{\\lfloor (n+2)/3\\rfloor}{4}$. Furthermore, we characterize all permutations on $[n]$ that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colorings of complete graphs with two colors, where the number of monochromatic $K_4$'s is minimized. We show that all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3024","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":""},"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":"1411.3024","created_at":"2026-05-18T01:59:38.251413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3024v1","created_at":"2026-05-18T01:59:38.251413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3024","created_at":"2026-05-18T01:59:38.251413+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XFDIT7AORD5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XFDIT7AORD5D7IX","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XFDIT7A","created_at":"2026-05-18T12:28:19.803747+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/7XFDIT7AORD5D7IXSRXBHWHJA6","json":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6.json","graph_json":"https://pith.science/api/pith-number/7XFDIT7AORD5D7IXSRXBHWHJA6/graph.json","events_json":"https://pith.science/api/pith-number/7XFDIT7AORD5D7IXSRXBHWHJA6/events.json","paper":"https://pith.science/paper/7XFDIT7A"},"agent_actions":{"view_html":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6","download_json":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6.json","view_paper":"https://pith.science/paper/7XFDIT7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3024&json=true","fetch_graph":"https://pith.science/api/pith-number/7XFDIT7AORD5D7IXSRXBHWHJA6/graph.json","fetch_events":"https://pith.science/api/pith-number/7XFDIT7AORD5D7IXSRXBHWHJA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/action/storage_attestation","attest_author":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/action/author_attestation","sign_citation":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/action/citation_signature","submit_replication":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/action/replication_record"}},"created_at":"2026-05-18T01:59:38.251413+00:00","updated_at":"2026-05-18T01:59:38.251413+00:00"}