{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ASAOAHA5JCXPSJUB7NPVDXVF4O","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":"03adcb95898a2f66b99764b79e13b3352d2d0141c6fb2d875a3160aa659e3bb9","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-15T13:25:14Z","title_canon_sha256":"f1d02be09cd622daf930f4c50f6d7f128a8120817ac5d143f6169ec419da5b34"},"schema_version":"1.0","source":{"id":"2104.07444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.07444","created_at":"2026-07-05T05:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"2104.07444v3","created_at":"2026-07-05T05:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07444","created_at":"2026-07-05T05:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"ASAOAHA5JCXP","created_at":"2026-07-05T05:47:55Z"},{"alias_kind":"pith_short_16","alias_value":"ASAOAHA5JCXPSJUB","created_at":"2026-07-05T05:47:55Z"},{"alias_kind":"pith_short_8","alias_value":"ASAOAHA5","created_at":"2026-07-05T05:47:55Z"}],"graph_snapshots":[{"event_id":"sha256:d7d8241c3f44566e099b2d3e11dc661de1b413b479e81abd03f02e657506c680","target":"graph","created_at":"2026-07-05T05:47:55Z","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/2104.07444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations.\n  First, we prove that, with high probability as $n$ gets large, the largest independent set in a uniform random cograph with $n$ vertices has size $o(n)$. This answers a question of Kang, McDiarmid, Reed and Scott. Using the connection between graphs and permutations via inversion graphs, we also give a similar result for the longest increasing subsequence in separable permutations","authors_text":"Adeline Pierrot, Fr\\'ed\\'erique Bassino, Lucas Gerin, Mathilde Bouvel, Michael Drmota, Micka\\\"el Maazoun, Valentin F\\'eray","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-15T13:25:14Z","title":"Linear-sized independent sets in random cographs and increasing subsequences in separable permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07444","kind":"arxiv","version":3},"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:cebc5c23d075bfa6468eeddf4accba9739b6c814bd0c96a931986347a5828288","target":"record","created_at":"2026-07-05T05:47:55Z","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":"03adcb95898a2f66b99764b79e13b3352d2d0141c6fb2d875a3160aa659e3bb9","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-15T13:25:14Z","title_canon_sha256":"f1d02be09cd622daf930f4c50f6d7f128a8120817ac5d143f6169ec419da5b34"},"schema_version":"1.0","source":{"id":"2104.07444","kind":"arxiv","version":3}},"canonical_sha256":"0480e01c1d48aef92681fb5f51dea5e3b381fbc575889c85463af766a28fd2f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0480e01c1d48aef92681fb5f51dea5e3b381fbc575889c85463af766a28fd2f8","first_computed_at":"2026-07-05T05:47:55.025551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:55.025551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2oXp847U6DdngqhWknAelwpFT+R13CwnEEHEpdal1WSSZOyW+r8cjlnf8G388F8BWmC4WnbLJg3/HoTbTwDYDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:55.026001Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.07444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cebc5c23d075bfa6468eeddf4accba9739b6c814bd0c96a931986347a5828288","sha256:d7d8241c3f44566e099b2d3e11dc661de1b413b479e81abd03f02e657506c680"],"state_sha256":"9bec55e173012adbc11f209bf2917473c2d686cd7446b719ad843aff1df6ca72"}