{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7XFDIT7AORD5D7IXSRXBHWHJA6","short_pith_number":"pith:7XFDIT7A","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"},"canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","source":{"kind":"arxiv","id":"1411.3024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3024","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3024v1","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3024","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"7XFDIT7AORD5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7XFDIT7AORD5D7IX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7XFDIT7A","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7XFDIT7AORD5D7IXSRXBHWHJA6","target":"record","payload":{"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"},"canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","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"},"source_kind":"arxiv","source_id":"1411.3024","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-05-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6C/YQkFTwliVgzq3epPPGfKeNRMG3mH5DS+ufZ0X9mZOeJj3JovVCiKefvyJrkIn6hNgBKMCRqjav9WQgrOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:29:15.683309Z"},"content_sha256":"9bde40be282e5c2fcee077394b410d123fff504bf5163b95a4ebb8b65de57da0","schema_version":"1.0","event_id":"sha256:9bde40be282e5c2fcee077394b410d123fff504bf5163b95a4ebb8b65de57da0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7XFDIT7AORD5D7IXSRXBHWHJA6","target":"graph","payload":{"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"},"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-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9x3ptuDDKFgmQsQPahRyJ8faOh92ANeiRklF1zBpZNJ8CpnH5HUK78XsMHQfUhIOmcU/THgoqRW0AuwNt7zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:29:15.684019Z"},"content_sha256":"89b1eb58f4401ede10950e8433a2c6e21a1ead2e32c53c895959cb8ac7c16665","schema_version":"1.0","event_id":"sha256:89b1eb58f4401ede10950e8433a2c6e21a1ead2e32c53c895959cb8ac7c16665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/bundle.json","state_url":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/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-05-20T04:29:15Z","links":{"resolver":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6","bundle":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/bundle.json","state":"https://pith.science/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XFDIT7AORD5D7IXSRXBHWHJA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7XFDIT7AORD5D7IXSRXBHWHJA6","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":"0c0503e8ef072d5054c935dcbd852b1bda8add61e09d1841315f55c75bef539a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T23:48:41Z","title_canon_sha256":"ef63ad392b51eaecb49909689d2b2e5d368cefd87517fafaee97280dbafbcdfa"},"schema_version":"1.0","source":{"id":"1411.3024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3024","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3024v1","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3024","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"7XFDIT7AORD5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7XFDIT7AORD5D7IX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7XFDIT7A","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:89b1eb58f4401ede10950e8433a2c6e21a1ead2e32c53c895959cb8ac7c16665","target":"graph","created_at":"2026-05-18T01:59: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"},"paper":{"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 ","authors_text":"Bal\\'azs Udvari, Bernard Lidick\\'y, Jan Volec, J\\'ozsef Balogh, Oleg Pikhurko, Ping Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T23:48:41Z","title":"Minimum number of monotone subsequences of length 4 in permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3024","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:9bde40be282e5c2fcee077394b410d123fff504bf5163b95a4ebb8b65de57da0","target":"record","created_at":"2026-05-18T01:59: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":"0c0503e8ef072d5054c935dcbd852b1bda8add61e09d1841315f55c75bef539a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T23:48:41Z","title_canon_sha256":"ef63ad392b51eaecb49909689d2b2e5d368cefd87517fafaee97280dbafbcdfa"},"schema_version":"1.0","source":{"id":"1411.3024","kind":"arxiv","version":1}},"canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdca344fe07447d1fd17946e13d8e907aed40fce40bc0b3f606ca6320be80ee3","first_computed_at":"2026-05-18T01:59:38.251290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:38.251290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y/8kjrQK5jlet8qNc40ThM0Uyk+YjWRB2IztVm3xo8VNtrTocT65gItTMqNEYznykGDJvr1H8c5Sj3KHUR5VDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:38.251982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bde40be282e5c2fcee077394b410d123fff504bf5163b95a4ebb8b65de57da0","sha256:89b1eb58f4401ede10950e8433a2c6e21a1ead2e32c53c895959cb8ac7c16665"],"state_sha256":"a1189470bddb3c667ef1025900a8de88815c8758d09ab51bee5b7b9abae2c88f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"me4KB9IFtok0kbnoxD/rZZ4ojPjpBdiFZ2FRLey2ae68zPTDP3Nkx4sWQMUFWFowLmz3j6oYZXujjelYQ33nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T04:29:15.688141Z","bundle_sha256":"b7bcdd7479442338cced5dcde6f581e33da51cf5a48a291830eed473acb91360"}}